java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:17,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:17,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:17,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:17,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:17,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:17,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:17,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:17,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:17,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:17,908 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:17,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:17,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:17,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:17,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:17,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:17,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:17,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:17,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:17,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:17,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:17,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:17,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:17,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:17,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:17,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:17,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:17,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:17,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:17,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:17,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:17,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:17,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:17,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:17,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:17,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:17,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:17,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:17,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:17,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:17,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:17,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:17,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:17,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:17,984 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:17,984 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:17,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-08-05 10:31:17,985 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-08-05 10:31:18,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:18,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:18,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:18,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:18,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:18,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,053 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:18,054 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:18,054 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:18,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:18,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:18,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:18,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:18,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... [2019-08-05 10:31:18,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:18,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:18,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:18,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:18,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:31:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-08-05 10:31:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-08-05 10:31:18,326 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:18,327 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:31:18,329 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:18 BoogieIcfgContainer [2019-08-05 10:31:18,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:18,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:18,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:18,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:18,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:18" (1/2) ... [2019-08-05 10:31:18,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1b717 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:18, skipping insertion in model container [2019-08-05 10:31:18,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:18" (2/2) ... [2019-08-05 10:31:18,339 INFO L109 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-08-05 10:31:18,349 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:18,359 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:31:18,376 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:31:18,404 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:18,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:18,406 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:18,406 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:18,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:18,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:18,406 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:18,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:18,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 10:31:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:31:18,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:31:18,434 INFO L418 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-08-05 10:31:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:18,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:18,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:31:18,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:18,578 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 10:31:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,625 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:31:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:18,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:31:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,638 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:31:18,639 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:31:18,641 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 10:31:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:31:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:31:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:31:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:31:18,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 10:31:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,670 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:31:18,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:31:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:31:18,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:31:18,671 INFO L418 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-08-05 10:31:18,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:31:18,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:18,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:18,840 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 10:31:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,913 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:31:18,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:18,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:31:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,915 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:31:18,915 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:31:18,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:31:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:31:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:31:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:31:18,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:31:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,919 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:31:18,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:31:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:31:18,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,920 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:31:18,920 INFO L418 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-08-05 10:31:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:31:19,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:19,059 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:31:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,127 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:31:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:31:19,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:31:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,128 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:31:19,129 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:31:19,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:31:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:31:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:31:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:31:19,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:31:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,132 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:31:19,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:31:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:19,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,137 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:31:19,137 INFO L418 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-08-05 10:31:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:31:19,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:19,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:19,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:19,262 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:31:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,288 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:31:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:19,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:31:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,290 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:31:19,290 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:31:19,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:31:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:31:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:31:19,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:31:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,293 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:31:19,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:31:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:19,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,294 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:31:19,294 INFO L418 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-08-05 10:31:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:19,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:19,501 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:31:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,532 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:31:19,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:19,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:31:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,534 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:31:19,535 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:19,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:31:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:31:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:31:19,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:31:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,537 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:31:19,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:31:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:31:19,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,538 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:31:19,539 INFO L418 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-08-05 10:31:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:31:19,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:19,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:19,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:19,791 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:31:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,825 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:31:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:19,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:31:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,826 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:19,826 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:31:19,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:31:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:31:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:31:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:31:19,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:31:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,829 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:31:19,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:31:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:31:19,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,830 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 10:31:19,830 INFO L418 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986075, now seen corresponding path program 6 times [2019-08-05 10:31:19,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:19,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:20,000 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:31:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,102 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:31:20,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:20,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:31:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,104 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:31:20,104 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:31:20,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:31:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:31:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:31:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:31:20,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:31:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,106 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:31:20,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:31:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:20,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,107 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 10:31:20,108 INFO L418 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 218071966, now seen corresponding path program 7 times [2019-08-05 10:31:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:20,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:20,292 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:31:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,321 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:31:20,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:20,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:31:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,323 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:20,323 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:20,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:31:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:31:20,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:31:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,326 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:31:20,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:31:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:20,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,327 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 10:31:20,328 INFO L418 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703611, now seen corresponding path program 8 times [2019-08-05 10:31:20,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:20,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:20,808 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:31:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,841 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:31:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:31:20,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:31:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,843 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:31:20,843 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:20,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:31:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:31:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:31:20,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:31:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,848 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:31:20,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:31:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:20,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,849 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 10:31:20,849 INFO L418 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash -886237058, now seen corresponding path program 9 times [2019-08-05 10:31:20,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:21,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:21,135 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:31:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,175 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:31:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:21,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:31:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,176 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:31:21,177 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:31:21,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:31:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:31:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:31:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:31:21,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:31:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,180 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:31:21,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:31:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:21,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,181 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 10:31:21,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544987, now seen corresponding path program 10 times [2019-08-05 10:31:21,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:21,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:21,440 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:31:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,471 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:31:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:31:21,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:31:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,472 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:31:21,472 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:31:21,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:31:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:31:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:31:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:31:21,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:31:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,477 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:31:21,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:31:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:21,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,478 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 10:31:21,479 INFO L418 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1270287010, now seen corresponding path program 11 times [2019-08-05 10:31:21,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:21,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:21,860 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:31:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,913 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:31:21,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:21,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:31:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,915 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:21,915 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:31:21,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:31:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:31:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:31:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:31:21,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:31:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,918 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:31:21,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:31:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:21,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,919 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 10:31:21,919 INFO L418 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash -724191611, now seen corresponding path program 12 times [2019-08-05 10:31:21,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:22,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:22,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:22,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:22,094 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:31:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,132 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:31:22,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:31:22,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:31:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,134 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:31:22,134 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:31:22,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:31:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:31:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:31:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:31:22,137 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:31:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,138 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:31:22,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:31:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:22,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,138 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 10:31:22,139 INFO L418 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,139 INFO L82 PathProgramCache]: Analyzing trace with hash -975103426, now seen corresponding path program 13 times [2019-08-05 10:31:22,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:22,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:22,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:22,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:22,447 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:31:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,469 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:31:22,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:22,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:31:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,471 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:31:22,471 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:31:22,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:31:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:31:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:31:22,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:31:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,474 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:31:22,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:31:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:22,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,475 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 10:31:22,475 INFO L418 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash -163435099, now seen corresponding path program 14 times [2019-08-05 10:31:22,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:22,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:22,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:22,698 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:31:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,724 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:31:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:22,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:31:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,726 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:31:22,726 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:31:22,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:31:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:31:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:31:22,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:31:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,730 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:31:22,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:31:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:22,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,731 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 10:31:22,732 INFO L418 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -771520738, now seen corresponding path program 15 times [2019-08-05 10:31:22,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:22,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:22,973 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:31:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,126 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:31:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:23,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:31:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,127 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:31:23,127 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:23,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:31:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:31:23,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:31:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,131 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:31:23,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:31:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:23,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,132 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 10:31:23,132 INFO L418 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1852660933, now seen corresponding path program 16 times [2019-08-05 10:31:23,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:23,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:23,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:23,744 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:31:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,791 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:31:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:23,792 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:31:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,792 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:31:23,792 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:31:23,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:31:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:31:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:31:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:31:23,795 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:31:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,796 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:31:23,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:31:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:31:23,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,797 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 10:31:23,797 INFO L418 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914110, now seen corresponding path program 17 times [2019-08-05 10:31:23,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:24,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:24,039 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:31:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,100 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:31:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:24,101 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:31:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,101 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:31:24,102 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:31:24,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:31:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:31:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:31:24,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:31:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,105 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:31:24,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:31:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:24,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,106 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 10:31:24,107 INFO L418 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270107, now seen corresponding path program 18 times [2019-08-05 10:31:24,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:24,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:31:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:31:24,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:24,519 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:31:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,553 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:31:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:31:24,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:31:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,554 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:31:24,554 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:31:24,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:31:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:31:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:31:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:31:24,559 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:31:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,559 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:31:24,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:31:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:31:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:24,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,560 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 10:31:24,560 INFO L418 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831138, now seen corresponding path program 19 times [2019-08-05 10:31:24,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:24,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:24,948 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:31:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,980 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:31:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:24,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:31:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,981 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:31:24,981 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:31:24,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:31:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:31:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:31:24,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:31:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,985 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:31:24,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:31:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:24,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,986 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 10:31:24,986 INFO L418 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:24,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223099, now seen corresponding path program 20 times [2019-08-05 10:31:24,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:25,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:25,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:31:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:31:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:25,297 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:31:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,332 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:31:25,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:25,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:31:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,334 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:31:25,334 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:31:25,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:31:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:31:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:31:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:31:25,339 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:31:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,339 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:31:25,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:31:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:31:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:25,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,340 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 10:31:25,340 INFO L418 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,341 INFO L82 PathProgramCache]: Analyzing trace with hash -575373890, now seen corresponding path program 21 times [2019-08-05 10:31:25,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:25,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:25,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:25,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:25,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:25,794 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:31:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,860 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:31:25,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:25,862 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:31:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,863 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:31:25,863 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:25,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:31:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:31:25,867 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:31:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,867 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:31:25,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:31:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:31:25,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,868 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 10:31:25,868 INFO L418 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash -656721371, now seen corresponding path program 22 times [2019-08-05 10:31:25,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:26,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:26,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:26,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:26,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:26,461 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:31:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,494 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:31:26,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:26,495 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:31:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,495 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:31:26,495 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:31:26,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:31:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:31:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:31:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:31:26,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:31:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,500 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:31:26,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:31:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:26,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,501 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 10:31:26,502 INFO L418 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474014, now seen corresponding path program 23 times [2019-08-05 10:31:26,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:26,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:31:26,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:26,918 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:31:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,961 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:31:26,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:26,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:31:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,962 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:31:26,962 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:26,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:31:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:31:26,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:31:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,966 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:31:26,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:31:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:26,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,967 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 10:31:26,967 INFO L418 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash 250956101, now seen corresponding path program 24 times [2019-08-05 10:31:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:28,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:28,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:31:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:31:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:28,514 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:31:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,602 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:31:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:31:28,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:31:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,603 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:31:28,603 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:31:28,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:31:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:31:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:31:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:31:28,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:31:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,606 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:31:28,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:31:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:31:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:28,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,607 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 10:31:28,607 INFO L418 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,608 INFO L82 PathProgramCache]: Analyzing trace with hash -810295426, now seen corresponding path program 25 times [2019-08-05 10:31:28,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:29,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:29,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:29,128 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:31:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,164 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:31:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:29,164 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:31:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,165 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:31:29,165 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:31:29,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:31:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:31:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:31:29,168 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:31:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,169 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:31:29,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:31:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:31:29,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,170 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 10:31:29,170 INFO L418 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash 650645605, now seen corresponding path program 26 times [2019-08-05 10:31:29,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:30,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:31:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:31:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:30,111 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:31:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:30,168 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:31:30,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:30,168 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:31:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:30,169 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:31:30,169 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:31:30,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:31:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:31:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:31:30,172 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:31:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:30,172 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:31:30,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:31:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:31:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:30,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:30,173 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 10:31:30,173 INFO L418 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822690, now seen corresponding path program 27 times [2019-08-05 10:31:30,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:30,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:31:30,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:31:30,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:31:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:31:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:30,567 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:31:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:30,782 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:31:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:30,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:31:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:30,784 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:31:30,784 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:31:30,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:31:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:31:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:31:30,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:31:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:30,788 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:31:30,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:31:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:31:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:30,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:30,788 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 10:31:30,789 INFO L418 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797691, now seen corresponding path program 28 times [2019-08-05 10:31:30,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:30,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:31:30,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:31,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:31,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:31:31,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:31:31,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:31,251 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:31:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:31,325 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:31:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:31:31,326 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:31:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:31,326 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:31:31,326 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:31:31,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:31:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:31:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:31:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:31:31,329 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:31:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:31,330 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:31:31,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:31:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:31:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:31:31,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:31,331 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 10:31:31,331 INFO L418 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 195846462, now seen corresponding path program 29 times [2019-08-05 10:31:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:31,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:31:31,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:31,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:31,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:31:31,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:31:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:31:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:31,883 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:31:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:31,983 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:31:31,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:31,983 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:31:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:31,984 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:31:31,984 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:31:31,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:31:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:31:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:31:31,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:31:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:31,988 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:31:31,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:31:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:31:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:31,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:31,989 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 10:31:31,989 INFO L418 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:31,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273061, now seen corresponding path program 30 times [2019-08-05 10:31:31,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:32,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:31:32,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:31:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:31:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:32,433 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:31:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:32,478 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:31:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:31:32,479 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:31:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:32,479 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:31:32,479 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:31:32,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:31:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:31:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:31:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:31:32,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:31:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:32,483 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:31:32,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:31:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:31:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:31:32,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:32,484 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 10:31:32,484 INFO L418 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -770109922, now seen corresponding path program 31 times [2019-08-05 10:31:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:33,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:31:33,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:31:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:31:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:33,328 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:31:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,382 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:31:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:33,383 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:31:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,383 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:31:33,383 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:31:33,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:31:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:31:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:31:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:31:33,388 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:31:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,388 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:31:33,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:31:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:31:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:31:33,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,389 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 10:31:33,389 INFO L418 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396229, now seen corresponding path program 32 times [2019-08-05 10:31:33,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:33,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:31:33,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:31:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:31:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:33,918 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:31:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,962 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:31:33,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:31:33,962 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:31:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,963 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:31:33,963 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:31:33,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:31:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:31:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:31:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:31:33,968 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:31:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,968 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:31:33,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:31:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:31:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:31:33,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,969 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 10:31:33,969 INFO L418 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1341259010, now seen corresponding path program 33 times [2019-08-05 10:31:33,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:34,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:34,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:31:34,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:31:34,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:31:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:34,576 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:31:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:34,613 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:31:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:31:34,613 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:31:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:34,614 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:31:34,614 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:31:34,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:31:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:31:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:31:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:31:34,617 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:31:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:34,617 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:31:34,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:31:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:31:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:31:34,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:34,618 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 10:31:34,618 INFO L418 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643685, now seen corresponding path program 34 times [2019-08-05 10:31:34,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:34,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:31:34,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:35,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:35,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:31:35,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:31:35,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:31:35,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:35,656 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:31:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,700 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:31:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:31:35,704 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:31:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,704 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:31:35,704 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:31:35,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:31:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:31:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:31:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:31:35,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:31:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,707 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:31:35,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:31:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:31:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:31:35,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,707 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 10:31:35,708 INFO L418 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash -459718690, now seen corresponding path program 35 times [2019-08-05 10:31:35,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:36,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:31:36,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:31:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:31:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:36,220 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:31:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:36,301 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:31:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:36,301 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:31:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:36,301 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:31:36,301 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:36,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:31:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:31:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:31:36,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:31:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:36,304 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:31:36,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:31:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:31:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:31:36,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:36,305 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 10:31:36,305 INFO L418 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377467, now seen corresponding path program 36 times [2019-08-05 10:31:36,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:36,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:31:36,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:38,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:38,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:31:38,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:31:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:31:38,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:38,415 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:31:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,459 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:31:38,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:31:38,459 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:31:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,460 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:31:38,460 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:31:38,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:31:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:31:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:31:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:31:38,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:31:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,463 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:31:38,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:31:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:31:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:31:38,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,464 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 10:31:38,464 INFO L418 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 591971518, now seen corresponding path program 37 times [2019-08-05 10:31:38,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:31:39,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:31:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:31:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:39,020 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:31:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:39,078 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:31:39,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:31:39,079 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:31:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:39,079 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:31:39,079 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:31:39,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:31:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:31:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:31:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:31:39,082 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:31:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:39,083 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:31:39,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:31:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:31:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:31:39,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:39,083 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 10:31:39,084 INFO L418 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247909, now seen corresponding path program 38 times [2019-08-05 10:31:39,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:31:39,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:31:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:31:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:39,716 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:31:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:39,767 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:31:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:31:39,768 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:31:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:39,769 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:31:39,769 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:31:39,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:31:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:31:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:31:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:31:39,772 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:31:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:39,772 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:31:39,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:31:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:31:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:31:39,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:39,772 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 10:31:39,772 INFO L418 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946846, now seen corresponding path program 39 times [2019-08-05 10:31:39,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:40,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:40,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:31:40,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:31:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:31:40,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:40,385 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:31:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,435 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:31:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:40,436 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:31:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,436 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:31:40,436 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:31:40,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:31:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:31:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:31:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:31:40,440 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:31:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,440 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:31:40,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:31:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:31:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:31:40,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,440 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 10:31:40,441 INFO L418 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash 287810117, now seen corresponding path program 40 times [2019-08-05 10:31:40,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:41,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:41,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:31:41,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:31:41,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:31:41,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:41,098 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:31:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:41,172 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:31:41,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:31:41,173 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:31:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:41,173 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:31:41,174 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:31:41,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:31:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:31:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:31:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:31:41,176 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:31:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:41,177 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:31:41,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:31:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:31:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:31:41,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:41,178 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 10:31:41,178 INFO L418 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash 332179070, now seen corresponding path program 41 times [2019-08-05 10:31:41,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:41,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:31:41,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:42,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:31:42,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:31:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:31:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:42,111 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:31:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:42,184 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:31:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:31:42,184 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:31:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:42,185 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:31:42,186 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:31:42,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:31:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:31:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:31:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:31:42,189 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:31:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:42,190 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:31:42,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:31:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:31:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:31:42,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:42,191 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 10:31:42,191 INFO L418 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616613, now seen corresponding path program 42 times [2019-08-05 10:31:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:42,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:42,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:42,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:42,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:31:42,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:31:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:31:42,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:42,900 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:31:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:42,956 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:31:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:31:42,957 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:31:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:42,958 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:31:42,958 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:31:42,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:31:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:31:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:31:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:31:42,961 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:31:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:42,962 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:31:42,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:31:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:31:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:31:42,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:42,962 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 10:31:42,963 INFO L418 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507486, now seen corresponding path program 43 times [2019-08-05 10:31:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:42,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:31:42,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:43,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:31:43,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:31:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:31:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:31:43,860 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:31:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:43,919 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:31:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:31:43,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:31:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:43,920 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:31:43,921 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:31:43,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:31:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:31:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:31:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:31:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:31:43,923 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:31:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:43,923 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:31:43,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:31:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:31:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:31:43,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:43,924 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 10:31:43,924 INFO L418 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash 342059141, now seen corresponding path program 44 times [2019-08-05 10:31:43,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:43,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:31:43,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:44,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:44,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:31:44,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:31:44,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:31:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:44,660 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:31:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:44,728 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:31:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:31:44,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:31:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:44,729 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:31:44,729 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:31:44,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:31:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:31:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:31:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:31:44,731 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:31:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:44,732 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:31:44,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:31:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:31:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:31:44,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:44,733 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 10:31:44,733 INFO L418 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898814, now seen corresponding path program 45 times [2019-08-05 10:31:44,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:44,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:31:44,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:45,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:45,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:31:45,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:31:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:31:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:31:45,644 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:31:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:45,932 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:31:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:31:45,932 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:31:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:45,933 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:31:45,933 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:31:45,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:31:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:31:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:31:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:31:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:31:45,936 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:31:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:45,936 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:31:45,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:31:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:31:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:31:45,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:45,937 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 10:31:45,937 INFO L418 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646171, now seen corresponding path program 46 times [2019-08-05 10:31:45,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:45,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:31:45,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:47,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:47,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:31:47,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:31:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:31:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:31:47,278 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:31:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:47,346 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:31:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:31:47,346 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:31:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:47,347 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:31:47,347 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:31:47,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:31:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:31:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:31:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:31:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:31:47,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:31:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:47,350 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:31:47,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:31:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:31:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:31:47,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:47,350 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 10:31:47,351 INFO L418 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489122, now seen corresponding path program 47 times [2019-08-05 10:31:47,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:47,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:31:47,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:48,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:31:48,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:31:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:31:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:31:48,210 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:31:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,280 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:31:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:31:48,281 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:31:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,281 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:31:48,282 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:31:48,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:31:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:31:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:31:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:31:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:31:48,285 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:31:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,285 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:31:48,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:31:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:31:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:31:48,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,285 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 10:31:48,286 INFO L418 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash -338555195, now seen corresponding path program 48 times [2019-08-05 10:31:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:49,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:31:49,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:31:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:31:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:49,409 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:31:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,485 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:31:49,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:31:49,485 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:31:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,485 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:31:49,485 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:31:49,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:31:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:31:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:31:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:31:49,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:31:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,488 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:31:49,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:31:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:31:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:31:49,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,489 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 10:31:49,490 INFO L418 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276418, now seen corresponding path program 49 times [2019-08-05 10:31:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:50,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:31:50,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:31:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:31:50,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:31:50,604 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:31:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,665 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:31:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:31:50,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:31:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,666 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:31:50,666 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:31:50,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:31:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:31:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:31:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:31:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:31:50,669 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:31:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,669 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:31:50,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:31:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:31:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:31:50,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,670 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 10:31:50,670 INFO L418 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973221, now seen corresponding path program 50 times [2019-08-05 10:31:50,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:52,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:31:52,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:31:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:31:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:52,435 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:31:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,510 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:31:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:31:52,511 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:31:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,512 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:31:52,512 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:31:52,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:31:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:31:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:31:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:31:52,514 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:31:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,515 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:31:52,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:31:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:31:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:31:52,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,515 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 10:31:52,516 INFO L418 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568482, now seen corresponding path program 51 times [2019-08-05 10:31:52,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:53,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:53,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:31:53,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:31:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:31:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:31:53,875 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:31:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:54,004 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:31:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:31:54,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:31:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:54,005 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:31:54,005 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:31:54,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:31:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:31:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:31:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:31:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:31:54,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:31:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:54,008 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:31:54,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:31:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:31:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:31:54,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:54,009 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 10:31:54,009 INFO L418 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917243, now seen corresponding path program 52 times [2019-08-05 10:31:54,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:54,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:31:54,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:31:55,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:31:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:31:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:31:55,428 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:31:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:55,498 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:31:55,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:31:55,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:31:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:55,499 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:31:55,499 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:31:55,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:31:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:31:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:31:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:31:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:31:55,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:31:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:55,503 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:31:55,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:31:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:31:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:31:55,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:55,504 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 10:31:55,504 INFO L418 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash -579925058, now seen corresponding path program 53 times [2019-08-05 10:31:55,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:55,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:31:55,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:56,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:56,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:31:56,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:31:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:31:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:31:56,608 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:31:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:56,682 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:31:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:31:56,683 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:31:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:56,684 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:31:56,684 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:31:56,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:31:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:31:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:31:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:31:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:31:56,686 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:31:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:56,687 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:31:56,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:31:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:31:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:31:56,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:56,688 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 10:31:56,688 INFO L418 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -797807579, now seen corresponding path program 54 times [2019-08-05 10:31:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:56,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:31:56,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:58,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:58,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:31:58,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:31:58,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:31:58,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:31:58,131 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:31:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,253 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:31:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:31:58,254 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:31:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,255 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:31:58,255 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:31:58,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:31:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:31:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:31:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:31:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:31:58,258 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:31:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,258 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:31:58,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:31:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:31:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:31:58,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,259 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 10:31:58,259 INFO L418 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768862, now seen corresponding path program 55 times [2019-08-05 10:31:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:58,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:31:58,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:59,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:31:59,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:31:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:31:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:31:59,553 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:31:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:59,625 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:31:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:31:59,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:31:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:59,626 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:31:59,626 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:31:59,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:31:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:31:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:31:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:31:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:31:59,628 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:31:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:59,629 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:31:59,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:31:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:31:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:31:59,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:59,630 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 10:31:59,630 INFO L418 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063685, now seen corresponding path program 56 times [2019-08-05 10:31:59,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:59,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:31:59,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:00,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:32:00,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:32:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:32:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:00,805 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:32:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:00,872 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:32:00,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:32:00,872 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:32:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:00,873 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:32:00,873 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:32:00,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:32:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:32:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:32:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:32:00,876 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:32:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:00,877 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:32:00,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:32:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:32:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:32:00,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:00,878 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 10:32:00,878 INFO L418 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash 863464830, now seen corresponding path program 57 times [2019-08-05 10:32:00,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:00,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:32:00,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:02,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:32:02,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:32:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:32:02,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:02,553 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:32:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:02,635 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:32:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:32:02,635 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:32:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:02,636 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:32:02,636 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:32:02,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:32:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:32:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:32:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:32:02,639 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:32:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:02,639 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:32:02,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:32:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:32:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:32:02,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:02,640 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 10:32:02,640 INFO L418 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash 997605989, now seen corresponding path program 58 times [2019-08-05 10:32:02,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:02,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:32:02,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:03,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:03,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:32:03,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:32:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:32:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:32:03,972 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:32:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:04,052 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:32:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:32:04,053 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:32:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:04,054 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:32:04,054 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:32:04,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:32:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:32:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:32:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:32:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:32:04,056 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:32:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:04,057 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:32:04,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:32:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:32:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:32:04,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:04,057 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 10:32:04,058 INFO L418 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 861014622, now seen corresponding path program 59 times [2019-08-05 10:32:04,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:04,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:32:04,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:05,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:05,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:32:05,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:32:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:32:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:32:05,393 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:32:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:05,476 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:32:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:32:05,477 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:32:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:05,478 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:32:05,478 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:32:05,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:32:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:32:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:32:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:32:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:32:05,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:32:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:05,480 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:32:05,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:32:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:32:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:32:05,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:05,481 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 10:32:05,481 INFO L418 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash 921649541, now seen corresponding path program 60 times [2019-08-05 10:32:05,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:05,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:32:05,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:32:06,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:32:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:32:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:06,875 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:32:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,953 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:32:06,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:32:06,960 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:32:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,960 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:32:06,960 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:32:06,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:32:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:32:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:32:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:32:06,962 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:32:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,962 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:32:06,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:32:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:32:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:32:06,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,963 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1] [2019-08-05 10:32:06,963 INFO L418 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635266, now seen corresponding path program 61 times [2019-08-05 10:32:06,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:08,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:32:08,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:32:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:32:08,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:32:08,640 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:32:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:08,722 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:32:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:32:08,723 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:32:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:08,724 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:32:08,724 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:32:08,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:32:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:32:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:32:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:32:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:32:08,727 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:32:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:08,727 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:32:08,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:32:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:32:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:32:08,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:08,728 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1] [2019-08-05 10:32:08,728 INFO L418 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash 941947045, now seen corresponding path program 62 times [2019-08-05 10:32:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:08,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:32:08,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:32:10,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:32:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:32:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:32:10,144 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:32:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,240 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:32:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:32:10,241 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:32:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,242 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:32:10,242 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:32:10,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:32:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:32:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:32:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:32:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:32:10,245 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:32:10,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,245 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:32:10,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:32:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:32:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:32:10,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,246 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1] [2019-08-05 10:32:10,246 INFO L418 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -864412642, now seen corresponding path program 63 times [2019-08-05 10:32:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:11,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:11,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:32:11,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:32:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:32:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:32:11,827 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:32:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:11,913 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:32:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:32:11,914 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:32:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:11,914 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:32:11,915 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:32:11,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:32:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:32:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:32:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:32:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:32:11,918 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:32:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:11,918 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:32:11,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:32:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:32:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:32:11,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:11,919 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1] [2019-08-05 10:32:11,920 INFO L418 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988091, now seen corresponding path program 64 times [2019-08-05 10:32:11,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:11,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:32:11,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:13,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:13,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:32:13,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:32:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:32:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:32:13,739 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:32:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:13,848 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:32:13,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:32:13,848 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:32:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:13,849 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:32:13,849 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:32:13,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:32:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:32:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:32:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:32:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:32:13,852 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:32:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:13,852 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:32:13,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:32:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:32:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:32:13,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:13,853 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1] [2019-08-05 10:32:13,853 INFO L418 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859714, now seen corresponding path program 65 times [2019-08-05 10:32:13,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:13,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:32:13,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:15,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:32:15,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:32:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:32:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:15,436 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:32:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:15,526 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:32:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:32:15,526 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:32:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:15,527 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:32:15,527 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:32:15,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:32:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:32:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:32:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:32:15,529 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:32:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:15,529 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:32:15,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:32:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:32:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:32:15,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:15,530 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1] [2019-08-05 10:32:15,530 INFO L418 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash 906923749, now seen corresponding path program 66 times [2019-08-05 10:32:15,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:15,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:32:15,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:17,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:17,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:32:17,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:32:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:32:17,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:32:17,874 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:32:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:17,987 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:32:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:32:17,987 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:32:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:17,988 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:32:17,988 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:32:17,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:32:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:32:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:32:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:32:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:32:17,991 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:32:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:17,991 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:32:17,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:32:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:32:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:32:17,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:17,992 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1] [2019-08-05 10:32:17,992 INFO L418 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:17,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134818, now seen corresponding path program 67 times [2019-08-05 10:32:17,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:18,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:32:18,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:32:19,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:32:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:32:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:32:19,580 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:32:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:19,662 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:32:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:32:19,662 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:32:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:19,663 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:32:19,663 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:32:19,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:32:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:32:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:32:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:32:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:32:19,666 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:32:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:19,667 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:32:19,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:32:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:32:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:32:19,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:19,668 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1] [2019-08-05 10:32:19,668 INFO L418 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash -324637179, now seen corresponding path program 68 times [2019-08-05 10:32:19,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:19,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:32:19,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:21,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:32:21,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:32:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:32:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:32:21,293 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:32:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:21,391 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:32:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:32:21,392 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:32:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:21,392 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:32:21,393 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:32:21,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:32:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:32:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:32:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:32:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:32:21,395 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:32:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:21,396 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:32:21,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:32:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:32:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:32:21,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:21,396 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1] [2019-08-05 10:32:21,397 INFO L418 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817922, now seen corresponding path program 69 times [2019-08-05 10:32:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:21,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:32:21,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:23,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:32:23,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:32:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:32:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:32:23,533 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:32:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:23,630 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:32:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:32:23,630 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:32:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:23,631 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:32:23,632 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:32:23,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:32:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:32:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:32:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:32:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:32:23,634 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:32:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:23,634 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:32:23,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:32:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:32:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:32:23,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:23,635 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1] [2019-08-05 10:32:23,635 INFO L418 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284709, now seen corresponding path program 70 times [2019-08-05 10:32:23,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:23,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:32:23,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:26,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:26,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:32:26,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:32:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:32:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:26,442 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:32:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:26,572 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:32:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:32:26,572 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:32:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:26,573 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:32:26,573 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:32:26,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:32:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:32:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:32:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:32:26,576 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:32:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:26,578 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:32:26,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:32:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:32:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:32:26,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:26,579 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1] [2019-08-05 10:32:26,579 INFO L418 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185758, now seen corresponding path program 71 times [2019-08-05 10:32:26,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:26,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:32:26,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:28,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:32:28,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:32:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:32:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:32:28,688 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:32:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:28,785 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:32:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:32:28,785 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:32:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:28,786 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:32:28,786 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:32:28,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:32:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:32:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:32:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:32:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:32:28,789 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:32:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:28,789 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:32:28,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:32:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:32:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:32:28,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:28,790 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1] [2019-08-05 10:32:28,791 INFO L418 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 940987461, now seen corresponding path program 72 times [2019-08-05 10:32:28,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:28,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:32:28,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:30,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:32:30,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:32:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:32:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:30,860 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:32:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,965 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:32:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:32:30,965 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:32:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,966 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:32:30,966 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:32:30,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:32:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:32:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:32:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:32:30,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:32:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,969 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:32:30,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:32:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:32:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:32:30,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,970 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1] [2019-08-05 10:32:30,970 INFO L418 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash -894159746, now seen corresponding path program 73 times [2019-08-05 10:32:30,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:30,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:32:30,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:33,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:33,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:32:33,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:32:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:32:33,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:32:33,192 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:32:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:33,290 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:32:33,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:32:33,290 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:32:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:33,291 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:32:33,291 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:32:33,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:32:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:32:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:32:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:32:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:32:33,295 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:32:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:33,295 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:32:33,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:32:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:32:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:32:33,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:33,296 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1] [2019-08-05 10:32:33,296 INFO L418 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148315, now seen corresponding path program 74 times [2019-08-05 10:32:33,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:33,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:32:33,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:35,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:35,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:32:35,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:32:35,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:32:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:32:35,586 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:32:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:35,680 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:32:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:32:35,681 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:32:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:35,682 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:32:35,682 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:32:35,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:32:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:32:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:32:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:32:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:32:35,685 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:32:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:35,685 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:32:35,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:32:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:32:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:32:35,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:35,686 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1] [2019-08-05 10:32:35,686 INFO L418 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:35,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash -294055586, now seen corresponding path program 75 times [2019-08-05 10:32:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:35,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:32:35,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:37,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:37,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:32:37,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:32:37,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:32:37,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:32:37,668 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:32:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:37,798 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:32:37,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:32:37,798 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:32:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:37,799 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:32:37,799 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:32:37,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:32:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:32:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:32:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:32:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:32:37,800 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:32:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:37,800 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:32:37,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:32:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:32:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:32:37,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:37,801 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1] [2019-08-05 10:32:37,801 INFO L418 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash -525788539, now seen corresponding path program 76 times [2019-08-05 10:32:37,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:37,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:32:37,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:40,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:40,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:32:40,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:32:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:32:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:32:40,034 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:32:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:40,132 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:32:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:32:40,132 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:32:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:40,133 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:32:40,133 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:32:40,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:32:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:32:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:32:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:32:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:32:40,136 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:32:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:40,136 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:32:40,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:32:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:32:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:32:40,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:40,137 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1] [2019-08-05 10:32:40,137 INFO L418 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 880424510, now seen corresponding path program 77 times [2019-08-05 10:32:40,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:40,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:32:40,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:42,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:32:42,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:32:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:32:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:42,208 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 10:32:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:42,348 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:32:42,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:32:42,348 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 10:32:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:42,349 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:32:42,349 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:32:42,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:32:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:32:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:32:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:32:42,352 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:32:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:42,352 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:32:42,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:32:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:32:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:32:42,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:42,353 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1] [2019-08-05 10:32:42,354 INFO L418 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:42,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:42,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356069, now seen corresponding path program 78 times [2019-08-05 10:32:42,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:42,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:32:42,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:44,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:44,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:32:44,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:32:44,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:32:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:44,863 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-08-05 10:32:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:45,322 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:32:45,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:32:45,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2019-08-05 10:32:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:45,324 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:32:45,324 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:32:45,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:32:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:32:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:32:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:32:45,327 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:32:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:45,327 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:32:45,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:32:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:32:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:32:45,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:45,327 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1] [2019-08-05 10:32:45,328 INFO L418 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:45,328 INFO L82 PathProgramCache]: Analyzing trace with hash -20602082, now seen corresponding path program 79 times [2019-08-05 10:32:45,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:45,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:32:45,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:47,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:47,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:32:47,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:32:47,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:32:47,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:32:47,577 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-08-05 10:32:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:47,692 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:32:47,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:32:47,693 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2019-08-05 10:32:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:47,694 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:32:47,694 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:32:47,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:32:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:32:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:32:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:32:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:32:47,696 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:32:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:47,696 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:32:47,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:32:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:32:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:32:47,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:47,697 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1] [2019-08-05 10:32:47,697 INFO L418 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -638664507, now seen corresponding path program 80 times [2019-08-05 10:32:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:47,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:32:47,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:50,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:50,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:32:50,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:32:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:32:50,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:50,375 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-08-05 10:32:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:50,484 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:32:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:32:50,485 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2019-08-05 10:32:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:50,485 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:32:50,485 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:32:50,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:32:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:32:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:32:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:32:50,488 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:32:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:50,489 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:32:50,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:32:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:32:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:32:50,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:50,490 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1] [2019-08-05 10:32:50,490 INFO L418 AbstractCegarLoop]: === Iteration 82 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236798, now seen corresponding path program 81 times [2019-08-05 10:32:50,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:50,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:32:50,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:32:54,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:32:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:32:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:54,510 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2019-08-05 10:32:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:54,621 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:32:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:32:54,622 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2019-08-05 10:32:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:54,623 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:32:54,623 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:32:54,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:32:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:32:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:32:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:32:54,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:32:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:54,626 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:32:54,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:32:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:32:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:32:54,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:54,626 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1] [2019-08-05 10:32:54,626 INFO L418 AbstractCegarLoop]: === Iteration 83 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash 423733221, now seen corresponding path program 82 times [2019-08-05 10:32:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:54,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:32:54,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:56,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:32:56,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:32:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:32:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:32:56,948 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2019-08-05 10:32:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:57,056 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:32:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:32:57,057 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2019-08-05 10:32:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:57,057 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:32:57,058 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:32:57,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:32:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:32:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:32:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:32:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:32:57,060 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:32:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:57,060 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:32:57,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:32:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:32:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:32:57,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:57,061 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1] [2019-08-05 10:32:57,061 INFO L418 AbstractCegarLoop]: === Iteration 84 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 250827998, now seen corresponding path program 83 times [2019-08-05 10:32:57,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:57,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:32:57,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:59,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:59,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:32:59,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:32:59,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:32:59,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:32:59,839 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2019-08-05 10:33:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:00,051 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:33:00,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:33:00,051 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2019-08-05 10:33:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:00,052 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:33:00,052 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:33:00,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:33:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:33:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:33:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:33:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:33:00,055 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:33:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:00,055 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:33:00,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:33:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:33:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:33:00,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:00,056 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1] [2019-08-05 10:33:00,056 INFO L418 AbstractCegarLoop]: === Iteration 85 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -814266619, now seen corresponding path program 84 times [2019-08-05 10:33:00,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:00,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:33:00,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:02,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:02,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:33:02,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:33:02,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:33:02,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:33:02,504 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2019-08-05 10:33:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:02,616 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:33:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:33:02,616 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2019-08-05 10:33:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:02,617 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:33:02,617 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:33:02,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:33:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:33:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:33:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:33:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:33:02,620 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:33:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:02,620 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:33:02,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:33:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:33:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:33:02,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:02,622 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1] [2019-08-05 10:33:02,622 INFO L418 AbstractCegarLoop]: === Iteration 86 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 527538622, now seen corresponding path program 85 times [2019-08-05 10:33:02,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:02,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:33:02,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:05,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:05,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:33:05,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:33:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:33:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:33:05,340 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2019-08-05 10:33:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:05,529 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:33:05,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:33:05,529 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2019-08-05 10:33:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:05,530 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:33:05,530 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:33:05,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:33:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:33:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:33:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:33:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:33:05,533 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:33:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:05,534 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:33:05,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:33:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:33:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:33:05,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:05,535 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1] [2019-08-05 10:33:05,535 INFO L418 AbstractCegarLoop]: === Iteration 87 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash -826171867, now seen corresponding path program 86 times [2019-08-05 10:33:05,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:05,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:33:05,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:08,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:08,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:33:08,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:33:08,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:33:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:33:08,168 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2019-08-05 10:33:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:08,286 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:33:08,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:33:08,286 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2019-08-05 10:33:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:08,287 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:33:08,287 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:33:08,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:33:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:33:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:33:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:33:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:33:08,289 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:33:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:08,289 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:33:08,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:33:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:33:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:33:08,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:08,290 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1] [2019-08-05 10:33:08,290 INFO L418 AbstractCegarLoop]: === Iteration 88 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash 158475934, now seen corresponding path program 87 times [2019-08-05 10:33:08,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:08,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:33:08,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:11,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:11,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:33:11,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:33:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:33:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:33:11,301 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2019-08-05 10:33:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:11,502 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:33:11,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:33:11,502 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2019-08-05 10:33:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:11,503 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:33:11,503 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:33:11,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:33:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:33:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:33:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:33:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:33:11,505 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:33:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:11,506 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:33:11,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:33:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:33:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:33:11,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:11,507 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1] [2019-08-05 10:33:11,507 INFO L418 AbstractCegarLoop]: === Iteration 89 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:11,507 INFO L82 PathProgramCache]: Analyzing trace with hash 617786693, now seen corresponding path program 88 times [2019-08-05 10:33:11,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:11,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:33:11,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:14,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:14,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:33:14,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:33:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:33:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:33:14,483 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2019-08-05 10:33:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:14,610 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:33:14,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:33:14,610 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2019-08-05 10:33:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:14,611 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:33:14,611 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:33:14,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:33:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:33:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:33:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:33:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:33:14,613 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:33:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:14,613 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:33:14,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:33:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:33:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:33:14,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:14,614 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1] [2019-08-05 10:33:14,614 INFO L418 AbstractCegarLoop]: === Iteration 90 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518334, now seen corresponding path program 89 times [2019-08-05 10:33:14,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:14,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:33:14,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:33:17,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:33:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:33:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:33:17,359 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2019-08-05 10:33:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:18,272 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:33:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:33:18,273 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2019-08-05 10:33:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:18,273 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:33:18,274 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:33:18,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:33:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:33:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:33:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:33:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:33:18,276 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:33:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:18,276 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:33:18,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:33:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:33:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:33:18,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:18,277 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1] [2019-08-05 10:33:18,277 INFO L418 AbstractCegarLoop]: === Iteration 91 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash 987526245, now seen corresponding path program 90 times [2019-08-05 10:33:18,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:18,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:33:18,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:21,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:21,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:33:21,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:33:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:33:21,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:33:21,732 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2019-08-05 10:33:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:21,916 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:33:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:33:21,916 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2019-08-05 10:33:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:21,917 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:33:21,917 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:33:21,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:33:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:33:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:33:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:33:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:33:21,918 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:33:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:21,919 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:33:21,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:33:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:33:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:33:21,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:21,919 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1] [2019-08-05 10:33:21,919 INFO L418 AbstractCegarLoop]: === Iteration 92 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash 548542558, now seen corresponding path program 91 times [2019-08-05 10:33:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:21,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:33:21,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:25,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:25,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:33:25,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:33:25,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:33:25,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:33:25,192 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2019-08-05 10:33:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:25,329 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:33:25,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:33:25,329 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2019-08-05 10:33:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:25,330 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:33:25,330 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:33:25,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:33:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:33:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:33:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:33:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:33:25,333 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:33:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:25,333 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:33:25,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:33:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:33:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:33:25,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:25,334 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1] [2019-08-05 10:33:25,334 INFO L418 AbstractCegarLoop]: === Iteration 93 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash -175049851, now seen corresponding path program 92 times [2019-08-05 10:33:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:25,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:33:25,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:28,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:28,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:33:28,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:33:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:33:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:33:28,251 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2019-08-05 10:33:28,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:28,384 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:33:28,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:33:28,384 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2019-08-05 10:33:28,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:28,385 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:33:28,385 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:33:28,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:33:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:33:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:33:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:33:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:33:28,389 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:33:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:28,389 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:33:28,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:33:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:33:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:33:28,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:28,390 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1] [2019-08-05 10:33:28,390 INFO L418 AbstractCegarLoop]: === Iteration 94 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:28,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1131578050, now seen corresponding path program 93 times [2019-08-05 10:33:28,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:28,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:33:28,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:31,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:33:31,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:33:31,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:33:31,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:33:31,703 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2019-08-05 10:33:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:31,836 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:33:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:33:31,837 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2019-08-05 10:33:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:31,838 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:33:31,838 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:33:31,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:33:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:33:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:33:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:33:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:33:31,841 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:33:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:31,841 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:33:31,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:33:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:33:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:33:31,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:31,842 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1] [2019-08-05 10:33:31,842 INFO L418 AbstractCegarLoop]: === Iteration 95 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash -719181147, now seen corresponding path program 94 times [2019-08-05 10:33:31,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:31,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:33:31,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:35,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:35,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:33:35,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:33:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:33:35,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:33:35,679 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2019-08-05 10:33:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:35,807 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:33:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:33:35,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2019-08-05 10:33:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:35,808 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:33:35,808 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:33:35,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:33:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:33:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:33:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:33:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:33:35,811 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:33:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:35,811 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:33:35,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:33:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:33:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:33:35,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:35,812 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1] [2019-08-05 10:33:35,812 INFO L418 AbstractCegarLoop]: === Iteration 96 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash -819779042, now seen corresponding path program 95 times [2019-08-05 10:33:35,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:35,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:33:35,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:38,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:33:38,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:33:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:33:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:33:38,946 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2019-08-05 10:33:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,084 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:33:39,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:33:39,084 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2019-08-05 10:33:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,085 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:33:39,085 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:33:39,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:33:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:33:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:33:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:33:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:33:39,086 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:33:39,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,087 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:33:39,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:33:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:33:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:33:39,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,087 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1] [2019-08-05 10:33:39,088 INFO L418 AbstractCegarLoop]: === Iteration 97 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash 356653509, now seen corresponding path program 96 times [2019-08-05 10:33:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:42,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:42,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:33:42,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:33:42,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:33:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:33:42,580 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2019-08-05 10:33:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:42,729 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:33:42,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:33:42,729 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2019-08-05 10:33:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:42,730 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:33:42,730 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:33:42,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:33:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:33:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:33:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:33:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:33:42,732 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:33:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:42,732 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:33:42,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:33:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:33:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:33:42,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:42,734 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1] [2019-08-05 10:33:42,734 INFO L418 AbstractCegarLoop]: === Iteration 98 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643074, now seen corresponding path program 97 times [2019-08-05 10:33:42,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:42,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:33:42,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:46,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:46,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:33:46,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:33:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:33:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:33:46,259 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2019-08-05 10:33:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:46,403 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:33:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:33:46,404 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2019-08-05 10:33:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:46,404 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:33:46,404 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:33:46,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:33:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:33:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:33:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:33:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:33:46,406 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:33:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:46,406 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:33:46,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:33:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:33:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:33:46,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:46,408 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1] [2019-08-05 10:33:46,408 INFO L418 AbstractCegarLoop]: === Iteration 99 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -853360411, now seen corresponding path program 98 times [2019-08-05 10:33:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:46,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:33:46,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:50,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:50,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:33:50,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:33:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:33:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:50,006 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2019-08-05 10:33:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:50,287 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:33:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:33:50,288 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2019-08-05 10:33:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:50,289 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:33:50,289 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:33:50,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:33:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:33:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:33:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:33:50,292 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:33:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:50,292 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:33:50,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:33:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:33:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:33:50,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:50,292 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1] [2019-08-05 10:33:50,293 INFO L418 AbstractCegarLoop]: === Iteration 100 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:50,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash -684368930, now seen corresponding path program 99 times [2019-08-05 10:33:50,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:50,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:33:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:53,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:53,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:33:53,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:33:53,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:33:53,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:33:53,767 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2019-08-05 10:33:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:53,935 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:33:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:33:53,935 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2019-08-05 10:33:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:53,936 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:33:53,936 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:33:53,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:33:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:33:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:33:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:33:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:33:53,938 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:33:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:53,938 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:33:53,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:33:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:33:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:33:53,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:53,939 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1] [2019-08-05 10:33:53,939 INFO L418 AbstractCegarLoop]: === Iteration 101 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash 259399685, now seen corresponding path program 100 times [2019-08-05 10:33:53,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:53,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:33:53,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:57,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:57,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:33:57,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:33:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:33:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:33:57,853 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2019-08-05 10:33:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:57,995 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:33:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:33:57,996 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2019-08-05 10:33:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:57,997 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:33:57,997 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:33:57,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:33:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:33:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:33:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:33:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:33:58,000 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:33:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:58,001 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:33:58,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:33:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:33:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:33:58,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:58,002 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1] [2019-08-05 10:33:58,002 INFO L418 AbstractCegarLoop]: === Iteration 102 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash -548544322, now seen corresponding path program 101 times [2019-08-05 10:33:58,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:33:58,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:01,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:01,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:34:01,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:34:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:34:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:34:01,871 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2019-08-05 10:34:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,045 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:34:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:34:02,045 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2019-08-05 10:34:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,046 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:34:02,046 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:34:02,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:34:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:34:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:34:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:34:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:34:02,049 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:34:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,049 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:34:02,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:34:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:34:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:34:02,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,050 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1] [2019-08-05 10:34:02,050 INFO L418 AbstractCegarLoop]: === Iteration 103 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash 174995237, now seen corresponding path program 102 times [2019-08-05 10:34:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:05,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:05,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:34:05,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:34:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:34:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:34:05,953 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2019-08-05 10:34:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:06,170 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:34:06,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:34:06,171 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2019-08-05 10:34:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:06,172 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:34:06,172 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:34:06,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:34:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:34:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:34:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:34:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:34:06,174 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:34:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:06,174 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:34:06,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:34:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:34:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:34:06,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:06,175 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1] [2019-08-05 10:34:06,176 INFO L418 AbstractCegarLoop]: === Iteration 104 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885086, now seen corresponding path program 103 times [2019-08-05 10:34:06,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:06,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:34:06,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:10,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:10,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:34:10,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:34:10,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:34:10,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:34:10,341 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2019-08-05 10:34:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:10,504 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:34:10,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:34:10,504 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2019-08-05 10:34:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:10,505 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:34:10,505 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:34:10,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:34:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:34:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:34:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:34:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:34:10,508 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:34:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:10,509 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:34:10,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:34:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:34:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:34:10,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:10,509 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1] [2019-08-05 10:34:10,510 INFO L418 AbstractCegarLoop]: === Iteration 105 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash 666699333, now seen corresponding path program 104 times [2019-08-05 10:34:10,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:10,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:34:10,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:14,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:14,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:34:14,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:34:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:34:14,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:34:14,460 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2019-08-05 10:34:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:14,668 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:34:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:34:14,668 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2019-08-05 10:34:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:14,669 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:34:14,669 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:34:14,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:34:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:34:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:34:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:34:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:34:14,672 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:34:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:14,672 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:34:14,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:34:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:34:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:34:14,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:14,673 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1] [2019-08-05 10:34:14,674 INFO L418 AbstractCegarLoop]: === Iteration 106 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash -807157122, now seen corresponding path program 105 times [2019-08-05 10:34:14,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:14,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:34:14,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:34:19,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:34:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:34:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:34:19,289 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2019-08-05 10:34:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:19,454 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:34:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:34:19,454 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2019-08-05 10:34:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:19,455 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:34:19,455 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:34:19,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:34:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:34:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:34:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:34:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:34:19,458 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:34:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:19,458 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:34:19,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:34:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:34:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:34:19,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:19,459 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1] [2019-08-05 10:34:19,460 INFO L418 AbstractCegarLoop]: === Iteration 107 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 747933029, now seen corresponding path program 106 times [2019-08-05 10:34:19,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:19,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:34:19,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:23,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:23,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:34:23,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:34:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:34:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:34:23,582 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2019-08-05 10:34:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:23,812 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:34:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:34:23,812 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2019-08-05 10:34:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:23,813 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:34:23,813 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:34:23,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:34:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:34:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:34:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:34:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:34:23,816 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:34:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:23,816 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:34:23,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:34:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:34:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:34:23,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:23,817 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1] [2019-08-05 10:34:23,817 INFO L418 AbstractCegarLoop]: === Iteration 108 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087454, now seen corresponding path program 107 times [2019-08-05 10:34:23,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:23,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:34:23,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:28,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:28,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:34:28,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:34:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:34:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:34:28,062 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2019-08-05 10:34:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:28,238 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:34:28,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:34:28,238 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2019-08-05 10:34:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:28,239 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:34:28,239 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:34:28,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:34:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:34:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:34:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:34:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:34:28,242 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:34:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:28,243 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:34:28,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:34:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:34:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:34:28,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:28,244 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1] [2019-08-05 10:34:28,244 INFO L418 AbstractCegarLoop]: === Iteration 109 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103557, now seen corresponding path program 108 times [2019-08-05 10:34:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:28,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:34:28,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:32,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:32,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:34:32,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:34:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:34:32,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:34:32,431 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2019-08-05 10:34:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:32,608 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:34:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:34:32,609 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2019-08-05 10:34:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:32,609 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:34:32,610 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:34:32,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:34:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:34:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:34:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:34:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:34:32,612 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:34:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:32,612 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:34:32,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:34:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:34:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:34:32,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:32,613 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1] [2019-08-05 10:34:32,613 INFO L418 AbstractCegarLoop]: === Iteration 110 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash -617429954, now seen corresponding path program 109 times [2019-08-05 10:34:32,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:32,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:34:32,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:36,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:34:36,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:34:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:34:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:34:36,964 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2019-08-05 10:34:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:37,152 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:34:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:34:37,153 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2019-08-05 10:34:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:37,153 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:34:37,153 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:34:37,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:34:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:34:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:34:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:34:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:34:37,155 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:34:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:37,155 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:34:37,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:34:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:34:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:34:37,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:37,156 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1] [2019-08-05 10:34:37,156 INFO L418 AbstractCegarLoop]: === Iteration 111 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459355, now seen corresponding path program 110 times [2019-08-05 10:34:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:37,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:34:37,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:41,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:41,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:34:41,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:34:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:34:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:34:41,603 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2019-08-05 10:34:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:41,780 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:34:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:34:41,780 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2019-08-05 10:34:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:41,781 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:34:41,781 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:34:41,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:34:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:34:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:34:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:34:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:34:41,784 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:34:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:41,784 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:34:41,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:34:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:34:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:34:41,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:41,785 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1] [2019-08-05 10:34:41,785 INFO L418 AbstractCegarLoop]: === Iteration 112 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash -644697826, now seen corresponding path program 111 times [2019-08-05 10:34:41,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:41,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:34:41,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:46,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:46,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:34:46,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:34:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:34:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:34:46,065 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2019-08-05 10:34:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:46,302 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:34:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:34:46,302 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2019-08-05 10:34:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:46,302 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:34:46,302 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:34:46,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:34:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:34:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:34:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:34:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:34:46,305 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:34:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:46,305 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:34:46,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:34:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:34:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:34:46,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:46,306 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1] [2019-08-05 10:34:46,306 INFO L418 AbstractCegarLoop]: === Iteration 113 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203909, now seen corresponding path program 112 times [2019-08-05 10:34:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:46,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:34:46,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:34:50,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:34:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:34:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:50,602 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2019-08-05 10:34:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:50,797 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:34:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:34:50,798 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2019-08-05 10:34:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:50,798 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:34:50,798 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:34:50,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:34:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:34:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:34:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:34:50,800 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:34:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:50,800 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:34:50,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:34:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:34:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:34:50,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:50,801 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1] [2019-08-05 10:34:50,801 INFO L418 AbstractCegarLoop]: === Iteration 114 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1079319042, now seen corresponding path program 113 times [2019-08-05 10:34:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:50,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:34:50,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:55,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:34:55,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:34:55,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:34:55,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:34:55,413 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2019-08-05 10:34:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,587 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:34:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:34:55,588 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2019-08-05 10:34:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,588 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:34:55,588 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:34:55,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:34:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:34:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:34:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:34:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:34:55,592 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:34:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,592 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:34:55,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:34:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:34:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:34:55,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,593 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1] [2019-08-05 10:34:55,593 INFO L418 AbstractCegarLoop]: === Iteration 115 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash 900848101, now seen corresponding path program 114 times [2019-08-05 10:34:55,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:35:00,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:35:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:35:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:35:00,615 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2019-08-05 10:35:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,867 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:35:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:35:00,867 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2019-08-05 10:35:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,868 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:35:00,868 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:35:00,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:35:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:35:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:35:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:35:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:35:00,870 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:35:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,870 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:35:00,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:35:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:35:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:35:00,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,871 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1] [2019-08-05 10:35:00,871 INFO L418 AbstractCegarLoop]: === Iteration 116 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479906, now seen corresponding path program 115 times [2019-08-05 10:35:00,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:35:05,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:35:05,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:35:05,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:35:05,736 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2019-08-05 10:35:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,968 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:35:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:35:05,968 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2019-08-05 10:35:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,969 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:35:05,969 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:35:05,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:35:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:35:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:35:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:35:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:35:05,972 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:35:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,972 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:35:05,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:35:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:35:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:35:05,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,973 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1] [2019-08-05 10:35:05,973 INFO L418 AbstractCegarLoop]: === Iteration 117 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367611, now seen corresponding path program 116 times [2019-08-05 10:35:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:35:06,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:10,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:10,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:35:10,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:35:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:35:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:35:10,903 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2019-08-05 10:35:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:11,116 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:35:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:35:11,116 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2019-08-05 10:35:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:11,117 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:35:11,117 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:35:11,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:35:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:35:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:35:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:35:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:35:11,119 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:35:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:11,119 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:35:11,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:35:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:35:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:35:11,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:11,120 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1] [2019-08-05 10:35:11,120 INFO L418 AbstractCegarLoop]: === Iteration 118 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2084821058, now seen corresponding path program 117 times [2019-08-05 10:35:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:16,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:16,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:35:16,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:35:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:35:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:35:16,205 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2019-08-05 10:35:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:16,399 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:35:16,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:35:16,399 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2019-08-05 10:35:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:16,400 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:35:16,400 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:35:16,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:35:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:35:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:35:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:35:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:35:16,402 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:35:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:16,402 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:35:16,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:35:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:35:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:35:16,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:16,403 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1] [2019-08-05 10:35:16,404 INFO L418 AbstractCegarLoop]: === Iteration 119 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash -204943323, now seen corresponding path program 118 times [2019-08-05 10:35:16,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:16,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:35:16,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:35:17,835 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:35:17,835 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:35:17,839 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:35:17,840 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:17 BoogieIcfgContainer [2019-08-05 10:35:17,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:17,842 INFO L168 Benchmark]: Toolchain (without parser) took 239821.06 ms. Allocated memory was 134.2 MB in the beginning and 848.8 MB in the end (delta: 714.6 MB). Free memory was 109.8 MB in the beginning and 162.2 MB in the end (delta: -52.4 MB). Peak memory consumption was 662.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,843 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:35:17,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.16 ms. Allocated memory is still 134.2 MB. Free memory was 109.8 MB in the beginning and 107.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,844 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,844 INFO L168 Benchmark]: RCFGBuilder took 251.51 ms. Allocated memory is still 134.2 MB. Free memory was 106.5 MB in the beginning and 98.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,845 INFO L168 Benchmark]: TraceAbstraction took 239509.57 ms. Allocated memory was 134.2 MB in the beginning and 848.8 MB in the end (delta: 714.6 MB). Free memory was 97.8 MB in the beginning and 162.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 650.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,847 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.21 ms. Allocated memory is still 134.2 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.16 ms. Allocated memory is still 134.2 MB. Free memory was 109.8 MB in the beginning and 107.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.01 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 251.51 ms. Allocated memory is still 134.2 MB. Free memory was 106.5 MB in the beginning and 98.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239509.57 ms. Allocated memory was 134.2 MB in the beginning and 848.8 MB in the end (delta: 714.6 MB). Free memory was 97.8 MB in the beginning and 162.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 650.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. TIMEOUT Result, 239.4s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 1 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7021 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 218.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=118, 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, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 221.3s InterpolantComputationTime, 7139 NumberOfCodeBlocks, 7139 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 55814 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown