java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:54,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:54,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:54,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:54,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:54,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:54,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:54,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:54,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:54,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:54,979 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:54,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:54,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:54,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:54,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:54,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:54,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:54,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:54,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:54,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:54,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:54,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:54,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:54,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:54,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:54,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:54,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:55,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:55,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:55,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:55,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:55,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:55,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:55,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:55,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:55,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:55,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:55,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:55,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:55,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:55,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:55,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:55,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:55,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:55,057 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:55,058 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:55,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2019-08-04 21:38:55,059 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2019-08-04 21:38:55,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:55,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:55,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:55,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:55,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:55,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,124 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:38:55,124 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:38:55,124 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:38:55,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:55,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:55,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:55,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:55,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/1) ... [2019-08-04 21:38:55,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:55,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:55,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:55,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:55,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (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-04 21:38:55,232 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-04 21:38:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-04 21:38:55,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-04 21:38:55,472 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:38:55,472 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:55,473 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:55 BoogieIcfgContainer [2019-08-04 21:38:55,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:55,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:55,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:55,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:55,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:55" (1/2) ... [2019-08-04 21:38:55,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d16cbca and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:55, skipping insertion in model container [2019-08-04 21:38:55,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:55" (2/2) ... [2019-08-04 21:38:55,485 INFO L109 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2019-08-04 21:38:55,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:55,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:55,523 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:55,548 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:55,549 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:55,550 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:55,550 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:55,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:55,550 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:55,550 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:55,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:55,551 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-04 21:38:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:38:55,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:38:55,576 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,587 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-04 21:38:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:55,721 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-04 21:38:55,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:55,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:38:55,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:55,745 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-04 21:38:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:55,809 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-04 21:38:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:55,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:38:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:55,822 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:55,822 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:38:55,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:38:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:38:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:38:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:38:55,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:38:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:55,853 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:38:55,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:38:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:55,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:55,855 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-08-04 21:38:55,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:56,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:56,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:56,075 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:38:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,203 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:38:56,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:56,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:38:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,205 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:38:56,205 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:38:56,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:38:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:38:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:38:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:38:56,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:38:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,209 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:38:56,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:38:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:56,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,210 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:38:56,211 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-08-04 21:38:56,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:56,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:56,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:56,489 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:38:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,609 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:38:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:56,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:38:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,611 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:56,611 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:56,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:38:56,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:38:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,614 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:38:56,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:38:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:56,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,615 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:38:56,616 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2019-08-04 21:38:56,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,759 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-04 21:38:56,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:56,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:56,762 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:38:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,814 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:38:56,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:56,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:38:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,817 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:38:56,817 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:38:56,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:38:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:38:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:38:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:38:56,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:38:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,820 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:38:56,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:38:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:56,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,833 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:38:56,833 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2019-08-04 21:38:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:57,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:57,103 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:38:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,296 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:38:57,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:57,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:38:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,299 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:57,299 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:57,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:38:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:38:57,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:38:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,302 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:38:57,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:38:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:57,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,303 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:38:57,304 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2019-08-04 21:38:57,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:57,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:57,454 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:38:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,588 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:38:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:57,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:38:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,590 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:57,590 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:38:57,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:38:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:38:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:38:57,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:38:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,598 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:38:57,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:38:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:57,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,599 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:38:57,599 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2019-08-04 21:38:57,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:57,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:57,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:57,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:57,804 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:38:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,915 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:38:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:57,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:38:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,917 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:38:57,917 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:38:57,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:38:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:38:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:38:57,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:38:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,920 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:38:57,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:38:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:57,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,921 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:38:57,922 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2019-08-04 21:38:57,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:58,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:58,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:58,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:58,390 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:38:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,524 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:38:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:58,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:38:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,528 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:38:58,528 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:38:58,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:38:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:38:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:38:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:38:58,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:38:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,531 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:38:58,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:38:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:38:58,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,532 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:38:58,532 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2019-08-04 21:38:58,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:58,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:38:58,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-04 21:38:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:58,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:58,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:58,676 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-04 21:38:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,871 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:38:58,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:58,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-04 21:38:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,873 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:38:58,873 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:38:58,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:38:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2019-08-04 21:38:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:38:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-04 21:38:58,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-08-04 21:38:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,879 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-04 21:38:58,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-04 21:38:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:58,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,880 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:38:58,881 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2019-08-04 21:38:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:58,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:38:58,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:59,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:38:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:38:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:59,111 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2019-08-04 21:38:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:59,327 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-08-04 21:38:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:59,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:38:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:59,331 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:38:59,331 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:38:59,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:38:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:38:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:38:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-08-04 21:38:59,336 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2019-08-04 21:38:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:59,336 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-08-04 21:38:59,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:38:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-08-04 21:38:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:38:59,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:59,337 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:38:59,338 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2019-08-04 21:38:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:38:59,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:38:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:38:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:59,612 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2019-08-04 21:38:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:59,792 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-04 21:38:59,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:38:59,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:38:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:59,794 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:38:59,794 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:38:59,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:38:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:38:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:38:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-08-04 21:38:59,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2019-08-04 21:38:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:59,799 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-08-04 21:38:59,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:38:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-08-04 21:38:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:59,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:59,800 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:38:59,800 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2019-08-04 21:38:59,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:00,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:00,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:39:00,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:39:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:39:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:39:00,094 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2019-08-04 21:39:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:00,287 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-04 21:39:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:39:00,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:39:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:00,289 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:39:00,289 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:39:00,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:39:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:39:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:39:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:39:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-08-04 21:39:00,294 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2019-08-04 21:39:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:00,294 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-08-04 21:39:00,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:39:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2019-08-04 21:39:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:39:00,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:00,295 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:39:00,295 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2019-08-04 21:39:00,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:00,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:39:00,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:00,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:00,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:39:00,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:39:00,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:39:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:39:00,555 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2019-08-04 21:39:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,040 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-08-04 21:39:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:39:01,041 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:39:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,042 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:39:01,042 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:39:01,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:39:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:39:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:39:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:39:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-08-04 21:39:01,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2019-08-04 21:39:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,050 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-08-04 21:39:01,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:39:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-08-04 21:39:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:39:01,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,054 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:39:01,055 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2019-08-04 21:39:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:39:01,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:39:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:39:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:39:01,430 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2019-08-04 21:39:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,677 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-08-04 21:39:01,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:39:01,679 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:39:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,680 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:39:01,681 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:39:01,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:39:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:39:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:39:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:39:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-04 21:39:01,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2019-08-04 21:39:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,685 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-04 21:39:01,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:39:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-04 21:39:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:39:01,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,686 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:39:01,686 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,687 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2019-08-04 21:39:01,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:02,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:02,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:39:02,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:39:02,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:39:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:39:02,129 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2019-08-04 21:39:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:02,432 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-08-04 21:39:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:39:02,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:39:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:02,434 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:39:02,434 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:39:02,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:39:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:39:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:39:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:39:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-08-04 21:39:02,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-08-04 21:39:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:02,437 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-08-04 21:39:02,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:39:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-08-04 21:39:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:39:02,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:02,438 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:39:02,439 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2019-08-04 21:39:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:02,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:39:02,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:03,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:03,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:39:03,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:39:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:39:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:39:03,172 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2019-08-04 21:39:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:03,581 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-08-04 21:39:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:39:03,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:39:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:03,583 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:39:03,583 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:39:03,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:39:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:39:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:39:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:39:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-04 21:39:03,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2019-08-04 21:39:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:03,589 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-04 21:39:03,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:39:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-04 21:39:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:39:03,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:03,590 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:39:03,591 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:03,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2019-08-04 21:39:03,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:03,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:39:03,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:39:04,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:39:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:39:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:39:04,037 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2019-08-04 21:39:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,442 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-08-04 21:39:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:39:04,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:39:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,444 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:39:04,444 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:39:04,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:39:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:39:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:39:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:39:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-08-04 21:39:04,448 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2019-08-04 21:39:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,448 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-08-04 21:39:04,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:39:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-08-04 21:39:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:39:04,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,449 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:39:04,449 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2019-08-04 21:39:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:04,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:39:04,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:39:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:39:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:39:04,988 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2019-08-04 21:39:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:05,480 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-08-04 21:39:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:39:05,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:39:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:05,482 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:39:05,482 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:39:05,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:39:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:39:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:39:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:39:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-08-04 21:39:05,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2019-08-04 21:39:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:05,487 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-08-04 21:39:05,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:39:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-08-04 21:39:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:39:05,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:05,488 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:39:05,488 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 18 times [2019-08-04 21:39:05,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:05,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:39:05,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:05,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:05,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:39:05,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:39:05,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:39:05,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:39:05,858 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 22 states. [2019-08-04 21:39:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:06,369 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-08-04 21:39:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:39:06,370 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:39:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:06,370 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:39:06,371 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:39:06,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:39:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:39:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:39:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:39:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-08-04 21:39:06,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 22 [2019-08-04 21:39:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:06,375 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-08-04 21:39:06,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:39:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-08-04 21:39:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:39:06,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:06,376 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:39:06,376 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 19 times [2019-08-04 21:39:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:06,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:39:06,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:06,893 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-04 21:39:06,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:06,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:39:06,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:39:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:39:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:39:06,894 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 23 states. [2019-08-04 21:39:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:07,588 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-08-04 21:39:07,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:39:07,589 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:39:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:07,590 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:39:07,590 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:39:07,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:39:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:39:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:39:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:39:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-08-04 21:39:07,594 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2019-08-04 21:39:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:07,594 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-08-04 21:39:07,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:39:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-08-04 21:39:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:39:07,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:07,595 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:39:07,595 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 20 times [2019-08-04 21:39:07,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:07,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:39:07,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:08,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:08,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:39:08,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:39:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:39:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:39:08,114 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 24 states. [2019-08-04 21:39:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:08,746 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-08-04 21:39:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:39:08,747 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:39:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:08,747 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:39:08,748 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:39:08,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:39:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:39:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:39:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:39:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-08-04 21:39:08,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2019-08-04 21:39:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:08,751 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-08-04 21:39:08,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:39:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-08-04 21:39:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:39:08,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:08,752 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:39:08,753 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 21 times [2019-08-04 21:39:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:08,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:39:08,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:09,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:39:09,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:39:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:39:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:39:09,244 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 25 states. [2019-08-04 21:39:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:09,905 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-08-04 21:39:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:39:09,910 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:39:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:09,911 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:39:09,911 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:39:09,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:39:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:39:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:39:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:39:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-08-04 21:39:09,914 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2019-08-04 21:39:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:09,915 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-08-04 21:39:09,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:39:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-08-04 21:39:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:39:09,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:09,916 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:39:09,916 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 22 times [2019-08-04 21:39:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:09,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:39:09,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:10,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:39:10,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:39:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:39:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:39:10,634 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 26 states. [2019-08-04 21:39:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:11,707 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-08-04 21:39:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:39:11,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:39:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:11,709 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:39:11,709 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:39:11,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:39:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:39:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:39:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:39:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-08-04 21:39:11,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2019-08-04 21:39:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:11,712 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-08-04 21:39:11,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:39:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-08-04 21:39:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:39:11,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:11,713 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:39:11,713 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 23 times [2019-08-04 21:39:11,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:11,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:39:11,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:12,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:12,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:39:12,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:39:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:39:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:39:12,548 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2019-08-04 21:39:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:13,432 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-08-04 21:39:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:39:13,433 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:39:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:13,433 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:39:13,433 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:39:13,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:39:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:39:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:39:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:39:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-08-04 21:39:13,437 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2019-08-04 21:39:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:13,438 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-08-04 21:39:13,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:39:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-08-04 21:39:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:39:13,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:13,439 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:39:13,439 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 24 times [2019-08-04 21:39:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:13,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:39:13,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:14,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:14,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:39:14,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:39:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:39:14,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:39:14,300 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 29 states. [2019-08-04 21:39:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:15,121 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-08-04 21:39:15,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:39:15,121 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:39:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:15,122 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:39:15,123 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:39:15,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:39:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:39:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:39:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:39:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-08-04 21:39:15,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 29 [2019-08-04 21:39:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:15,126 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-08-04 21:39:15,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:39:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-08-04 21:39:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:39:15,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:15,127 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:39:15,127 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 25 times [2019-08-04 21:39:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:15,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:39:15,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:15,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:15,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:39:15,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:39:15,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:39:15,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:39:15,767 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 30 states. [2019-08-04 21:39:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:16,614 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-08-04 21:39:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:39:16,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:39:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:16,616 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:39:16,616 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:39:16,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:39:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:39:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:39:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:39:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-04 21:39:16,619 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 30 [2019-08-04 21:39:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:16,619 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-04 21:39:16,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:39:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-04 21:39:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:39:16,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:16,621 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:39:16,621 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 26 times [2019-08-04 21:39:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:16,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:39:16,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:17,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:17,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:39:17,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:39:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:39:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:39:17,524 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 31 states. [2019-08-04 21:39:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:18,489 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-08-04 21:39:18,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:39:18,490 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:39:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:18,491 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:39:18,491 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:39:18,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:39:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:39:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:39:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:39:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-08-04 21:39:18,496 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 31 [2019-08-04 21:39:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:18,497 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-08-04 21:39:18,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:39:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-08-04 21:39:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:39:18,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:18,498 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:39:18,498 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 27 times [2019-08-04 21:39:18,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:18,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:39:18,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:19,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:19,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:39:19,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:39:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:39:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:39:19,283 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 32 states. [2019-08-04 21:39:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:20,276 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-08-04 21:39:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:39:20,277 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:39:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:20,278 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:39:20,278 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:39:20,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:39:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:39:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:39:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:39:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-04 21:39:20,281 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2019-08-04 21:39:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:20,281 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-04 21:39:20,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:39:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-04 21:39:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:39:20,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,282 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:39:20,282 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 28 times [2019-08-04 21:39:20,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:21,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:21,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:39:21,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:39:21,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:39:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:39:21,433 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 33 states. [2019-08-04 21:39:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:22,546 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-08-04 21:39:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:39:22,547 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:39:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:22,548 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:39:22,548 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:39:22,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:39:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:39:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:39:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:39:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-08-04 21:39:22,550 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 33 [2019-08-04 21:39:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:22,551 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-08-04 21:39:22,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:39:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-08-04 21:39:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:39:22,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:22,551 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:39:22,551 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:22,552 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 29 times [2019-08-04 21:39:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:22,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:39:22,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:24,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:39:24,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:39:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:39:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:39:24,184 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2019-08-04 21:39:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:25,331 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-08-04 21:39:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:39:25,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:39:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:25,332 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:39:25,332 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:39:25,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:39:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:39:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:39:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:39:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-08-04 21:39:25,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2019-08-04 21:39:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:25,336 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-08-04 21:39:25,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:39:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-08-04 21:39:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:39:25,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:25,337 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:39:25,337 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 30 times [2019-08-04 21:39:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:25,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:39:25,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:26,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:26,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:39:26,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:39:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:39:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:39:26,195 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 36 states. [2019-08-04 21:39:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:27,435 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-08-04 21:39:27,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:39:27,436 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:39:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:27,437 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:39:27,437 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:39:27,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:39:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:39:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:39:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:39:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-08-04 21:39:27,440 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2019-08-04 21:39:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:27,441 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-08-04 21:39:27,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:39:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-08-04 21:39:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:39:27,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:27,442 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:39:27,442 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 31 times [2019-08-04 21:39:27,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:27,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:39:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:28,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:28,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:39:28,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:39:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:39:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:39:28,484 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 37 states. [2019-08-04 21:39:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:29,853 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-08-04 21:39:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:39:29,854 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:39:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:29,855 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:39:29,855 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:39:29,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:39:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:39:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:39:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:39:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-08-04 21:39:29,859 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 37 [2019-08-04 21:39:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:29,859 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-08-04 21:39:29,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:39:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-08-04 21:39:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:39:29,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:29,862 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:39:29,862 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 32 times [2019-08-04 21:39:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:29,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:39:29,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:30,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:30,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:39:30,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:39:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:39:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:39:30,993 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 38 states. [2019-08-04 21:39:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:32,415 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-08-04 21:39:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:39:32,415 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:39:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:32,416 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:39:32,416 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:39:32,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:39:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:39:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:39:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:39:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-08-04 21:39:32,420 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 38 [2019-08-04 21:39:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:32,420 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-08-04 21:39:32,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:39:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-08-04 21:39:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:39:32,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:32,421 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:39:32,421 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 33 times [2019-08-04 21:39:32,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:32,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:39:32,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:33,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:39:33,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:39:33,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:39:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:39:33,942 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 39 states. [2019-08-04 21:39:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:35,396 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-08-04 21:39:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:39:35,396 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:39:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:35,397 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:39:35,397 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:39:35,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:39:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:39:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:39:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:39:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-08-04 21:39:35,400 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 39 [2019-08-04 21:39:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:35,400 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-08-04 21:39:35,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:39:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-08-04 21:39:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:39:35,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:35,401 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:39:35,401 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:35,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 34 times [2019-08-04 21:39:35,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:35,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:39:35,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:36,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:36,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:39:36,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:39:36,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:39:36,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:39:36,468 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 40 states. [2019-08-04 21:39:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:38,055 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-08-04 21:39:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:39:38,055 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:39:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:38,056 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:39:38,056 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:39:38,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:39:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:39:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:39:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:39:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-08-04 21:39:38,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 40 [2019-08-04 21:39:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:38,061 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-08-04 21:39:38,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:39:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-08-04 21:39:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:39:38,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:38,061 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:39:38,062 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:38,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 35 times [2019-08-04 21:39:38,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:38,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:39:38,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:40,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:40,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:39:40,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:39:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:39:40,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:39:40,414 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 41 states. [2019-08-04 21:39:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:42,023 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-08-04 21:39:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:39:42,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:39:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:42,024 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:39:42,024 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:39:42,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:39:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:39:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:39:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:39:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-08-04 21:39:42,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 41 [2019-08-04 21:39:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:42,028 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-08-04 21:39:42,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:39:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-08-04 21:39:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:39:42,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:42,028 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:39:42,029 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 36 times [2019-08-04 21:39:42,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:42,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:39:42,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:43,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:43,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:39:43,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:39:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:39:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:39:43,437 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 42 states. [2019-08-04 21:39:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:45,137 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-08-04 21:39:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:39:45,138 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:39:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:45,138 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:39:45,138 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:39:45,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:39:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:39:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:39:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:39:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-08-04 21:39:45,142 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 42 [2019-08-04 21:39:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:45,142 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-08-04 21:39:45,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:39:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-08-04 21:39:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:39:45,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:45,143 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:39:45,144 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 37 times [2019-08-04 21:39:45,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:45,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:39:45,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:46,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:46,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:39:46,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:39:46,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:39:46,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:39:46,418 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 44 states. [2019-08-04 21:39:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:48,397 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-08-04 21:39:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:39:48,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:39:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:48,398 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:39:48,398 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:39:48,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:39:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:39:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:39:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:39:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-08-04 21:39:48,402 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 44 [2019-08-04 21:39:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:48,402 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-08-04 21:39:48,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:39:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-08-04 21:39:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:39:48,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:48,403 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:39:48,403 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 38 times [2019-08-04 21:39:48,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:48,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:39:48,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:49,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:49,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:39:49,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:39:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:39:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:49,736 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 45 states. [2019-08-04 21:39:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:51,739 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-08-04 21:39:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:39:51,740 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:39:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:51,741 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:39:51,741 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:39:51,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:39:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:39:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:39:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-08-04 21:39:51,745 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 45 [2019-08-04 21:39:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:51,745 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-08-04 21:39:51,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:39:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-08-04 21:39:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:39:51,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:51,746 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:39:51,746 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:51,746 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 39 times [2019-08-04 21:39:51,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:51,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:39:51,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:53,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:53,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:39:53,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:39:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:39:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:53,244 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 46 states. [2019-08-04 21:39:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:55,320 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-08-04 21:39:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:39:55,321 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:39:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:55,322 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:39:55,322 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:39:55,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:39:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:39:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:39:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-08-04 21:39:55,325 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 46 [2019-08-04 21:39:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:55,325 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-08-04 21:39:55,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:39:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-08-04 21:39:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:39:55,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:55,326 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:39:55,326 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 40 times [2019-08-04 21:39:55,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:55,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:39:55,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:56,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:39:56,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:39:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:39:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:56,786 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 47 states. [2019-08-04 21:39:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:58,987 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-08-04 21:39:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:39:58,988 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:39:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:58,989 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:39:58,989 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:39:58,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:39:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:39:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:39:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-08-04 21:39:58,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 47 [2019-08-04 21:39:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:58,993 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-08-04 21:39:58,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:39:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-08-04 21:39:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:39:58,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:58,994 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:39:58,994 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 41 times [2019-08-04 21:39:58,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:59,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:39:59,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:00,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:40:00,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:40:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:40:00,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:40:00,497 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 48 states. [2019-08-04 21:40:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:02,760 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-08-04 21:40:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:40:02,760 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:40:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:02,761 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:40:02,761 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:40:02,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:40:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:40:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:40:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:40:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-08-04 21:40:02,765 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 48 [2019-08-04 21:40:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:02,765 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-08-04 21:40:02,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:40:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-08-04 21:40:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:40:02,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:02,766 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:40:02,766 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 42 times [2019-08-04 21:40:02,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:02,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:40:02,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:04,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:04,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:40:04,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:40:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:40:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:40:04,622 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 49 states. [2019-08-04 21:40:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:07,029 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-08-04 21:40:07,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:40:07,030 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:40:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:07,031 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:40:07,031 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:40:07,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:40:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:40:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:40:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:40:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-08-04 21:40:07,034 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 49 [2019-08-04 21:40:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:07,034 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-08-04 21:40:07,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:40:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-08-04 21:40:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:40:07,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:07,035 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:40:07,035 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:07,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 43 times [2019-08-04 21:40:07,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:07,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:40:07,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:08,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:40:08,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:40:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:40:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:40:08,947 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 50 states. [2019-08-04 21:40:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:11,391 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-08-04 21:40:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:40:11,391 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:40:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:11,392 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:40:11,392 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:40:11,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:40:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:40:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:40:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:40:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-08-04 21:40:11,395 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 50 [2019-08-04 21:40:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:11,396 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-08-04 21:40:11,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:40:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-08-04 21:40:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:40:11,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:11,397 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:40:11,397 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:11,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 44 times [2019-08-04 21:40:11,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:11,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:40:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:13,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:13,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:40:13,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:40:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:40:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:40:13,140 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 52 states. [2019-08-04 21:40:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:15,875 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-08-04 21:40:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:40:15,876 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:40:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:15,877 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:40:15,877 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:40:15,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:40:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:40:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:40:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:40:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-08-04 21:40:15,880 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 52 [2019-08-04 21:40:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:15,880 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-08-04 21:40:15,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:40:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-08-04 21:40:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:40:15,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:15,881 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:40:15,881 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 45 times [2019-08-04 21:40:15,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:15,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:40:15,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:18,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:18,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:40:18,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:40:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:40:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:40:18,055 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 53 states. [2019-08-04 21:40:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:20,930 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-08-04 21:40:20,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:40:20,930 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:40:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:20,931 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:40:20,931 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:40:20,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:40:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:40:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:40:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:40:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-08-04 21:40:20,934 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 53 [2019-08-04 21:40:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:20,934 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-08-04 21:40:20,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:40:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-08-04 21:40:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:40:20,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:20,935 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:40:20,935 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 46 times [2019-08-04 21:40:20,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:40:20,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:40:22,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:40:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:40:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:40:22,964 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 54 states. [2019-08-04 21:40:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:25,969 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2019-08-04 21:40:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:40:25,970 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:40:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:25,971 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:40:25,971 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:40:25,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:40:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:40:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:40:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:40:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-08-04 21:40:25,974 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 54 [2019-08-04 21:40:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:25,974 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-08-04 21:40:25,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:40:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-08-04 21:40:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:40:25,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:25,975 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:40:25,975 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 47 times [2019-08-04 21:40:25,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:26,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:40:26,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:40:27,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:40:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:40:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:40:27,945 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 55 states. [2019-08-04 21:40:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:30,945 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-08-04 21:40:30,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:40:30,946 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:40:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:30,947 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:40:30,947 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:40:30,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:40:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:40:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:40:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:40:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-08-04 21:40:30,951 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 55 [2019-08-04 21:40:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:30,951 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-08-04 21:40:30,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:40:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-08-04 21:40:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:40:30,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:30,952 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:40:30,952 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 48 times [2019-08-04 21:40:30,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:30,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:40:30,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:33,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:40:33,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:40:33,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:40:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:40:33,274 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 56 states. [2019-08-04 21:40:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:36,455 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-08-04 21:40:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:40:36,456 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:40:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:36,456 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:40:36,456 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:40:36,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:40:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:40:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:40:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:40:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-08-04 21:40:36,460 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 56 [2019-08-04 21:40:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:36,460 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-08-04 21:40:36,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:40:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-08-04 21:40:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:40:36,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:36,461 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:40:36,461 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 49 times [2019-08-04 21:40:36,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:36,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:40:36,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:38,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:40:38,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:40:38,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:40:38,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:40:38,558 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 57 states. [2019-08-04 21:40:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:41,879 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-08-04 21:40:41,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:40:41,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:40:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:41,880 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:40:41,880 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:40:41,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:40:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:40:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:40:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:40:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-08-04 21:40:41,884 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 57 [2019-08-04 21:40:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:41,885 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-08-04 21:40:41,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:40:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-08-04 21:40:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:40:41,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:41,885 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:40:41,886 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 50 times [2019-08-04 21:40:41,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:41,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:40:41,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:44,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:44,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:40:44,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:40:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:40:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:40:44,136 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 58 states. [2019-08-04 21:40:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:47,532 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-08-04 21:40:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:40:47,532 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:40:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:47,534 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:40:47,534 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:40:47,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:40:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:40:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:40:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:40:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-08-04 21:40:47,537 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 58 [2019-08-04 21:40:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:47,537 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-08-04 21:40:47,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:40:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-08-04 21:40:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:40:47,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:47,538 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:40:47,538 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 51 times [2019-08-04 21:40:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:47,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:40:47,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:50,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:50,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:40:50,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:40:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:40:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:40:50,211 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 60 states. [2019-08-04 21:40:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:53,801 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-08-04 21:40:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:40:53,802 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:40:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:53,803 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:40:53,803 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:40:53,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:40:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:40:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:40:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:40:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-08-04 21:40:53,806 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 60 [2019-08-04 21:40:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:53,807 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-08-04 21:40:53,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:40:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-08-04 21:40:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:40:53,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:53,807 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:40:53,808 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 52 times [2019-08-04 21:40:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:53,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:40:53,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:56,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:56,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:40:56,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:40:56,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:40:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:40:56,341 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 61 states. [2019-08-04 21:41:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:00,141 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-08-04 21:41:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:41:00,146 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:41:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:00,147 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:41:00,147 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:41:00,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:41:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:41:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:41:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:41:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-08-04 21:41:00,149 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 61 [2019-08-04 21:41:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:00,149 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-08-04 21:41:00,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:41:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-08-04 21:41:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:41:00,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:00,149 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:41:00,150 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 53 times [2019-08-04 21:41:00,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:00,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-04 21:41:00,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:02,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:02,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:41:02,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:41:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:41:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:41:02,698 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 62 states. [2019-08-04 21:41:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:06,562 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-08-04 21:41:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:41:06,563 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:41:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:06,564 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:41:06,564 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:41:06,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:41:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:41:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:41:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:41:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-08-04 21:41:06,567 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 62 [2019-08-04 21:41:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:06,567 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-08-04 21:41:06,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:41:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-08-04 21:41:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:41:06,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:06,568 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:41:06,568 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 54 times [2019-08-04 21:41:06,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:06,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:41:06,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:09,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:09,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:41:09,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:41:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:41:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:41:09,136 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 63 states. [2019-08-04 21:41:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:13,174 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-08-04 21:41:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:41:13,174 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:41:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:13,175 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:41:13,176 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:41:13,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:41:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:41:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:41:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:41:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-08-04 21:41:13,178 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 63 [2019-08-04 21:41:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:13,179 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-08-04 21:41:13,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:41:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-08-04 21:41:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:41:13,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:13,179 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:41:13,180 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 55 times [2019-08-04 21:41:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:13,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-04 21:41:13,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:16,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:16,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:41:16,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:41:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:41:16,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:41:16,047 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 64 states. [2019-08-04 21:41:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:20,235 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-08-04 21:41:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:41:20,236 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:41:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:20,236 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:41:20,236 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:41:20,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:41:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:41:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:41:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:41:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-08-04 21:41:20,240 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 64 [2019-08-04 21:41:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:20,240 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-08-04 21:41:20,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:41:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-08-04 21:41:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:41:20,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:20,241 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:41:20,241 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 56 times [2019-08-04 21:41:20,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:20,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-04 21:41:20,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:23,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:23,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:41:23,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:41:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:41:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:41:23,175 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 65 states. [2019-08-04 21:41:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:27,459 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-08-04 21:41:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:41:27,460 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:41:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:27,461 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:41:27,461 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:41:27,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:41:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:41:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:41:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:41:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-08-04 21:41:27,464 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 65 [2019-08-04 21:41:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:27,464 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-08-04 21:41:27,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:41:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-08-04 21:41:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:41:27,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:27,465 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:41:27,465 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 57 times [2019-08-04 21:41:27,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:27,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-04 21:41:27,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:30,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:30,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:41:30,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:41:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:41:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:41:30,317 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 66 states. [2019-08-04 21:41:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:34,784 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-04 21:41:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:41:34,785 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:41:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:34,785 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:41:34,786 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:41:34,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:41:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:41:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:41:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:41:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-08-04 21:41:34,789 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-08-04 21:41:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:34,789 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-08-04 21:41:34,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:41:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-08-04 21:41:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:41:34,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:34,790 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:41:34,790 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 58 times [2019-08-04 21:41:34,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:34,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-04 21:41:34,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:38,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:38,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:41:38,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:41:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:41:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:41:38,272 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 68 states. [2019-08-04 21:41:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:43,021 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-08-04 21:41:43,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:41:43,021 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:41:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:43,022 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:41:43,022 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:41:43,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:41:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:41:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:41:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:41:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2019-08-04 21:41:43,026 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 68 [2019-08-04 21:41:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:43,026 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2019-08-04 21:41:43,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:41:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2019-08-04 21:41:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:41:43,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:43,027 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:41:43,027 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:43,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 59 times [2019-08-04 21:41:43,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:43,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:41:43,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:41:46,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:41:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:41:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:41:46,288 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 69 states. [2019-08-04 21:41:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:51,134 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-08-04 21:41:51,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:41:51,135 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:41:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:51,135 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:41:51,136 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:41:51,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:41:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:41:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:41:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:41:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-08-04 21:41:51,139 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 69 [2019-08-04 21:41:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:51,139 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-08-04 21:41:51,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:41:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-08-04 21:41:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:41:51,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:51,140 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:41:51,140 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 60 times [2019-08-04 21:41:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:51,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-04 21:41:51,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:54,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:54,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:41:54,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:41:54,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:41:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:41:54,559 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 70 states. [2019-08-04 21:41:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:59,489 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-08-04 21:41:59,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:41:59,490 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:41:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:59,491 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:41:59,491 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:41:59,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:41:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:41:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:41:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:41:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-08-04 21:41:59,495 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 70 [2019-08-04 21:41:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:59,495 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-08-04 21:41:59,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:41:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-08-04 21:41:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:41:59,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:59,496 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:41:59,496 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 61 times [2019-08-04 21:41:59,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:59,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-04 21:41:59,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:03,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:03,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:42:03,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:42:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:42:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:42:03,010 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 71 states. [2019-08-04 21:42:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:08,222 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-08-04 21:42:08,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:42:08,222 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:42:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:08,223 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:42:08,223 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:42:08,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:42:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:42:08,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:42:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:42:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2019-08-04 21:42:08,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 71 [2019-08-04 21:42:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:08,227 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2019-08-04 21:42:08,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:42:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2019-08-04 21:42:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:42:08,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:08,228 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:42:08,228 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:08,228 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 62 times [2019-08-04 21:42:08,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:08,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-04 21:42:08,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:42:12,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:42:12,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:42:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:42:12,030 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 72 states. [2019-08-04 21:42:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:17,628 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-08-04 21:42:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:42:17,629 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:42:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:17,630 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:42:17,630 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:42:17,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:42:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:42:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:42:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:42:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-08-04 21:42:17,633 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 72 [2019-08-04 21:42:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:17,633 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-08-04 21:42:17,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:42:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-08-04 21:42:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:42:17,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:17,634 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:42:17,635 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 63 times [2019-08-04 21:42:17,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:17,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-04 21:42:17,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:21,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:21,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:42:21,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:42:21,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:42:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:42:21,054 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 73 states. [2019-08-04 21:42:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:26,426 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-08-04 21:42:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:42:26,426 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:42:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:26,427 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:42:26,427 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:42:26,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:42:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:42:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:42:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:42:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-08-04 21:42:26,430 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2019-08-04 21:42:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:26,431 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-08-04 21:42:26,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:42:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-08-04 21:42:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:42:26,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:26,432 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:42:26,432 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 64 times [2019-08-04 21:42:26,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:26,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-04 21:42:26,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:30,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:42:30,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:42:30,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:42:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:42:30,308 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 74 states. [2019-08-04 21:42:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:35,861 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-08-04 21:42:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:42:35,861 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:42:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:35,862 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:42:35,862 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:42:35,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:42:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:42:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:42:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:42:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-08-04 21:42:35,865 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 74 [2019-08-04 21:42:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:35,865 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-08-04 21:42:35,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:42:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-08-04 21:42:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:42:35,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:35,866 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:42:35,866 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 65 times [2019-08-04 21:42:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:35,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-04 21:42:35,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:39,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:42:39,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:42:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:42:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:42:39,766 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 76 states. [2019-08-04 21:42:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:45,704 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-08-04 21:42:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:42:45,704 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:42:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:45,705 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:42:45,706 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:42:45,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:42:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:42:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:42:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:42:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-08-04 21:42:45,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 76 [2019-08-04 21:42:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:45,709 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-08-04 21:42:45,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:42:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-08-04 21:42:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:42:45,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:45,709 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:42:45,710 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 66 times [2019-08-04 21:42:45,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:45,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-04 21:42:45,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:50,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:50,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:42:50,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:42:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:42:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:42:50,400 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 77 states. [2019-08-04 21:42:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:56,424 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-08-04 21:42:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:42:56,425 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:42:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:56,426 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:42:56,426 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:42:56,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:42:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:42:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:42:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:42:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2019-08-04 21:42:56,429 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 77 [2019-08-04 21:42:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:56,429 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2019-08-04 21:42:56,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:42:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2019-08-04 21:42:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:42:56,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:56,430 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:42:56,430 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 67 times [2019-08-04 21:42:56,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:56,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-04 21:42:56,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:00,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:00,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:43:00,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:43:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:43:00,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:43:00,547 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 78 states. [2019-08-04 21:43:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:43:06,666 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-08-04 21:43:06,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:43:06,667 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:43:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:43:06,668 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:43:06,668 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:43:06,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:43:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:43:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:43:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:43:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-08-04 21:43:06,671 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 78 [2019-08-04 21:43:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:43:06,671 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-08-04 21:43:06,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:43:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-08-04 21:43:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:43:06,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:43:06,672 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:43:06,672 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:43:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:43:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 68 times [2019-08-04 21:43:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:43:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:43:06,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-04 21:43:06,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:43:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:43:11,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:43:11,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:43:11,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:43:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:43:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:43:11,057 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 79 states. Received shutdown request... [2019-08-04 21:43:16,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:43:16,518 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:43:16,525 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:43:16,525 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:43:16 BoogieIcfgContainer [2019-08-04 21:43:16,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:43:16,527 INFO L168 Benchmark]: Toolchain (without parser) took 261440.43 ms. Allocated memory was 135.3 MB in the beginning and 149.9 MB in the end (delta: 14.7 MB). Free memory was 112.8 MB in the beginning and 71.1 MB in the end (delta: 41.7 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:16,528 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory was 114.1 MB in the beginning and 113.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:43:16,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.94 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 110.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:16,529 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 135.3 MB. Free memory was 110.9 MB in the beginning and 109.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:16,530 INFO L168 Benchmark]: RCFGBuilder took 315.69 ms. Allocated memory is still 135.3 MB. Free memory was 109.7 MB in the beginning and 101.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:16,531 INFO L168 Benchmark]: TraceAbstraction took 261048.25 ms. Allocated memory was 135.3 MB in the beginning and 149.9 MB in the end (delta: 14.7 MB). Free memory was 101.3 MB in the beginning and 71.1 MB in the end (delta: 30.2 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:43:16,533 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 114.1 MB in the beginning and 113.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.94 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 110.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 135.3 MB. Free memory was 110.9 MB in the beginning and 109.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 315.69 ms. Allocated memory is still 135.3 MB. Free memory was 109.7 MB in the beginning and 101.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261048.25 ms. Allocated memory was 135.3 MB in the beginning and 149.9 MB in the end (delta: 14.7 MB). Free memory was 101.3 MB in the beginning and 71.1 MB in the end (delta: 30.2 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (87states) and FLOYD_HOARE automaton (currently 66 states, 79 states before enhancement),while ReachableStatesComputation was computing reachable states (64 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 260.9s OverallTime, 69 OverallIterations, 76 TraceHistogramMax, 149.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 SDtfs, 83 SDslu, 2549 SDs, 0 SdLazy, 140360 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 125.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2712 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 68 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 108.7s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2712 ConstructedInterpolants, 0 QuantifiedInterpolants, 969686 SizeOfPredicates, 67 NumberOfNonLiveVariables, 10917 ConjunctsInSsa, 5355 ConjunctsInUnsatCore, 69 InterpolantComputations, 1 PerfectInterpolantSequences, 1/66812 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown