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/loopAcceleration/loopAccelerationWerner/oneLoopAssertion.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:18:28,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:18:28,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:18:28,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:18:28,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:18:28,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:18:28,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:18:28,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:18:28,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:18:28,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:18:28,828 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:18:28,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:18:28,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:18:28,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:18:28,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:18:28,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:18:28,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:18:28,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:18:28,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:18:28,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:18:28,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:18:28,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:18:28,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:18:28,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:18:28,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:18:28,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:18:28,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:18:28,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:18:28,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:18:28,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:18:28,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:18:28,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:18:28,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:18:28,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:18:28,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:18:28,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:18:28,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:18:28,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:18:28,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:18:28,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:18:28,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:18:28,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:18:28,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:18:28,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:18:28,924 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:18:28,925 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:18:28,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/oneLoopAssertion.bpl [2019-08-05 11:18:28,926 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/oneLoopAssertion.bpl' [2019-08-05 11:18:28,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:18:28,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:18:28,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:28,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:18:28,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:18:28,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:28,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:28,983 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:18:28,983 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:18:28,983 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:18:28,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:28,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:18:28,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:18:28,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:18:28,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:28,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:28,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:28,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:29,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:29,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:29,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/1) ... [2019-08-05 11:18:29,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:18:29,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:18:29,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:18:29,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:18:29,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (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 11:18:29,076 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:18:29,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:18:29,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:18:29,311 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:18:29,312 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:18:29,313 INFO L202 PluginConnector]: Adding new model oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:29 BoogieIcfgContainer [2019-08-05 11:18:29,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:18:29,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:18:29,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:18:29,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:18:29,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:28" (1/2) ... [2019-08-05 11:18:29,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ab9349 and model type oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:18:29, skipping insertion in model container [2019-08-05 11:18:29,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:29" (2/2) ... [2019-08-05 11:18:29,323 INFO L109 eAbstractionObserver]: Analyzing ICFG oneLoopAssertion.bpl [2019-08-05 11:18:29,330 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:18:29,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:18:29,349 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:18:29,375 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:18:29,376 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:18:29,376 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:18:29,377 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:18:29,377 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:18:29,377 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:18:29,377 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:18:29,377 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:18:29,378 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:18:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:18:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:18:29,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:29,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:18:29,402 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:18:29,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:29,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:29,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:29,554 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 11:18:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:29,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:29,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:29,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:29,573 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 11:18:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:29,681 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:18:29,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:29,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:18:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:29,712 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:18:29,713 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:18:29,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:18:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:18:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:18:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:18:29,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:18:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:29,792 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:18:29,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:18:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:18:29,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:29,794 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:18:29,794 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:18:29,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:29,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:29,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:30,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:30,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:18:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:18:30,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:18:30,072 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:18:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:30,223 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:18:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:18:30,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:18:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:30,224 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:18:30,224 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:18:30,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:18:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:18:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:18:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:18:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:18:30,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:18:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:30,228 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:18:30,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:18:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:18:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:18:30,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:30,229 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:18:30,230 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:30,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:18:30,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:30,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:18:30,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:30,341 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 11:18:30,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:30,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:18:30,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:18:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:18:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:18:30,344 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:18:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:30,407 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:18:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:18:30,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:18:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:30,409 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:18:30,409 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:18:30,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 11:18:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:18:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:18:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:18:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:18:30,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:18:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:30,413 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:18:30,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:18:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:18:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:18:30,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:30,414 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:18:30,415 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:18:30,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:30,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:18:30,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:30,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:30,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:18:30,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:18:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:18:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:18:30,735 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 11:18:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:30,776 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:18:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:18:30,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 11:18:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:30,778 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:18:30,778 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:18:30,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:18:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:18:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:18:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:18:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:18:30,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:18:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:30,781 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:18:30,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:18:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:18:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:18:30,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:30,783 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:18:30,783 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:18:30,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:30,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:18:30,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:30,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:30,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:18:30,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:18:30,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:18:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:18:30,935 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 11:18:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:31,029 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:18:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:18:31,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 11:18:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:31,031 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:18:31,031 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:18:31,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:18:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:18:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:18:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:18:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:18:31,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:18:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:31,035 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:18:31,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:18:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:18:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:18:31,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:31,036 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 11:18:31,036 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 11:18:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:31,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:18:31,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:18:31,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:18:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:18:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:18:31,294 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2019-08-05 11:18:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:31,331 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:18:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:18:31,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 11:18:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:31,332 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:18:31,332 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:18:31,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:18:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:18:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:18:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:18:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:18:31,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:18:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:31,336 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:18:31,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:18:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:18:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:18:31,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:31,337 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 11:18:31,338 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 11:18:31,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:31,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:18:31,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:31,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:18:31,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:18:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:18:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:18:31,463 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-08-05 11:18:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:31,660 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:18:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:18:31,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-08-05 11:18:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:31,663 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:18:31,663 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:18:31,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:18:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:18:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:18:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:18:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:18:31,668 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:18:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:31,669 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:18:31,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:18:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:18:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:18:31,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:31,671 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 11:18:31,671 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 11:18:31,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:31,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:18:31,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:31,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:18:31,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:18:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:18:31,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:18:31,933 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-08-05 11:18:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:32,014 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:18:32,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:18:32,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-08-05 11:18:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:32,016 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:18:32,016 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:18:32,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:18:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:18:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:18:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:18:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:18:32,020 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:18:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:32,020 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:18:32,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:18:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:18:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:18:32,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:32,021 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 11:18:32,021 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 11:18:32,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:32,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:18:32,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:32,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:32,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:18:32,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:18:32,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:18:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:18:32,237 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2019-08-05 11:18:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:32,292 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:18:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:18:32,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 11:18:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:32,294 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:18:32,294 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:18:32,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:18:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:18:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:18:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:18:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:18:32,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:18:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:32,300 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:18:32,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:18:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:18:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:18:32,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:32,301 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 11:18:32,301 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:32,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 11:18:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:32,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:18:32,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:32,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:32,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:18:32,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:18:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:18:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:18:32,539 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 13 states. [2019-08-05 11:18:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:32,625 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:18:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:18:32,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-08-05 11:18:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:32,627 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:18:32,627 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:18:32,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 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 11:18:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:18:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:18:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:18:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:18:32,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:18:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:32,632 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:18:32,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:18:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:18:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:18:32,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:32,633 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 11:18:32,633 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 11:18:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:32,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:18:32,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:32,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:32,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:18:32,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:18:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:18:32,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:18:32,819 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2019-08-05 11:18:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:32,944 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:18:32,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:18:32,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-08-05 11:18:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:32,945 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:18:32,945 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:18:32,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:18:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:18:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:18:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:18:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:18:32,949 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:18:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:32,950 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:18:32,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:18:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:18:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:18:32,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:32,950 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 11:18:32,951 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 11:18:32,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:32,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:18:32,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:33,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:33,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:18:33,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:18:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:18:33,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:18:33,134 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 15 states. [2019-08-05 11:18:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:33,413 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:18:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:18:33,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-08-05 11:18:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:33,414 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:18:33,414 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:18:33,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 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 11:18:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:18:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:18:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:18:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:18:33,423 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:18:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:33,424 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:18:33,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:18:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:18:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:18:33,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:33,425 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 11:18:33,429 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 11:18:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:33,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:18:33,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:33,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:33,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:18:33,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:18:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:18:33,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:18:33,786 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2019-08-05 11:18:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:33,842 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:18:33,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:18:33,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-08-05 11:18:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:33,844 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:18:33,845 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:18:33,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:18:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:18:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:18:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:18:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:18:33,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:18:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:33,850 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:18:33,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:18:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:18:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:18:33,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:33,851 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 11:18:33,851 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 11:18:33,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:33,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:18:33,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:34,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:34,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:18:34,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:18:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:18:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:18:34,209 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2019-08-05 11:18:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:34,275 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:18:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:18:34,276 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-08-05 11:18:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:34,277 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:18:34,277 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:18:34,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:18:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:18:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 11:18:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:18:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:18:34,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:18:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:34,282 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:18:34,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:18:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:18:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:18:34,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:34,283 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 11:18:34,283 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 11:18:34,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:34,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:18:34,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:34,480 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 11:18:34,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:34,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:18:34,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:18:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:18:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:18:34,482 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states. [2019-08-05 11:18:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:34,545 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:18:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:18:34,546 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-08-05 11:18:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:34,546 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:18:34,546 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:18:34,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:18:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:18:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:18:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:18:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:18:34,550 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:18:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:34,550 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:18:34,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:18:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:18:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:18:34,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:34,552 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 11:18:34,552 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 11:18:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:34,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:18:34,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:35,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:18:35,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:18:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:18:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:18:35,184 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 19 states. [2019-08-05 11:18:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:35,271 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:18:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:18:35,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2019-08-05 11:18:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:35,272 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:18:35,272 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:18:35,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:18:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:18:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:18:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:18:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:18:35,277 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:18:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:35,277 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:18:35,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:18:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:18:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:18:35,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,278 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 11:18:35,279 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 11:18:35,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:35,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:35,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:18:35,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:18:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:18:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:18:35,668 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2019-08-05 11:18:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:35,738 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:18:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:18:35,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-08-05 11:18:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:35,740 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:18:35,740 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:18:35,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:18:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:18:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 11:18:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:18:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:18:35,746 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:18:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:35,746 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:18:35,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:18:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:18:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:18:35,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,749 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 11:18:35,749 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 11:18:35,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:35,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:35,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:18:35,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:18:35,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:18:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:18:35,981 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 21 states. [2019-08-05 11:18:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,060 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:18:36,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:18:36,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-08-05 11:18:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,061 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:18:36,061 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:18:36,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:18:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:18:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 11:18:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:18:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:18:36,064 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:18:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,065 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:18:36,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:18:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:18:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:18:36,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,066 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 11:18:36,066 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 11:18:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:36,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:18:36,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:18:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:18:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:18:36,438 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 22 states. [2019-08-05 11:18:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:36,572 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:18:36,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:18:36,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-08-05 11:18:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:36,572 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:18:36,573 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:18:36,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 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 11:18:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:18:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:18:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:18:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:18:36,577 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:18:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:36,578 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:18:36,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:18:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:18:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:18:36,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:36,579 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 11:18:36,579 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:36,579 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 11:18:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:18:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:36,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:18:36,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:18:36,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:18:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:18:36,941 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 23 states. [2019-08-05 11:18:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,027 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:18:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:18:37,028 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-08-05 11:18:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,029 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:18:37,029 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:18:37,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:18:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:18:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:18:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:18:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:18:37,033 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:18:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,033 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:18:37,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:18:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:18:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:18:37,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,034 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 11:18:37,035 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 11:18:37,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:37,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:18:37,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:18:37,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:18:37,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:18:37,326 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 24 states. [2019-08-05 11:18:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,475 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:18:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:18:37,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-08-05 11:18:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,476 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:18:37,476 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:18:37,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:18:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:18:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:18:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:18:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:18:37,480 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:18:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,480 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:18:37,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:18:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:18:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:18:37,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,482 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 11:18:37,482 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 11:18:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:38,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:38,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:18:38,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:18:38,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:18:38,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:18:38,005 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 25 states. [2019-08-05 11:18:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:38,082 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:18:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:18:38,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2019-08-05 11:18:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:38,085 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:18:38,086 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:18:38,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:18:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:18:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:18:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:18:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:18:38,089 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:18:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:38,090 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:18:38,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:18:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:18:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:18:38,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:38,091 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 11:18:38,091 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 11:18:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:38,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:18:38,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:38,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:38,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:18:38,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:18:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:18:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:18:38,649 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 26 states. [2019-08-05 11:18:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:38,741 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:18:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:18:38,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-08-05 11:18:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:38,742 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:18:38,742 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:18:38,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:18:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:18:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 11:18:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:18:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:18:38,746 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:18:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:38,746 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:18:38,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:18:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:18:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:18:38,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:38,748 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 11:18:38,748 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:38,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 11:18:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:38,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:18:38,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:39,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:18:39,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:18:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:18:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:18:39,567 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 27 states. [2019-08-05 11:18:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:39,643 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:18:39,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:18:39,644 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2019-08-05 11:18:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:39,645 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:18:39,645 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:18:39,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:18:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:18:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 11:18:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:18:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:18:39,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:18:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:39,650 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:18:39,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:18:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:18:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:18:39,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:39,651 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 11:18:39,651 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:39,652 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 11:18:39,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:39,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:18:39,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:40,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:40,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:18:40,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:18:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:18:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:40,304 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 28 states. [2019-08-05 11:18:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:40,385 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:18:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:18:40,386 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-08-05 11:18:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:40,387 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:18:40,387 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:18:40,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:18:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:18:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:18:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:18:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:18:40,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:18:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:40,391 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:18:40,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:18:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:18:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:18:40,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:40,392 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 11:18:40,393 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 11:18:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:40,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:18:40,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:41,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:41,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:18:41,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:18:41,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:18:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:41,210 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 29 states. [2019-08-05 11:18:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:41,289 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:18:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:18:41,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-08-05 11:18:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:41,291 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:18:41,291 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:18:41,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:18:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 11:18:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:18:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:18:41,295 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:18:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:41,295 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:18:41,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:18:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:18:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:18:41,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:41,296 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 11:18:41,297 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 11:18:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:41,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:18:41,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:18:42,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:18:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:18:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:42,075 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 30 states. [2019-08-05 11:18:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,279 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:18:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:18:42,280 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-08-05 11:18:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,280 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:18:42,281 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:18:42,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:18:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 11:18:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:18:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:18:42,284 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:18:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,285 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:18:42,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:18:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:18:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:18:42,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,285 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 11:18:42,285 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 11:18:42,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:18:42,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:18:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:18:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:18:42,717 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 31 states. [2019-08-05 11:18:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,838 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:18:42,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:18:42,838 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-08-05 11:18:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,839 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:18:42,839 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:18:42,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 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 11:18:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:18:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:18:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:18:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:18:42,843 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:18:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,843 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:18:42,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:18:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:18:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:18:42,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,844 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 11:18:42,844 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 11:18:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:43,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:18:43,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:18:43,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:18:43,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:43,255 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 32 states. [2019-08-05 11:18:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:43,426 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:18:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:18:43,426 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2019-08-05 11:18:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:43,427 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:18:43,427 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:18:43,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:18:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 11:18:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:18:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:18:43,431 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:18:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:43,431 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:18:43,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:18:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:18:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:18:43,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:43,432 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 11:18:43,432 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 11:18:43,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:43,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:18:43,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:44,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:44,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:18:44,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:18:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:18:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:44,194 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 33 states. [2019-08-05 11:18:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:44,329 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:18:44,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:18:44,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2019-08-05 11:18:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:44,331 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:18:44,331 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:18:44,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:18:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 11:18:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:18:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:18:44,334 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:18:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:44,335 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:18:44,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:18:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:18:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:18:44,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:44,335 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 11:18:44,335 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 11:18:44,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:44,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:18:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:44,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:44,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:18:44,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:18:44,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:18:44,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:44,803 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 34 states. [2019-08-05 11:18:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:44,901 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:18:44,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:18:44,902 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2019-08-05 11:18:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:44,903 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:18:44,903 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:18:44,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:18:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:18:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:18:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:18:44,907 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:18:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:44,907 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:18:44,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:18:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:18:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:18:44,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:44,908 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 11:18:44,908 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 11:18:44,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:44,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:18:44,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:45,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:18:45,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:18:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:18:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:18:45,477 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 35 states. [2019-08-05 11:18:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:45,597 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:18:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:18:45,597 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2019-08-05 11:18:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:45,598 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:18:45,598 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:18:45,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 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 11:18:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:18:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 11:18:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:18:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:18:45,602 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:18:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:45,603 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:18:45,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:18:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:18:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:18:45,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:45,603 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 11:18:45,603 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:45,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 11:18:45,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:45,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:18:45,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:47,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:18:47,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:18:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:18:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:47,036 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 36 states. [2019-08-05 11:18:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:47,135 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:18:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:18:47,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-08-05 11:18:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:47,137 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:18:47,137 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:18:47,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:18:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 11:18:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:18:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:18:47,141 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:18:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:47,141 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:18:47,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:18:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:18:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:18:47,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:47,142 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 11:18:47,142 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 11:18:47,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:47,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:18:47,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:47,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:18:47,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:18:47,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:18:47,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:47,760 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 37 states. [2019-08-05 11:18:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:47,889 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:18:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:18:47,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2019-08-05 11:18:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:47,890 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:18:47,891 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:18:47,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:18:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 11:18:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:18:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:18:47,894 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 11:18:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:47,894 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:18:47,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:18:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:18:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:18:47,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:47,895 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 11:18:47,895 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 11:18:47,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:47,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:18:47,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:48,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:48,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:18:48,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:18:48,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:18:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:48,666 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 38 states. [2019-08-05 11:18:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:48,820 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:18:48,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:18:48,821 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 71 [2019-08-05 11:18:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:48,821 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:18:48,821 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:18:48,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:18:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 11:18:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:18:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:18:48,824 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 11:18:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:48,824 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:18:48,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:18:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:18:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:18:48,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:48,825 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 11:18:48,825 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:48,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 11:18:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:48,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:18:48,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:49,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:49,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:18:49,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:18:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:18:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:49,975 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 39 states. [2019-08-05 11:18:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:50,078 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:18:50,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:18:50,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2019-08-05 11:18:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:50,080 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:18:50,080 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:18:50,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:18:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:18:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:18:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:18:50,084 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 11:18:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:50,084 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:18:50,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:18:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:18:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:18:50,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:50,085 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 11:18:50,085 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 11:18:50,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:50,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:18:50,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:50,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:50,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:18:50,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:18:50,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:18:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:50,735 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 40 states. [2019-08-05 11:18:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:50,842 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:18:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:18:50,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2019-08-05 11:18:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:50,844 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:18:50,844 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:18:50,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:18:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 11:18:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:18:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:18:50,847 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 11:18:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:50,847 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:18:50,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:18:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:18:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:18:50,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:50,848 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 11:18:50,848 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:50,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 11:18:50,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:50,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:18:50,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:51,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:51,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:18:51,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:18:51,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:18:51,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:51,592 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 41 states. [2019-08-05 11:18:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:51,702 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:18:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:18:51,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2019-08-05 11:18:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:51,703 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:18:51,703 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:18:51,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:18:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 11:18:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:18:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:18:51,707 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 11:18:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:51,707 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:18:51,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:18:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:18:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:18:51,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:51,710 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 11:18:51,711 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 11:18:51,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:51,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:18:51,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:52,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:52,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:18:52,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:18:52,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:18:52,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:52,508 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 42 states. [2019-08-05 11:18:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:52,642 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:18:52,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:18:52,643 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2019-08-05 11:18:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:52,644 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:18:52,644 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:18:52,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:18:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 11:18:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:18:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:18:52,647 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 11:18:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:52,647 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:18:52,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:18:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:18:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:18:52,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:52,648 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 11:18:52,648 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 11:18:52,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:52,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:18:52,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:53,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:53,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:18:53,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:18:53,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:18:53,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:53,546 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 43 states. [2019-08-05 11:18:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:53,672 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:18:53,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:18:53,673 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-08-05 11:18:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:53,674 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:18:53,674 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:18:53,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:18:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 11:18:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:18:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:18:53,678 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 11:18:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:53,678 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:18:53,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:18:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:18:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:18:53,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:53,679 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 11:18:53,679 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 11:18:53,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:53,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:18:53,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:54,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:18:54,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:18:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:18:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:54,786 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 44 states. [2019-08-05 11:18:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:54,906 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:18:54,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:18:54,907 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2019-08-05 11:18:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:54,908 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:18:54,908 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:18:54,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:18:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 11:18:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:18:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:18:54,912 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 11:18:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:54,913 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:18:54,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:18:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:18:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:18:54,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:54,914 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 11:18:54,914 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 11:18:54,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:54,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:18:54,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:55,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:55,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:18:55,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:18:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:18:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:18:55,684 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 45 states. [2019-08-05 11:18:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:55,800 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:18:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:18:55,801 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-08-05 11:18:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:55,802 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:18:55,802 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:18:55,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:18:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:18:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 11:18:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:18:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:18:55,806 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 11:18:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:55,806 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:18:55,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:18:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:18:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:18:55,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:55,807 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 11:18:55,807 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 11:18:55,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:55,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:18:55,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:56,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:56,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:18:56,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:18:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:18:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:18:56,602 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 46 states. [2019-08-05 11:18:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:56,724 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:18:56,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:18:56,725 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2019-08-05 11:18:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:56,726 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:18:56,726 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:18:56,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:18:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:18:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 11:18:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:18:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:18:56,730 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 11:18:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:56,730 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:18:56,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:18:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:18:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:18:56,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:56,730 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 11:18:56,731 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 11:18:56,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:56,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:18:56,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:57,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:57,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:18:57,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:18:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:18:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:18:57,535 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 47 states. [2019-08-05 11:18:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:57,901 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:18:57,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:18:57,902 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 89 [2019-08-05 11:18:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:57,903 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:18:57,903 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:18:57,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 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 11:18:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:18:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 11:18:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:18:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:18:57,906 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 11:18:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:57,907 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:18:57,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:18:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:18:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:18:57,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:57,908 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 11:18:57,908 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 11:18:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:57,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:18:57,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:58,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:18:58,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:18:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:18:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:18:58,901 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2019-08-05 11:18:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:59,068 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:18:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:18:59,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2019-08-05 11:18:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:59,069 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:18:59,069 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:18:59,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:18:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:18:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:18:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:18:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:18:59,072 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 11:18:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:59,072 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:18:59,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:18:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:18:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:18:59,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:59,073 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 11:18:59,073 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 11:18:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:59,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:18:59,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:00,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:19:00,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:19:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:19:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:19:00,156 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 49 states. [2019-08-05 11:19:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:00,284 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:19:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:19:00,285 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 93 [2019-08-05 11:19:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:00,286 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:19:00,286 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:19:00,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:19:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:19:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 11:19:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:19:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:19:00,289 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 11:19:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:00,289 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:19:00,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:19:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:19:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:19:00,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:00,290 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 11:19:00,290 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 11:19:00,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:00,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:19:00,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:01,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:01,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:19:01,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:19:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:19:01,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:19:01,409 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 50 states. [2019-08-05 11:19:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:01,561 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:19:01,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:19:01,562 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 95 [2019-08-05 11:19:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:01,563 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:19:01,564 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:19:01,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:19:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:19:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 11:19:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:19:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:19:01,568 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 11:19:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:01,568 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:19:01,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:19:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:19:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:19:01,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:01,569 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 11:19:01,569 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 11:19:01,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:01,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:19:01,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:19:02,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:19:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:19:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:19:02,699 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 51 states. [2019-08-05 11:19:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:02,834 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:19:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:19:02,839 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 97 [2019-08-05 11:19:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:02,840 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:19:02,840 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:19:02,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 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 11:19:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:19:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 11:19:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:19:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:19:02,843 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 11:19:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:02,843 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:19:02,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:19:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:19:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:19:02,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:02,844 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 11:19:02,844 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 11:19:02,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:02,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:19:02,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:04,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:04,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:19:04,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:19:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:19:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:19:04,169 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 52 states. [2019-08-05 11:19:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:04,349 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:19:04,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:19:04,349 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2019-08-05 11:19:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:04,350 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:19:04,350 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:19:04,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:19:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:19:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:19:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:19:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:19:04,353 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 11:19:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:04,353 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:19:04,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:19:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:19:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:19:04,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:04,354 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 11:19:04,354 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 11:19:04,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:04,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:19:04,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:05,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:05,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:19:05,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:19:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:19:05,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:19:05,442 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 53 states. [2019-08-05 11:19:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:05,591 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:19:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:19:05,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 101 [2019-08-05 11:19:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:05,592 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:19:05,593 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:19:05,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:19:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:19:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 11:19:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:19:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:19:05,596 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 11:19:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:05,596 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:19:05,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:19:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:19:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:19:05,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:05,597 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 11:19:05,598 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-08-05 11:19:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:05,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:19:05,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:19:07,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:19:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:19:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:19:07,385 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 54 states. [2019-08-05 11:19:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:07,573 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:19:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:19:07,574 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 103 [2019-08-05 11:19:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:07,575 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:19:07,575 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:19:07,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:19:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:19:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 11:19:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:19:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:19:07,579 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 11:19:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:07,579 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:19:07,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:19:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:19:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:19:07,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:07,580 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 11:19:07,580 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-08-05 11:19:07,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:07,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:19:07,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:08,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:08,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:19:08,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:19:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:19:08,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:19:08,804 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 55 states. [2019-08-05 11:19:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:08,973 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:19:08,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:19:08,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2019-08-05 11:19:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:08,975 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:19:08,975 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:19:08,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:19:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:19:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 11:19:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:19:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:19:08,979 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 11:19:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:08,980 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:19:08,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:19:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:19:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:19:08,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:08,981 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-08-05 11:19:08,981 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:08,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-08-05 11:19:08,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:08,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:19:08,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:10,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:10,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:19:10,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:19:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:19:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:19:10,648 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 56 states. [2019-08-05 11:19:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:10,794 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:19:10,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:19:10,795 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2019-08-05 11:19:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:10,796 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:19:10,796 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:19:10,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:19:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:19:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 11:19:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:19:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:19:10,800 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 11:19:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:10,800 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:19:10,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:19:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:19:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:19:10,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:10,801 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-08-05 11:19:10,801 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-08-05 11:19:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:10,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:19:10,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:12,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:12,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:19:12,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:19:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:19:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:19:12,186 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 57 states. [2019-08-05 11:19:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:12,344 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:19:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:19:12,345 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 109 [2019-08-05 11:19:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:12,346 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:19:12,346 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:19:12,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:19:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:19:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-08-05 11:19:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:19:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:19:12,350 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 11:19:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:12,350 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:19:12,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:19:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:19:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:19:12,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:12,351 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-08-05 11:19:12,351 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-08-05 11:19:12,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:12,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:19:12,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:13,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:13,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:19:13,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:19:13,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:19:13,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:19:13,605 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 58 states. [2019-08-05 11:19:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:14,022 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:19:14,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:19:14,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 111 [2019-08-05 11:19:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:14,024 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:19:14,024 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:19:14,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 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 11:19:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:19:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:19:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:19:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:19:14,027 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 11:19:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:14,028 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:19:14,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:19:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:19:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:19:14,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:14,029 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-08-05 11:19:14,029 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-08-05 11:19:14,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:14,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:19:14,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:15,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:15,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:19:15,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:19:15,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:19:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:19:15,597 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 59 states. [2019-08-05 11:19:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:15,837 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:19:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:19:15,838 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 113 [2019-08-05 11:19:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:15,839 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:19:15,839 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:19:15,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:19:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:19:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-08-05 11:19:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:19:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:19:15,843 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 11:19:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:15,843 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:19:15,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:19:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:19:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:19:15,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:15,844 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-08-05 11:19:15,844 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:15,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-08-05 11:19:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:15,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:19:15,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:17,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:19:17,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:19:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:19:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:19:17,198 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 60 states. [2019-08-05 11:19:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:17,417 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:19:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:19:17,417 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2019-08-05 11:19:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:17,418 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:19:17,419 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:19:17,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:19:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:19:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 11:19:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:19:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:19:17,421 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 11:19:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:17,422 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:19:17,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:19:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:19:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:19:17,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:17,422 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-08-05 11:19:17,422 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-08-05 11:19:17,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:17,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:19:17,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:18,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:18,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:19:18,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:19:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:19:18,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:19:18,789 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 61 states. [2019-08-05 11:19:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:18,951 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:19:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:19:18,952 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 117 [2019-08-05 11:19:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:18,953 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:19:18,953 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:19:18,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:19:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:19:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 11:19:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:19:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:19:18,956 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 11:19:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:18,957 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:19:18,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:19:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:19:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:19:18,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:18,958 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-08-05 11:19:18,958 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-08-05 11:19:18,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:18,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:19:18,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:19:20,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:19:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:19:20,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:19:20,694 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 62 states. [2019-08-05 11:19:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:20,873 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:19:20,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:19:20,874 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 119 [2019-08-05 11:19:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:20,875 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:19:20,875 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:19:20,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:19:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:19:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 11:19:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:19:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:19:20,878 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 11:19:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:20,878 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:19:20,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:19:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:19:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:19:20,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:20,879 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-08-05 11:19:20,880 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:20,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-08-05 11:19:20,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:20,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:19:20,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:22,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:22,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:19:22,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:19:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:19:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:19:22,374 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 63 states. [2019-08-05 11:19:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:22,540 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 11:19:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:19:22,541 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 121 [2019-08-05 11:19:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:22,542 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:19:22,542 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:19:22,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:19:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:19:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-08-05 11:19:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:19:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:19:22,545 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 11:19:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:22,545 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:19:22,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:19:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:19:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:19:22,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:22,546 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-08-05 11:19:22,546 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-08-05 11:19:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:22,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:19:22,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:24,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:19:24,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:19:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:19:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:19:24,223 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 64 states. [2019-08-05 11:19:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:24,398 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 11:19:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:19:24,398 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2019-08-05 11:19:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:24,399 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:19:24,400 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:19:24,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 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 11:19:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:19:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 11:19:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:19:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 11:19:24,404 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 11:19:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:24,404 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 11:19:24,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:19:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 11:19:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:19:24,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:24,405 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-08-05 11:19:24,405 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:24,405 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-08-05 11:19:24,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:24,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:19:24,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:26,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:19:26,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:19:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:19:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:19:26,325 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 65 states. [2019-08-05 11:19:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:26,503 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 11:19:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:19:26,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 125 [2019-08-05 11:19:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:26,504 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:19:26,504 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:19:26,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:19:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:19:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-08-05 11:19:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:19:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 11:19:26,508 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 11:19:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:26,508 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 11:19:26,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:19:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 11:19:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:19:26,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:26,509 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-08-05 11:19:26,509 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:26,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-08-05 11:19:26,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:26,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:19:26,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:28,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:28,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:19:28,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:19:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:19:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:19:28,111 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 66 states. [2019-08-05 11:19:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:28,287 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 11:19:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:19:28,288 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 127 [2019-08-05 11:19:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:28,289 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:19:28,289 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:19:28,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 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 11:19:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:19:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 11:19:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:19:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 11:19:28,292 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 11:19:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:28,292 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 11:19:28,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:19:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 11:19:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:19:28,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:28,293 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-08-05 11:19:28,293 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-08-05 11:19:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:28,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:19:28,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:30,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:30,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:19:30,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:19:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:19:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:19:30,230 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 67 states. [2019-08-05 11:19:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:30,415 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 11:19:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:19:30,416 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 129 [2019-08-05 11:19:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:30,417 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:19:30,417 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:19:30,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:19:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:19:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 11:19:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:19:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 11:19:30,420 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 11:19:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:30,420 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 11:19:30,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:19:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 11:19:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:19:30,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:30,421 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-08-05 11:19:30,421 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-08-05 11:19:30,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:30,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:19:30,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:32,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:32,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:19:32,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:19:32,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:19:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:19:32,154 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 68 states. [2019-08-05 11:19:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:32,342 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 11:19:32,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:19:32,342 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2019-08-05 11:19:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:32,343 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:19:32,344 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:19:32,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:19:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:19:32,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 11:19:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:19:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 11:19:32,347 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 11:19:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:32,347 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 11:19:32,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:19:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 11:19:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:19:32,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:32,348 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-08-05 11:19:32,349 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:32,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-08-05 11:19:32,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:32,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:19:32,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:19:36,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:19:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:19:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:19:36,218 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 69 states. [2019-08-05 11:19:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:36,404 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 11:19:36,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:19:36,405 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 133 [2019-08-05 11:19:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:36,406 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:19:36,406 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:19:36,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:19:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:19:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 11:19:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:19:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 11:19:36,410 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 11:19:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:36,410 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 11:19:36,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:19:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 11:19:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:19:36,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:36,411 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-08-05 11:19:36,411 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-08-05 11:19:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:36,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:19:36,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:19:39,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:19:39,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:19:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:19:39,110 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 70 states. [2019-08-05 11:19:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:40,276 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 11:19:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:19:40,276 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 135 [2019-08-05 11:19:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:40,278 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:19:40,278 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:19:40,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:19:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:19:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 11:19:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:19:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 11:19:40,281 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 11:19:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:40,281 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 11:19:40,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:19:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 11:19:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:19:40,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:40,282 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-08-05 11:19:40,282 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-08-05 11:19:40,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:40,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:19:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:42,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:19:42,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:19:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:19:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:19:42,111 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 71 states. [2019-08-05 11:19:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:42,377 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 11:19:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:19:42,377 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 137 [2019-08-05 11:19:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:42,378 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:19:42,378 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:19:42,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:19:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:19:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-08-05 11:19:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:19:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 11:19:42,382 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 11:19:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:42,382 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 11:19:42,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:19:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 11:19:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:19:42,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:42,383 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2019-08-05 11:19:42,383 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2019-08-05 11:19:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:42,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:19:42,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:44,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:19:44,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:19:44,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:19:44,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:19:44,234 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 72 states. [2019-08-05 11:19:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:44,437 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 11:19:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:19:44,437 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 139 [2019-08-05 11:19:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:44,439 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:19:44,439 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:19:44,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:19:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:19:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 11:19:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:19:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 11:19:44,442 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 11:19:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:44,442 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 11:19:44,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:19:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 11:19:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:19:44,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:44,443 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2019-08-05 11:19:44,444 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2019-08-05 11:19:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:44,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:19:44,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:46,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:19:46,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:19:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:19:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:19:46,712 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 73 states. [2019-08-05 11:19:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:46,921 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 11:19:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:19:46,921 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 141 [2019-08-05 11:19:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:46,923 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:19:46,923 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:19:46,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:19:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:19:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-08-05 11:19:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:19:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 11:19:46,926 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 11:19:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:46,926 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 11:19:46,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:19:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 11:19:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:19:46,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:46,927 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2019-08-05 11:19:46,927 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2019-08-05 11:19:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:46,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:19:46,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:49,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:49,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:19:49,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:19:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:19:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:19:49,062 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 74 states. [2019-08-05 11:19:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:49,291 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 11:19:49,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:19:49,291 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 143 [2019-08-05 11:19:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:49,293 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:19:49,293 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:19:49,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 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 11:19:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:19:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 11:19:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:19:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 11:19:49,297 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 11:19:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:49,297 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 11:19:49,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:19:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 11:19:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:19:49,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:49,298 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2019-08-05 11:19:49,298 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2019-08-05 11:19:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:49,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:19:49,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:51,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:19:51,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:19:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:19:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:19:51,574 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 75 states. [2019-08-05 11:19:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:51,779 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 11:19:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:19:51,780 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 145 [2019-08-05 11:19:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:51,781 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:19:51,781 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:19:51,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:19:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:19:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-08-05 11:19:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:19:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 11:19:51,785 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 11:19:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:51,785 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 11:19:51,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:19:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 11:19:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:19:51,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:51,786 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2019-08-05 11:19:51,786 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2019-08-05 11:19:51,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:51,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:19:51,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:53,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:53,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:19:53,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:19:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:19:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:19:53,941 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 76 states. [2019-08-05 11:19:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:54,215 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 11:19:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:19:54,216 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2019-08-05 11:19:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:54,217 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:19:54,217 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:19:54,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 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 11:19:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:19:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 11:19:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:19:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 11:19:54,220 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 11:19:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:54,220 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 11:19:54,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:19:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 11:19:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:19:54,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:54,221 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2019-08-05 11:19:54,222 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2019-08-05 11:19:54,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:54,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:19:54,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:19:56,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:19:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:19:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:19:56,547 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 77 states. [2019-08-05 11:19:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:56,778 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 11:19:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:19:56,778 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 149 [2019-08-05 11:19:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:56,780 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:19:56,780 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:19:56,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 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 11:19:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:19:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 11:19:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:19:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 11:19:56,783 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 11:19:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:56,783 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 11:19:56,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:19:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 11:19:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:19:56,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:56,784 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2019-08-05 11:19:56,784 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2019-08-05 11:19:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:56,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:19:56,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:59,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:59,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:19:59,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:19:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:19:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:59,475 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 78 states. [2019-08-05 11:19:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:59,692 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 11:19:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:19:59,692 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 151 [2019-08-05 11:19:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:59,693 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:19:59,694 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:19:59,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:19:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 11:19:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:19:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 11:19:59,697 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 11:19:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:59,697 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 11:19:59,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:19:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 11:19:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:19:59,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:59,698 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2019-08-05 11:19:59,698 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2019-08-05 11:19:59,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:59,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:19:59,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:02,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:02,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:20:02,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:20:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:20:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:20:02,307 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 79 states. [2019-08-05 11:20:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:02,533 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 11:20:02,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:20:02,533 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 153 [2019-08-05 11:20:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:02,534 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:20:02,535 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:20:02,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:20:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:20:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-08-05 11:20:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:20:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 11:20:02,538 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 11:20:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:02,538 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 11:20:02,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:20:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 11:20:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:20:02,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:02,539 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2019-08-05 11:20:02,539 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2019-08-05 11:20:02,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:02,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:20:02,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:05,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:05,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:20:05,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:20:05,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:20:05,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:20:05,253 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 80 states. [2019-08-05 11:20:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:05,501 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 11:20:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:20:05,501 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 155 [2019-08-05 11:20:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:05,502 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:20:05,502 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:20:05,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:20:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:20:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 11:20:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:20:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 11:20:05,504 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 11:20:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:05,505 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 11:20:05,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:20:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 11:20:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:20:05,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:05,506 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2019-08-05 11:20:05,507 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2019-08-05 11:20:05,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:05,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:20:05,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:07,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:07,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:20:07,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:20:07,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:20:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:20:07,932 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 81 states. [2019-08-05 11:20:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:08,167 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 11:20:08,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:20:08,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 157 [2019-08-05 11:20:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:08,168 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:20:08,169 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:20:08,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:20:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:20:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 11:20:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:20:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 11:20:08,173 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 11:20:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:08,173 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 11:20:08,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:20:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 11:20:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:20:08,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:08,174 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2019-08-05 11:20:08,175 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2019-08-05 11:20:08,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:08,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:20:08,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:10,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:10,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:20:10,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:20:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:20:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:20:10,558 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 82 states. [2019-08-05 11:20:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:10,861 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-05 11:20:10,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:20:10,862 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 159 [2019-08-05 11:20:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:10,862 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:20:10,862 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:20:10,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:20:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:20:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-08-05 11:20:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:20:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 11:20:10,865 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 11:20:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:10,865 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 11:20:10,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:20:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 11:20:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:20:10,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:10,866 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2019-08-05 11:20:10,867 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2019-08-05 11:20:10,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:10,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:20:10,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:13,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:13,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:20:13,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:20:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:20:13,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:20:13,401 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 83 states. [2019-08-05 11:20:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:13,634 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 11:20:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:20:13,634 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 161 [2019-08-05 11:20:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:13,635 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:20:13,636 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:20:13,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:20:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:20:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-08-05 11:20:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:20:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 11:20:13,640 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 11:20:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:13,640 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 11:20:13,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:20:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 11:20:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:20:13,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:13,641 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2019-08-05 11:20:13,641 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:13,642 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2019-08-05 11:20:13,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:13,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:20:13,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:16,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:16,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:20:16,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:20:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:20:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:20:16,703 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 84 states. [2019-08-05 11:20:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:16,939 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 11:20:16,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:20:16,940 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 163 [2019-08-05 11:20:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:16,941 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:20:16,941 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:20:16,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:20:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:20:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 11:20:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:20:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 11:20:16,944 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 11:20:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:16,944 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 11:20:16,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:20:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 11:20:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:20:16,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:16,945 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2019-08-05 11:20:16,945 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2019-08-05 11:20:16,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:16,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:20:16,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:19,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:19,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:20:19,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:20:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:20:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:20:19,498 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 85 states. [2019-08-05 11:20:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:19,738 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-05 11:20:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:20:19,739 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 165 [2019-08-05 11:20:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:19,740 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:20:19,740 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:20:19,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:20:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:20:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-08-05 11:20:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:20:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 11:20:19,743 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 11:20:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:19,743 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 11:20:19,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:20:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 11:20:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:20:19,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:19,744 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2019-08-05 11:20:19,744 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2019-08-05 11:20:19,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:19,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:20:19,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:22,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:22,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:20:22,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:20:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:20:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:20:22,691 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 86 states. [2019-08-05 11:20:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:22,937 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 11:20:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:20:22,938 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 167 [2019-08-05 11:20:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:22,939 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:20:22,939 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:20:22,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:20:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:20:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-08-05 11:20:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:20:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 11:20:22,942 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 11:20:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:22,942 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 11:20:22,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:20:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 11:20:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:20:22,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:22,943 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2019-08-05 11:20:22,943 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2019-08-05 11:20:22,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:22,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:20:22,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:25,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:25,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:20:25,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:20:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:20:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:20:25,681 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 87 states. [2019-08-05 11:20:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:25,926 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 11:20:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:20:25,927 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 169 [2019-08-05 11:20:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:25,928 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:20:25,928 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:20:25,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:20:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:20:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-08-05 11:20:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:20:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 11:20:25,931 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 11:20:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:25,931 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 11:20:25,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:20:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 11:20:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:20:25,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:25,932 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2019-08-05 11:20:25,932 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2019-08-05 11:20:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:25,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:20:25,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:28,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:28,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:20:28,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:20:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:20:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:20:28,919 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 88 states. [2019-08-05 11:20:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:29,175 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-05 11:20:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:20:29,175 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 171 [2019-08-05 11:20:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:29,176 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:20:29,177 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:20:29,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:20:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:20:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-08-05 11:20:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:20:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 11:20:29,180 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 11:20:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:29,180 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 11:20:29,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:20:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 11:20:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:20:29,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:29,183 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2019-08-05 11:20:29,183 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2019-08-05 11:20:29,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:29,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:20:29,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:32,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:32,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:20:32,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:20:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:20:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:20:32,341 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 89 states. [2019-08-05 11:20:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:32,600 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 11:20:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:20:32,600 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 173 [2019-08-05 11:20:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:32,602 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:20:32,602 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:20:32,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:20:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:20:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-08-05 11:20:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:20:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 11:20:32,606 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 11:20:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:32,606 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 11:20:32,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:20:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 11:20:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:20:32,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:32,608 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2019-08-05 11:20:32,608 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2019-08-05 11:20:32,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:32,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:20:32,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:35,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:35,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:20:35,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:20:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:20:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:20:35,612 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 90 states. [2019-08-05 11:20:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:35,875 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 11:20:35,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:20:35,875 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 175 [2019-08-05 11:20:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:35,877 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:20:35,877 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:20:35,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 86 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 11:20:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:20:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-08-05 11:20:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:20:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 11:20:35,880 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 11:20:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:35,880 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 11:20:35,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:20:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 11:20:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:20:35,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:35,881 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2019-08-05 11:20:35,881 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2019-08-05 11:20:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:35,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:20:35,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:39,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:39,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:20:39,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:20:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:20:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:20:39,126 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 91 states. [2019-08-05 11:20:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:39,388 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-05 11:20:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:20:39,389 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 177 [2019-08-05 11:20:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:39,390 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:20:39,390 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:20:39,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:20:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:20:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-08-05 11:20:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:20:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 11:20:39,394 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 11:20:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:39,394 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 11:20:39,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:20:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 11:20:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:20:39,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:39,395 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2019-08-05 11:20:39,395 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2019-08-05 11:20:39,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:39,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:20:39,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:42,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:42,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:20:42,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:20:42,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:20:42,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:42,613 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 92 states. [2019-08-05 11:20:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:42,890 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-05 11:20:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:20:42,891 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 179 [2019-08-05 11:20:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:42,892 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:20:42,892 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:20:42,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:20:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-08-05 11:20:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:20:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 11:20:42,896 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 11:20:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:42,896 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 11:20:42,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:20:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 11:20:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:20:42,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:42,897 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2019-08-05 11:20:42,898 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2019-08-05 11:20:42,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:42,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:20:42,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:46,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:20:46,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:20:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:20:46,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:20:46,212 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 93 states. [2019-08-05 11:20:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:46,507 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-05 11:20:46,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:20:46,507 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 181 [2019-08-05 11:20:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:46,509 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:20:46,509 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:20:46,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:20:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:20:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-08-05 11:20:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:20:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 11:20:46,512 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 11:20:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:46,512 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 11:20:46,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:20:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 11:20:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:20:46,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:46,513 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2019-08-05 11:20:46,513 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2019-08-05 11:20:46,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:46,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:20:46,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:49,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:49,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:20:49,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:20:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:20:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:20:49,824 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 94 states. [2019-08-05 11:20:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:50,095 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-08-05 11:20:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:20:50,096 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 183 [2019-08-05 11:20:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:50,097 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:20:50,097 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:20:50,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 90 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 11:20:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:20:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 11:20:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:20:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 11:20:50,101 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 11:20:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:50,101 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 11:20:50,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:20:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 11:20:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:20:50,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:50,103 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2019-08-05 11:20:50,103 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2019-08-05 11:20:50,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:50,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:20:50,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:20:54,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:20:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:20:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:20:54,225 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 95 states. [2019-08-05 11:20:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,507 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-05 11:20:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:20:54,507 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 185 [2019-08-05 11:20:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,509 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:20:54,509 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:20:54,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:20:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:20:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-08-05 11:20:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:20:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 11:20:54,512 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 11:20:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,513 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 11:20:54,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:20:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 11:20:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:20:54,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,514 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2019-08-05 11:20:54,514 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2019-08-05 11:20:54,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:58,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:58,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:20:58,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:20:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:20:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:20:58,161 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 96 states. [2019-08-05 11:20:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:58,449 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-05 11:20:58,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:20:58,450 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 187 [2019-08-05 11:20:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:58,451 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:20:58,451 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:20:58,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:20:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:20:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-08-05 11:20:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:20:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 11:20:58,455 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 11:20:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:58,455 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 11:20:58,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:20:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 11:20:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:20:58,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:58,456 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2019-08-05 11:20:58,457 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2019-08-05 11:20:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:58,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:20:58,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:01,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:01,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:21:01,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:21:01,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:21:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:21:01,986 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 97 states. [2019-08-05 11:21:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:02,334 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-08-05 11:21:02,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:21:02,334 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 189 [2019-08-05 11:21:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:02,336 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:21:02,336 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:21:02,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:21:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:21:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-08-05 11:21:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:21:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 11:21:02,339 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 11:21:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:02,339 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 11:21:02,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:21:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 11:21:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:21:02,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:02,340 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2019-08-05 11:21:02,340 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2019-08-05 11:21:02,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:02,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:21:02,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:05,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:21:05,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:21:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:21:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:21:05,804 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 98 states. [2019-08-05 11:21:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:06,102 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-05 11:21:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:21:06,102 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 191 [2019-08-05 11:21:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:06,104 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:21:06,104 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:21:06,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:21:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:21:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-08-05 11:21:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:21:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 11:21:06,107 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 11:21:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:06,108 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 11:21:06,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:21:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 11:21:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:21:06,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,109 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2019-08-05 11:21:06,109 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2019-08-05 11:21:06,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:21:09,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:21:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:21:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:21:09,947 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 99 states. [2019-08-05 11:21:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,248 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-05 11:21:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:21:10,248 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 193 [2019-08-05 11:21:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,250 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:21:10,250 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:21:10,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:21:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:21:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-08-05 11:21:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:21:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 11:21:10,253 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 11:21:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,253 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 11:21:10,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:21:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 11:21:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:21:10,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,254 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2019-08-05 11:21:10,254 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2019-08-05 11:21:10,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:14,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:21:14,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:21:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:21:14,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:21:14,172 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 100 states. [2019-08-05 11:21:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,478 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-08-05 11:21:14,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:21:14,479 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 195 [2019-08-05 11:21:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,480 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:21:14,480 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:21:14,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:21:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:21:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-08-05 11:21:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:21:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 11:21:14,484 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 11:21:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,484 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 11:21:14,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:21:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 11:21:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:21:14,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,485 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2019-08-05 11:21:14,486 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2019-08-05 11:21:14,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:18,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:21:18,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:21:18,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:21:18,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:21:18,386 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 101 states. [2019-08-05 11:21:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,697 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-05 11:21:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:21:18,698 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 197 [2019-08-05 11:21:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,699 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:21:18,699 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:21:18,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:21:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:21:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-08-05 11:21:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:21:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 11:21:18,702 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 11:21:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,703 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 11:21:18,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:21:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 11:21:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:21:18,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,703 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2019-08-05 11:21:18,704 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2019-08-05 11:21:18,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:21:22,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:21:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:21:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:21:22,825 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 102 states. [2019-08-05 11:21:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,151 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:21:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:21:23,151 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 199 [2019-08-05 11:21:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,152 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:21:23,152 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:21:23,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:21:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:21:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-08-05 11:21:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:21:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 11:21:23,155 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 11:21:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,156 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 11:21:23,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:21:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 11:21:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:21:23,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,157 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2019-08-05 11:21:23,157 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2019-08-05 11:21:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:26,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:26,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:21:26,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:21:26,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:21:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:21:26,952 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 103 states. [2019-08-05 11:21:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:27,270 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-08-05 11:21:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:21:27,270 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 201 [2019-08-05 11:21:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:27,272 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:21:27,272 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:21:27,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:21:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:21:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-08-05 11:21:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:21:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 11:21:27,274 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 11:21:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:27,275 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 11:21:27,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:21:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 11:21:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:21:27,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:27,276 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2019-08-05 11:21:27,276 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2019-08-05 11:21:27,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:27,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:21:27,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:31,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:31,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:21:31,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:21:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:21:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:21:31,473 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 104 states. [2019-08-05 11:21:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,826 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-08-05 11:21:31,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:21:31,827 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 203 [2019-08-05 11:21:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,829 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:21:31,829 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:21:31,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:21:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:21:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-08-05 11:21:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:21:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 11:21:31,833 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 11:21:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,833 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 11:21:31,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:21:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 11:21:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 11:21:31,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,835 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2019-08-05 11:21:31,835 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2019-08-05 11:21:31,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:21:36,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:21:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:21:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:21:36,219 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 105 states. [2019-08-05 11:21:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,565 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-05 11:21:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:21:36,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 205 [2019-08-05 11:21:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,566 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:21:36,567 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:21:36,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:21:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:21:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-08-05 11:21:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:21:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 11:21:36,571 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 11:21:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,571 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 11:21:36,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:21:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 11:21:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:21:36,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,572 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2019-08-05 11:21:36,572 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2019-08-05 11:21:36,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:41,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:41,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:21:41,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:21:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:21:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:21:41,152 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 106 states. [2019-08-05 11:21:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:41,496 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-08-05 11:21:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:21:41,496 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 207 [2019-08-05 11:21:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:41,497 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:21:41,497 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:21:41,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:21:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:21:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-08-05 11:21:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 11:21:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 11:21:41,501 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 11:21:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:41,502 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 11:21:41,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:21:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 11:21:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:21:41,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:41,503 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2019-08-05 11:21:41,503 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2019-08-05 11:21:41,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:41,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:21:41,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:46,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:21:46,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:21:46,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:21:46,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:21:46,244 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 107 states. [2019-08-05 11:21:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:46,608 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-08-05 11:21:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:21:46,608 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 209 [2019-08-05 11:21:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:46,608 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:21:46,608 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:21:46,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:21:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:21:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-08-05 11:21:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:21:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 11:21:46,612 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 11:21:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:46,612 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 11:21:46,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:21:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 11:21:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:21:46,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:46,614 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2019-08-05 11:21:46,614 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2019-08-05 11:21:46,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:21:46,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:21:51,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:21:51,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:21:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:21:51,429 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 108 states. [2019-08-05 11:21:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,796 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-05 11:21:51,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:21:51,797 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 211 [2019-08-05 11:21:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,798 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:21:51,798 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:21:51,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:21:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:21:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 11:21:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:21:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 11:21:51,802 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 11:21:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,802 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 11:21:51,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:21:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 11:21:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:21:51,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,803 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2019-08-05 11:21:51,804 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2019-08-05 11:21:51,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:56,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:21:56,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:21:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:21:56,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:21:56,664 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 109 states. [2019-08-05 11:21:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:57,040 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-08-05 11:21:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:21:57,041 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 213 [2019-08-05 11:21:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:57,041 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:21:57,042 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:21:57,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:21:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:21:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-08-05 11:21:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 11:21:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 11:21:57,045 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 11:21:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:57,045 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 11:21:57,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:21:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 11:21:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 11:21:57,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:57,046 INFO L399 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2019-08-05 11:21:57,046 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2019-08-05 11:21:57,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:57,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:21:57,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:01,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:22:01,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:22:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:22:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:22:01,848 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 110 states. [2019-08-05 11:22:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,215 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-08-05 11:22:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:22:02,216 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 215 [2019-08-05 11:22:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,217 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:22:02,217 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:22:02,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:22:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:22:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-08-05 11:22:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 11:22:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 11:22:02,221 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 11:22:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,221 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 11:22:02,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:22:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 11:22:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:22:02,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,222 INFO L399 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2019-08-05 11:22:02,222 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2019-08-05 11:22:02,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:02,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:22:02,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:07,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:07,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:22:07,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:22:07,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:22:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:22:07,009 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 111 states. [2019-08-05 11:22:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:07,372 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-08-05 11:22:07,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:22:07,372 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 217 [2019-08-05 11:22:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:07,373 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:22:07,373 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:22:07,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:22:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:22:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-08-05 11:22:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 11:22:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-08-05 11:22:07,376 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2019-08-05 11:22:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:07,376 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-08-05 11:22:07,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:22:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-08-05 11:22:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 11:22:07,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:07,378 INFO L399 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2019-08-05 11:22:07,378 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2019-08-05 11:22:07,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:07,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:22:07,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:12,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:12,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:22:12,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:22:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:22:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:22:12,288 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 112 states. [2019-08-05 11:22:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:12,677 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-08-05 11:22:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:22:12,677 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 219 [2019-08-05 11:22:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:12,678 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:22:12,678 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:22:12,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:22:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:22:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-08-05 11:22:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-08-05 11:22:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-08-05 11:22:12,682 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2019-08-05 11:22:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:12,682 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-08-05 11:22:12,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:22:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-08-05 11:22:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 11:22:12,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:12,683 INFO L399 BasicCegarLoop]: trace histogram [110, 109, 1, 1] [2019-08-05 11:22:12,683 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086138, now seen corresponding path program 109 times [2019-08-05 11:22:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:12,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:22:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:17,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:17,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:22:17,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:22:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:22:17,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:22:17,589 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 113 states. [2019-08-05 11:22:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:17,966 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-08-05 11:22:17,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:22:17,967 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 221 [2019-08-05 11:22:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:17,967 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:22:17,967 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:22:17,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:22:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:22:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-08-05 11:22:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 11:22:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-08-05 11:22:17,970 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2019-08-05 11:22:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:17,970 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2019-08-05 11:22:17,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:22:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2019-08-05 11:22:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:22:17,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:17,971 INFO L399 BasicCegarLoop]: trace histogram [111, 110, 1, 1] [2019-08-05 11:22:17,971 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114172, now seen corresponding path program 110 times [2019-08-05 11:22:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:17,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:22:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:22,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:22,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:22:22,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:22:22,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:22:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:22:22,825 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 114 states. [2019-08-05 11:22:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:23,198 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-08-05 11:22:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:22:23,198 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 223 [2019-08-05 11:22:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:23,199 INFO L225 Difference]: With dead ends: 227 [2019-08-05 11:22:23,199 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 11:22:23,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:22:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 11:22:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-08-05 11:22:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 11:22:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-08-05 11:22:23,202 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2019-08-05 11:22:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:23,203 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-08-05 11:22:23,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:22:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-08-05 11:22:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 11:22:23,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:23,203 INFO L399 BasicCegarLoop]: trace histogram [112, 111, 1, 1] [2019-08-05 11:22:23,203 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344126, now seen corresponding path program 111 times [2019-08-05 11:22:23,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:23,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:22:23,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:28,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:28,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:22:28,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:22:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:22:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:22:28,349 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 115 states. [2019-08-05 11:22:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:28,749 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-08-05 11:22:28,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:22:28,750 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 225 [2019-08-05 11:22:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:28,751 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:22:28,751 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:22:28,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:22:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:22:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2019-08-05 11:22:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 11:22:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2019-08-05 11:22:28,754 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2019-08-05 11:22:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:28,755 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2019-08-05 11:22:28,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:22:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2019-08-05 11:22:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 11:22:28,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:28,755 INFO L399 BasicCegarLoop]: trace histogram [113, 112, 1, 1] [2019-08-05 11:22:28,756 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash -91394624, now seen corresponding path program 112 times [2019-08-05 11:22:28,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:28,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:22:28,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:22:30,138 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:22:30,138 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:22:30,142 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:22:30,142 INFO L202 PluginConnector]: Adding new model oneLoopAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:22:30 BoogieIcfgContainer [2019-08-05 11:22:30,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:22:30,145 INFO L168 Benchmark]: Toolchain (without parser) took 241189.73 ms. Allocated memory was 135.3 MB in the beginning and 712.0 MB in the end (delta: 576.7 MB). Free memory was 111.8 MB in the beginning and 573.1 MB in the end (delta: -461.3 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:30,145 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:22:30,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.85 ms. Allocated memory is still 135.3 MB. Free memory was 111.6 MB in the beginning and 109.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:30,146 INFO L168 Benchmark]: Boogie Preprocessor took 20.38 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 108.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 11:22:30,147 INFO L168 Benchmark]: RCFGBuilder took 306.43 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 99.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:30,147 INFO L168 Benchmark]: TraceAbstraction took 240827.69 ms. Allocated memory was 135.3 MB in the beginning and 712.0 MB in the end (delta: 576.7 MB). Free memory was 99.4 MB in the beginning and 573.1 MB in the end (delta: -473.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:30,151 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.18 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.85 ms. Allocated memory is still 135.3 MB. Free memory was 111.6 MB in the beginning and 109.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.38 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 108.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.43 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 99.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240827.69 ms. Allocated memory was 135.3 MB in the beginning and 712.0 MB in the end (delta: 576.7 MB). Free memory was 99.4 MB in the beginning and 573.1 MB in the end (delta: -473.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 228 with TraceHistMax 113,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 240.7s OverallTime, 113 OverallIterations, 113 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 6328 SDslu, 0 SDs, 0 SdLazy, 14161 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12656 GetRequests, 6216 SyntacticMatches, 0 SemanticMatches, 6440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=112, 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.3s AutomataMinimizationTime, 112 MinimizatonAttempts, 112 StatesRemovedByMinimization, 112 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 213.4s InterpolantComputationTime, 12768 NumberOfCodeBlocks, 12768 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 12656 ConstructedInterpolants, 0 QuantifiedInterpolants, 5695200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 25760 ConjunctsInSsa, 6552 ConjunctsInUnsatCore, 112 InterpolantComputations, 1 PerfectInterpolantSequences, 0/468272 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown