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/random/RanFile062.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:03:45,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:03:45,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:03:45,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:03:45,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:03:45,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:03:45,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:03:45,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:03:45,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:03:45,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:03:45,244 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:03:45,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:03:45,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:03:45,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:03:45,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:03:45,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:03:45,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:03:45,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:03:45,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:03:45,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:03:45,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:03:45,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:03:45,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:03:45,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:03:45,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:03:45,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:03:45,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:03:45,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:03:45,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:03:45,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:03:45,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:03:45,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:03:45,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:03:45,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:03:45,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:03:45,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:03:45,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:03:45,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:03:45,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:03:45,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:03:45,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:03:45,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:03:45,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:03:45,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:03:45,359 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:03:45,359 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:03:45,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile062.bpl [2019-08-05 10:03:45,361 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile062.bpl' [2019-08-05 10:03:45,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:03:45,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:03:45,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:45,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:03:45,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:03:45,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,475 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:03:45,475 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:03:45,475 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:03:45,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:45,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:03:45,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:03:45,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:03:45,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... [2019-08-05 10:03:45,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:03:45,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:03:45,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:03:45,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:03:45,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:03:45,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:03:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:03:45,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:03:48,065 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:03:48,066 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:03:48,067 INFO L202 PluginConnector]: Adding new model RanFile062.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:48 BoogieIcfgContainer [2019-08-05 10:03:48,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:03:48,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:03:48,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:03:48,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:03:48,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:45" (1/2) ... [2019-08-05 10:03:48,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3095cdf and model type RanFile062.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:03:48, skipping insertion in model container [2019-08-05 10:03:48,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile062.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:48" (2/2) ... [2019-08-05 10:03:48,077 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile062.bpl [2019-08-05 10:03:48,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:03:48,096 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:03:48,115 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:03:48,142 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:03:48,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:03:48,143 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:03:48,144 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:03:48,144 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:03:48,144 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:03:48,146 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:03:48,146 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:03:48,147 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:03:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2019-08-05 10:03:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:03:48,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:48,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:48,200 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2010636052, now seen corresponding path program 1 times [2019-08-05 10:03:48,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:48,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2019-08-05 10:03:48,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:48,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:48,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:03:48,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-08-05 10:03:48,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-08-05 10:03:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 10:03:48,366 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2019-08-05 10:03:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:48,387 INFO L93 Difference]: Finished difference Result 66 states and 117 transitions. [2019-08-05 10:03:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 10:03:48,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-08-05 10:03:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:48,403 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:03:48,403 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:03:48,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 10:03:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:03:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:03:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:03:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 112 transitions. [2019-08-05 10:03:48,465 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 112 transitions. Word has length 20 [2019-08-05 10:03:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:48,466 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 112 transitions. [2019-08-05 10:03:48,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-08-05 10:03:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 112 transitions. [2019-08-05 10:03:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:03:48,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:48,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:48,469 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash -336640722, now seen corresponding path program 1 times [2019-08-05 10:03:48,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:48,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:03:48,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:48,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:48,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:48,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:49,024 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:03:49,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:49,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:49,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:03:49,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:49,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:49,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:49,120 INFO L87 Difference]: Start difference. First operand 63 states and 112 transitions. Second operand 8 states. [2019-08-05 10:03:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:50,994 INFO L93 Difference]: Finished difference Result 86 states and 153 transitions. [2019-08-05 10:03:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:50,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-08-05 10:03:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:50,997 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:03:50,998 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:03:50,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:03:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-08-05 10:03:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:03:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 140 transitions. [2019-08-05 10:03:51,011 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 140 transitions. Word has length 20 [2019-08-05 10:03:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:51,011 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 140 transitions. [2019-08-05 10:03:51,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 140 transitions. [2019-08-05 10:03:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:03:51,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:51,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:51,014 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -599612842, now seen corresponding path program 1 times [2019-08-05 10:03:51,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:51,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:03:51,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:51,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:51,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:03:51,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:03:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:03:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:51,129 INFO L87 Difference]: Start difference. First operand 79 states and 140 transitions. Second operand 5 states. [2019-08-05 10:03:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:51,793 INFO L93 Difference]: Finished difference Result 116 states and 210 transitions. [2019-08-05 10:03:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:03:51,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 10:03:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:51,797 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:03:51,798 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:03:51,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:03:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-08-05 10:03:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:03:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 174 transitions. [2019-08-05 10:03:51,810 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 174 transitions. Word has length 21 [2019-08-05 10:03:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 174 transitions. [2019-08-05 10:03:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:03:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 174 transitions. [2019-08-05 10:03:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:03:51,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:51,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:51,813 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash 150617923, now seen corresponding path program 1 times [2019-08-05 10:03:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:51,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:51,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:51,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:51,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:51,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:51,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:51,943 INFO L87 Difference]: Start difference. First operand 97 states and 174 transitions. Second operand 3 states. [2019-08-05 10:03:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:52,393 INFO L93 Difference]: Finished difference Result 149 states and 264 transitions. [2019-08-05 10:03:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:52,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:03:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:52,395 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:03:52,396 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:03:52,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:03:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2019-08-05 10:03:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:03:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 206 transitions. [2019-08-05 10:03:52,408 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 206 transitions. Word has length 21 [2019-08-05 10:03:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:52,408 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 206 transitions. [2019-08-05 10:03:52,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 206 transitions. [2019-08-05 10:03:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:03:52,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:52,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:52,411 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 589624015, now seen corresponding path program 1 times [2019-08-05 10:03:52,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:52,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:03:52,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:52,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:52,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:03:52,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:03:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:03:52,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:52,778 INFO L87 Difference]: Start difference. First operand 114 states and 206 transitions. Second operand 10 states. [2019-08-05 10:03:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:54,008 INFO L93 Difference]: Finished difference Result 139 states and 248 transitions. [2019-08-05 10:03:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:03:54,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-05 10:03:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:54,011 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:03:54,011 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:03:54,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:03:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2019-08-05 10:03:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:03:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 240 transitions. [2019-08-05 10:03:54,024 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 240 transitions. Word has length 21 [2019-08-05 10:03:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:54,024 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 240 transitions. [2019-08-05 10:03:54,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 240 transitions. [2019-08-05 10:03:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:03:54,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:54,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:54,027 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1897160810, now seen corresponding path program 1 times [2019-08-05 10:03:54,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:54,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:03:54,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:54,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:54,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:54,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:03:54,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:03:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:03:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:54,168 INFO L87 Difference]: Start difference. First operand 133 states and 240 transitions. Second operand 5 states. [2019-08-05 10:03:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:54,623 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2019-08-05 10:03:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:54,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-08-05 10:03:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:54,626 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:03:54,626 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:03:54,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:03:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2019-08-05 10:03:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:03:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 249 transitions. [2019-08-05 10:03:54,635 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 249 transitions. Word has length 22 [2019-08-05 10:03:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:54,635 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 249 transitions. [2019-08-05 10:03:54,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:03:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 249 transitions. [2019-08-05 10:03:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:03:54,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:54,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:54,638 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 541922441, now seen corresponding path program 1 times [2019-08-05 10:03:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:54,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:54,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:54,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:54,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:54,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:03:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:03:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:54,778 INFO L87 Difference]: Start difference. First operand 138 states and 249 transitions. Second operand 4 states. [2019-08-05 10:03:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:55,379 INFO L93 Difference]: Finished difference Result 176 states and 314 transitions. [2019-08-05 10:03:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:03:55,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-08-05 10:03:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:55,382 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:03:55,383 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:03:55,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:03:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 148. [2019-08-05 10:03:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:03:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 267 transitions. [2019-08-05 10:03:55,391 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 267 transitions. Word has length 22 [2019-08-05 10:03:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:55,391 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 267 transitions. [2019-08-05 10:03:55,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:03:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 267 transitions. [2019-08-05 10:03:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:03:55,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:55,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:55,394 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash 95701147, now seen corresponding path program 1 times [2019-08-05 10:03:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:55,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:55,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:55,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:55,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:03:55,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:03:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:03:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:55,506 INFO L87 Difference]: Start difference. First operand 148 states and 267 transitions. Second operand 4 states. [2019-08-05 10:03:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:55,895 INFO L93 Difference]: Finished difference Result 174 states and 315 transitions. [2019-08-05 10:03:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:03:55,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 10:03:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:55,898 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:03:55,898 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:03:55,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:03:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 149. [2019-08-05 10:03:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:03:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 269 transitions. [2019-08-05 10:03:55,905 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 269 transitions. Word has length 23 [2019-08-05 10:03:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:55,905 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 269 transitions. [2019-08-05 10:03:55,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:03:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 269 transitions. [2019-08-05 10:03:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:03:55,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:55,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:55,907 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -541858457, now seen corresponding path program 1 times [2019-08-05 10:03:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:55,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:03:55,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:56,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:56,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:56,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:56,436 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-08-05 10:03:56,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:56,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:03:56,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:03:56,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:03:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:56,555 INFO L87 Difference]: Start difference. First operand 149 states and 269 transitions. Second operand 12 states. [2019-08-05 10:03:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:58,509 INFO L93 Difference]: Finished difference Result 179 states and 321 transitions. [2019-08-05 10:03:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:03:58,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-08-05 10:03:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:58,512 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:03:58,513 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:03:58,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:03:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2019-08-05 10:03:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:03:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 273 transitions. [2019-08-05 10:03:58,519 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 273 transitions. Word has length 23 [2019-08-05 10:03:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:58,520 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 273 transitions. [2019-08-05 10:03:58,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:03:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 273 transitions. [2019-08-05 10:03:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:03:58,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:58,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:58,522 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1313743878, now seen corresponding path program 1 times [2019-08-05 10:03:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:58,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:03:58,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:58,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:58,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:58,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:58,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:03:58,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:03:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:03:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:58,732 INFO L87 Difference]: Start difference. First operand 151 states and 273 transitions. Second operand 5 states. [2019-08-05 10:03:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,098 INFO L93 Difference]: Finished difference Result 212 states and 377 transitions. [2019-08-05 10:03:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:59,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-08-05 10:03:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,101 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:03:59,101 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:03:59,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:03:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 170. [2019-08-05 10:03:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:03:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 305 transitions. [2019-08-05 10:03:59,107 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 305 transitions. Word has length 23 [2019-08-05 10:03:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,108 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 305 transitions. [2019-08-05 10:03:59,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:03:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 305 transitions. [2019-08-05 10:03:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:03:59,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:59,110 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -380272972, now seen corresponding path program 1 times [2019-08-05 10:03:59,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:59,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:03:59,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:59,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:59,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:59,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:59,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:59,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:59,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:03:59,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:59,296 INFO L87 Difference]: Start difference. First operand 170 states and 305 transitions. Second operand 8 states. [2019-08-05 10:04:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:00,112 INFO L93 Difference]: Finished difference Result 235 states and 410 transitions. [2019-08-05 10:04:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:00,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-08-05 10:04:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:00,116 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:04:00,116 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:04:00,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:04:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 184. [2019-08-05 10:04:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:04:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 327 transitions. [2019-08-05 10:04:00,124 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 327 transitions. Word has length 23 [2019-08-05 10:04:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:00,124 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 327 transitions. [2019-08-05 10:04:00,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 327 transitions. [2019-08-05 10:04:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:04:00,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:00,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:00,126 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash -380260543, now seen corresponding path program 1 times [2019-08-05 10:04:00,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:00,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:00,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:00,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:00,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:00,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:00,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:00,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:00,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:00,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:00,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:00,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:00,509 INFO L87 Difference]: Start difference. First operand 184 states and 327 transitions. Second operand 8 states. [2019-08-05 10:04:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:01,424 INFO L93 Difference]: Finished difference Result 228 states and 396 transitions. [2019-08-05 10:04:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:01,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-08-05 10:04:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:01,427 INFO L225 Difference]: With dead ends: 228 [2019-08-05 10:04:01,428 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:04:01,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:04:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 188. [2019-08-05 10:04:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:04:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 333 transitions. [2019-08-05 10:04:01,434 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 333 transitions. Word has length 23 [2019-08-05 10:04:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:01,434 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 333 transitions. [2019-08-05 10:04:01,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 333 transitions. [2019-08-05 10:04:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:01,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:01,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:01,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1588460440, now seen corresponding path program 1 times [2019-08-05 10:04:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:01,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:01,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:01,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:01,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:01,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:01,491 INFO L87 Difference]: Start difference. First operand 188 states and 333 transitions. Second operand 3 states. [2019-08-05 10:04:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:01,859 INFO L93 Difference]: Finished difference Result 249 states and 441 transitions. [2019-08-05 10:04:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:01,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:04:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:01,862 INFO L225 Difference]: With dead ends: 249 [2019-08-05 10:04:01,863 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:04:01,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:04:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 180. [2019-08-05 10:04:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:04:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 312 transitions. [2019-08-05 10:04:01,869 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 312 transitions. Word has length 24 [2019-08-05 10:04:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:01,870 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 312 transitions. [2019-08-05 10:04:01,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 312 transitions. [2019-08-05 10:04:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:01,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:01,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:01,871 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:01,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:01,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1426499187, now seen corresponding path program 1 times [2019-08-05 10:04:01,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:01,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:01,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:02,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:02,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:02,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:02,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:02,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:02,038 INFO L87 Difference]: Start difference. First operand 180 states and 312 transitions. Second operand 5 states. [2019-08-05 10:04:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:03,272 INFO L93 Difference]: Finished difference Result 210 states and 364 transitions. [2019-08-05 10:04:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:03,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-08-05 10:04:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:03,275 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:04:03,275 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:04:03,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:04:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 182. [2019-08-05 10:04:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:04:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 315 transitions. [2019-08-05 10:04:03,281 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 315 transitions. Word has length 24 [2019-08-05 10:04:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:03,282 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 315 transitions. [2019-08-05 10:04:03,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 315 transitions. [2019-08-05 10:04:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:03,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:03,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:03,283 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash -829548663, now seen corresponding path program 1 times [2019-08-05 10:04:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:03,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:03,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:03,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:03,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:03,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:03,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:03,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:03,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:03,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:03,439 INFO L87 Difference]: Start difference. First operand 182 states and 315 transitions. Second operand 6 states. [2019-08-05 10:04:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:04,275 INFO L93 Difference]: Finished difference Result 195 states and 340 transitions. [2019-08-05 10:04:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:04,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-08-05 10:04:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:04,278 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:04:04,278 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:04:04,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:04:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2019-08-05 10:04:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:04:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 246 transitions. [2019-08-05 10:04:04,285 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 246 transitions. Word has length 24 [2019-08-05 10:04:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:04,285 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 246 transitions. [2019-08-05 10:04:04,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 246 transitions. [2019-08-05 10:04:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:04,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:04,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:04,290 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1192369805, now seen corresponding path program 1 times [2019-08-05 10:04:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:04,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:04,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:04,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:04,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:04,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:04,462 INFO L87 Difference]: Start difference. First operand 143 states and 246 transitions. Second operand 9 states. [2019-08-05 10:04:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:05,646 INFO L93 Difference]: Finished difference Result 254 states and 423 transitions. [2019-08-05 10:04:05,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:05,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-08-05 10:04:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:05,649 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:04:05,650 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 10:04:05,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 10:04:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 174. [2019-08-05 10:04:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:04:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 297 transitions. [2019-08-05 10:04:05,656 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 297 transitions. Word has length 24 [2019-08-05 10:04:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:05,656 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 297 transitions. [2019-08-05 10:04:05,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 297 transitions. [2019-08-05 10:04:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:05,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:05,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:05,658 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1192357376, now seen corresponding path program 1 times [2019-08-05 10:04:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:05,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:05,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:05,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:05,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:05,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:05,872 INFO L87 Difference]: Start difference. First operand 174 states and 297 transitions. Second operand 10 states. [2019-08-05 10:04:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:06,921 INFO L93 Difference]: Finished difference Result 259 states and 423 transitions. [2019-08-05 10:04:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:04:06,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-08-05 10:04:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:06,924 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:04:06,924 INFO L226 Difference]: Without dead ends: 256 [2019-08-05 10:04:06,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:04:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-08-05 10:04:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 183. [2019-08-05 10:04:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:04:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 313 transitions. [2019-08-05 10:04:06,931 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 313 transitions. Word has length 24 [2019-08-05 10:04:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:06,931 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 313 transitions. [2019-08-05 10:04:06,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 313 transitions. [2019-08-05 10:04:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:06,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:06,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:06,933 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:06,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1645786326, now seen corresponding path program 1 times [2019-08-05 10:04:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:06,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:06,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:06,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:06,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:06,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:06,992 INFO L87 Difference]: Start difference. First operand 183 states and 313 transitions. Second operand 3 states. [2019-08-05 10:04:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:07,187 INFO L93 Difference]: Finished difference Result 180 states and 307 transitions. [2019-08-05 10:04:07,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:07,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:04:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:07,189 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:04:07,189 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:04:07,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:04:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-05 10:04:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:04:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 305 transitions. [2019-08-05 10:04:07,195 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 305 transitions. Word has length 25 [2019-08-05 10:04:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:07,196 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 305 transitions. [2019-08-05 10:04:07,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 305 transitions. [2019-08-05 10:04:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:07,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:07,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:07,197 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:07,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash -587613654, now seen corresponding path program 1 times [2019-08-05 10:04:07,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:07,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:04:07,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:07,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:07,436 INFO L87 Difference]: Start difference. First operand 179 states and 305 transitions. Second operand 8 states. [2019-08-05 10:04:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:08,109 INFO L93 Difference]: Finished difference Result 190 states and 319 transitions. [2019-08-05 10:04:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:08,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:04:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:08,111 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:04:08,111 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:04:08,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:04:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-08-05 10:04:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:04:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 313 transitions. [2019-08-05 10:04:08,117 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 313 transitions. Word has length 25 [2019-08-05 10:04:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:08,117 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 313 transitions. [2019-08-05 10:04:08,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 313 transitions. [2019-08-05 10:04:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:08,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:08,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:08,119 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1215784286, now seen corresponding path program 1 times [2019-08-05 10:04:08,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:08,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:08,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:08,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:08,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:04:08,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:08,166 INFO L87 Difference]: Start difference. First operand 185 states and 313 transitions. Second operand 3 states. [2019-08-05 10:04:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:08,332 INFO L93 Difference]: Finished difference Result 218 states and 366 transitions. [2019-08-05 10:04:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:08,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:04:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:08,335 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:04:08,335 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 10:04:08,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 10:04:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2019-08-05 10:04:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:04:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 338 transitions. [2019-08-05 10:04:08,341 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 338 transitions. Word has length 25 [2019-08-05 10:04:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:08,341 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 338 transitions. [2019-08-05 10:04:08,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 338 transitions. [2019-08-05 10:04:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:08,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:08,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:08,342 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash -234746710, now seen corresponding path program 1 times [2019-08-05 10:04:08,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:08,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:08,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:08,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:08,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:08,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:08,470 INFO L87 Difference]: Start difference. First operand 200 states and 338 transitions. Second operand 8 states. [2019-08-05 10:04:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:09,238 INFO L93 Difference]: Finished difference Result 262 states and 434 transitions. [2019-08-05 10:04:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:09,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:04:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:09,240 INFO L225 Difference]: With dead ends: 262 [2019-08-05 10:04:09,241 INFO L226 Difference]: Without dead ends: 262 [2019-08-05 10:04:09,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-08-05 10:04:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 199. [2019-08-05 10:04:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 10:04:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 334 transitions. [2019-08-05 10:04:09,246 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 334 transitions. Word has length 25 [2019-08-05 10:04:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:09,247 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 334 transitions. [2019-08-05 10:04:09,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 334 transitions. [2019-08-05 10:04:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:09,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:09,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:09,248 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1691627549, now seen corresponding path program 1 times [2019-08-05 10:04:09,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:09,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:09,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:10,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:10,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:04:10,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:10,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:10,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:10,315 INFO L87 Difference]: Start difference. First operand 199 states and 334 transitions. Second operand 11 states. [2019-08-05 10:04:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:11,470 INFO L93 Difference]: Finished difference Result 235 states and 386 transitions. [2019-08-05 10:04:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:04:11,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 10:04:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:11,475 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:04:11,475 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:04:11,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:04:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:04:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2019-08-05 10:04:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-05 10:04:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 344 transitions. [2019-08-05 10:04:11,479 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 344 transitions. Word has length 25 [2019-08-05 10:04:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:11,480 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 344 transitions. [2019-08-05 10:04:11,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 344 transitions. [2019-08-05 10:04:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:11,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:11,481 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:11,481 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 16335722, now seen corresponding path program 1 times [2019-08-05 10:04:11,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:11,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:11,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:12,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:12,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:04:12,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:12,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:12,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:12,112 INFO L87 Difference]: Start difference. First operand 207 states and 344 transitions. Second operand 12 states. [2019-08-05 10:04:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:13,421 INFO L93 Difference]: Finished difference Result 240 states and 394 transitions. [2019-08-05 10:04:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:13,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-08-05 10:04:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:13,424 INFO L225 Difference]: With dead ends: 240 [2019-08-05 10:04:13,424 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:04:13,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:04:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 203. [2019-08-05 10:04:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:04:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 338 transitions. [2019-08-05 10:04:13,429 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 338 transitions. Word has length 26 [2019-08-05 10:04:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:13,430 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 338 transitions. [2019-08-05 10:04:13,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 338 transitions. [2019-08-05 10:04:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:13,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:13,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:13,431 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2011613147, now seen corresponding path program 1 times [2019-08-05 10:04:13,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:13,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:13,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:13,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:13,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:13,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:13,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:13,560 INFO L87 Difference]: Start difference. First operand 203 states and 338 transitions. Second operand 9 states. [2019-08-05 10:04:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:14,825 INFO L93 Difference]: Finished difference Result 381 states and 619 transitions. [2019-08-05 10:04:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:04:14,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 10:04:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:14,829 INFO L225 Difference]: With dead ends: 381 [2019-08-05 10:04:14,829 INFO L226 Difference]: Without dead ends: 380 [2019-08-05 10:04:14,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:04:14,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-08-05 10:04:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 226. [2019-08-05 10:04:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 10:04:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 376 transitions. [2019-08-05 10:04:14,835 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 376 transitions. Word has length 26 [2019-08-05 10:04:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:14,836 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 376 transitions. [2019-08-05 10:04:14,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 376 transitions. [2019-08-05 10:04:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:14,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:14,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:14,837 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2011625576, now seen corresponding path program 1 times [2019-08-05 10:04:14,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:14,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:14,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:14,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:14,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:14,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:14,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:14,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:14,980 INFO L87 Difference]: Start difference. First operand 226 states and 376 transitions. Second operand 8 states. [2019-08-05 10:04:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:15,842 INFO L93 Difference]: Finished difference Result 323 states and 543 transitions. [2019-08-05 10:04:15,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:15,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 10:04:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:15,845 INFO L225 Difference]: With dead ends: 323 [2019-08-05 10:04:15,845 INFO L226 Difference]: Without dead ends: 319 [2019-08-05 10:04:15,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-08-05 10:04:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 232. [2019-08-05 10:04:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:04:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-08-05 10:04:15,851 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 26 [2019-08-05 10:04:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:15,851 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-08-05 10:04:15,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-08-05 10:04:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:15,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:15,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:15,852 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1041811995, now seen corresponding path program 1 times [2019-08-05 10:04:15,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:15,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:15,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:15,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:16,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:16,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:16,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:16,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:16,008 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 8 states. [2019-08-05 10:04:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:16,658 INFO L93 Difference]: Finished difference Result 305 states and 484 transitions. [2019-08-05 10:04:16,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:16,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 10:04:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:16,661 INFO L225 Difference]: With dead ends: 305 [2019-08-05 10:04:16,661 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 10:04:16,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 10:04:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 244. [2019-08-05 10:04:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:04:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 407 transitions. [2019-08-05 10:04:16,666 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 407 transitions. Word has length 26 [2019-08-05 10:04:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:16,667 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 407 transitions. [2019-08-05 10:04:16,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 407 transitions. [2019-08-05 10:04:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:16,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:16,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:16,668 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash 965393339, now seen corresponding path program 1 times [2019-08-05 10:04:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:16,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:16,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:16,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:16,811 INFO L87 Difference]: Start difference. First operand 244 states and 407 transitions. Second operand 9 states. [2019-08-05 10:04:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:18,134 INFO L93 Difference]: Finished difference Result 268 states and 438 transitions. [2019-08-05 10:04:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:18,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 10:04:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:18,137 INFO L225 Difference]: With dead ends: 268 [2019-08-05 10:04:18,137 INFO L226 Difference]: Without dead ends: 268 [2019-08-05 10:04:18,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-08-05 10:04:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 245. [2019-08-05 10:04:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 10:04:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 407 transitions. [2019-08-05 10:04:18,143 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 407 transitions. Word has length 26 [2019-08-05 10:04:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:18,143 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 407 transitions. [2019-08-05 10:04:18,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 407 transitions. [2019-08-05 10:04:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:18,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:18,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:18,144 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2008557896, now seen corresponding path program 1 times [2019-08-05 10:04:18,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:18,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:18,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:18,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:18,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:19,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:19,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:19,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=72, Unknown=1, NotChecked=0, Total=90 [2019-08-05 10:04:19,739 INFO L87 Difference]: Start difference. First operand 245 states and 407 transitions. Second operand 10 states. [2019-08-05 10:04:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:34,785 INFO L93 Difference]: Finished difference Result 432 states and 704 transitions. [2019-08-05 10:04:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:04:34,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:04:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:34,789 INFO L225 Difference]: With dead ends: 432 [2019-08-05 10:04:34,789 INFO L226 Difference]: Without dead ends: 426 [2019-08-05 10:04:34,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=141, Invalid=559, Unknown=2, NotChecked=0, Total=702 [2019-08-05 10:04:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-08-05 10:04:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 327. [2019-08-05 10:04:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-08-05 10:04:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 542 transitions. [2019-08-05 10:04:34,796 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 542 transitions. Word has length 27 [2019-08-05 10:04:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:34,796 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 542 transitions. [2019-08-05 10:04:34,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 542 transitions. [2019-08-05 10:04:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:34,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:34,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:34,798 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2063565982, now seen corresponding path program 1 times [2019-08-05 10:04:34,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:34,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:34,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:34,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:34,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:34,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:34,901 INFO L87 Difference]: Start difference. First operand 327 states and 542 transitions. Second operand 6 states. [2019-08-05 10:04:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:35,422 INFO L93 Difference]: Finished difference Result 378 states and 608 transitions. [2019-08-05 10:04:35,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:35,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-08-05 10:04:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:35,426 INFO L225 Difference]: With dead ends: 378 [2019-08-05 10:04:35,426 INFO L226 Difference]: Without dead ends: 378 [2019-08-05 10:04:35,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-08-05 10:04:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 327. [2019-08-05 10:04:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-08-05 10:04:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 541 transitions. [2019-08-05 10:04:35,433 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 541 transitions. Word has length 27 [2019-08-05 10:04:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:35,433 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 541 transitions. [2019-08-05 10:04:35,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 541 transitions. [2019-08-05 10:04:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:35,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:35,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:35,434 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash -137191723, now seen corresponding path program 1 times [2019-08-05 10:04:35,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:35,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:35,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:35,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:35,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:35,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:35,642 INFO L87 Difference]: Start difference. First operand 327 states and 541 transitions. Second operand 8 states. [2019-08-05 10:04:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:36,112 INFO L93 Difference]: Finished difference Result 315 states and 519 transitions. [2019-08-05 10:04:36,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:36,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-08-05 10:04:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:36,116 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:04:36,116 INFO L226 Difference]: Without dead ends: 315 [2019-08-05 10:04:36,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-08-05 10:04:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-08-05 10:04:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-08-05 10:04:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 479 transitions. [2019-08-05 10:04:36,121 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 479 transitions. Word has length 27 [2019-08-05 10:04:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:36,122 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 479 transitions. [2019-08-05 10:04:36,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 479 transitions. [2019-08-05 10:04:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:36,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:36,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:36,123 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:36,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1856728965, now seen corresponding path program 1 times [2019-08-05 10:04:36,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:36,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:36,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:36,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:36,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:36,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:36,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:36,248 INFO L87 Difference]: Start difference. First operand 289 states and 479 transitions. Second operand 9 states. [2019-08-05 10:04:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:37,457 INFO L93 Difference]: Finished difference Result 396 states and 655 transitions. [2019-08-05 10:04:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:37,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 10:04:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:37,461 INFO L225 Difference]: With dead ends: 396 [2019-08-05 10:04:37,461 INFO L226 Difference]: Without dead ends: 395 [2019-08-05 10:04:37,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-08-05 10:04:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 312. [2019-08-05 10:04:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-08-05 10:04:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 517 transitions. [2019-08-05 10:04:37,467 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 517 transitions. Word has length 27 [2019-08-05 10:04:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:37,467 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 517 transitions. [2019-08-05 10:04:37,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 517 transitions. [2019-08-05 10:04:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:37,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:37,468 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:37,469 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:37,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1547691216, now seen corresponding path program 2 times [2019-08-05 10:04:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:37,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:37,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:37,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:37,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:37,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:37,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:37,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:37,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:37,545 INFO L87 Difference]: Start difference. First operand 312 states and 517 transitions. Second operand 9 states. [2019-08-05 10:04:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:38,801 INFO L93 Difference]: Finished difference Result 462 states and 752 transitions. [2019-08-05 10:04:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:04:38,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:04:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:38,805 INFO L225 Difference]: With dead ends: 462 [2019-08-05 10:04:38,806 INFO L226 Difference]: Without dead ends: 459 [2019-08-05 10:04:38,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:04:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-08-05 10:04:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 318. [2019-08-05 10:04:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-08-05 10:04:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 527 transitions. [2019-08-05 10:04:38,813 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 527 transitions. Word has length 28 [2019-08-05 10:04:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:38,813 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 527 transitions. [2019-08-05 10:04:38,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 527 transitions. [2019-08-05 10:04:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:38,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:38,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:38,815 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:38,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2082795467, now seen corresponding path program 1 times [2019-08-05 10:04:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:38,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:38,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:38,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:38,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:38,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:38,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:38,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:38,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:38,973 INFO L87 Difference]: Start difference. First operand 318 states and 527 transitions. Second operand 5 states. [2019-08-05 10:04:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:39,397 INFO L93 Difference]: Finished difference Result 314 states and 524 transitions. [2019-08-05 10:04:39,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:04:39,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-08-05 10:04:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:39,400 INFO L225 Difference]: With dead ends: 314 [2019-08-05 10:04:39,400 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:04:39,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:04:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 255. [2019-08-05 10:04:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-08-05 10:04:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 427 transitions. [2019-08-05 10:04:39,405 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 427 transitions. Word has length 28 [2019-08-05 10:04:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:39,405 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 427 transitions. [2019-08-05 10:04:39,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 427 transitions. [2019-08-05 10:04:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:39,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:39,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:39,407 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash -235617088, now seen corresponding path program 1 times [2019-08-05 10:04:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:39,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:39,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:39,683 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-08-05 10:04:39,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:39,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:39,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:39,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:39,805 INFO L87 Difference]: Start difference. First operand 255 states and 427 transitions. Second operand 7 states. [2019-08-05 10:04:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:40,342 INFO L93 Difference]: Finished difference Result 328 states and 545 transitions. [2019-08-05 10:04:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:40,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 10:04:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:40,345 INFO L225 Difference]: With dead ends: 328 [2019-08-05 10:04:40,345 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 10:04:40,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 10:04:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 274. [2019-08-05 10:04:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 10:04:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 458 transitions. [2019-08-05 10:04:40,351 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 458 transitions. Word has length 28 [2019-08-05 10:04:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:40,351 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 458 transitions. [2019-08-05 10:04:40,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 458 transitions. [2019-08-05 10:04:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:40,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:40,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:40,352 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash -235604659, now seen corresponding path program 1 times [2019-08-05 10:04:40,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:40,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:40,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:40,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:02,985 WARN L188 SmtUtils]: Spent 22.52 s on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-08-05 10:05:19,993 WARN L188 SmtUtils]: Spent 16.99 s on a formula simplification that was a NOOP. DAG size: 41 [2019-08-05 10:05:19,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:05:30,573 WARN L188 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-08-05 10:05:35,043 WARN L188 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-08-05 10:05:35,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:35,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:35,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:35,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:35,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:35,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=54, Unknown=10, NotChecked=0, Total=90 [2019-08-05 10:05:35,056 INFO L87 Difference]: Start difference. First operand 274 states and 458 transitions. Second operand 10 states. [2019-08-05 10:06:12,193 WARN L188 SmtUtils]: Spent 25.19 s on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-08-05 10:06:40,823 WARN L188 SmtUtils]: Spent 27.59 s on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-08-05 10:07:10,117 WARN L188 SmtUtils]: Spent 27.11 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-08-05 10:07:38,309 WARN L188 SmtUtils]: Spent 22.72 s on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-08-05 10:07:45,571 WARN L188 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2019-08-05 10:07:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:45,670 INFO L93 Difference]: Finished difference Result 315 states and 525 transitions. [2019-08-05 10:07:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:07:45,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:07:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:45,672 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:07:45,673 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:07:45,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 165.9s TimeCoverageRelationStatistics Valid=81, Invalid=139, Unknown=20, NotChecked=0, Total=240 [2019-08-05 10:07:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:07:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 285. [2019-08-05 10:07:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-08-05 10:07:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 479 transitions. [2019-08-05 10:07:45,678 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 479 transitions. Word has length 28 [2019-08-05 10:07:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:45,678 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 479 transitions. [2019-08-05 10:07:45,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 479 transitions. [2019-08-05 10:07:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:07:45,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:45,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:45,680 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1800442264, now seen corresponding path program 1 times [2019-08-05 10:07:45,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:45,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:07:45,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:46,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:46,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:07:46,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:07:46,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:07:46,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=72, Unknown=1, NotChecked=0, Total=90 [2019-08-05 10:07:46,417 INFO L87 Difference]: Start difference. First operand 285 states and 479 transitions. Second operand 10 states. [2019-08-05 10:07:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:47,961 INFO L93 Difference]: Finished difference Result 333 states and 556 transitions. [2019-08-05 10:07:47,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:47,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:07:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:47,964 INFO L225 Difference]: With dead ends: 333 [2019-08-05 10:07:47,964 INFO L226 Difference]: Without dead ends: 330 [2019-08-05 10:07:47,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2019-08-05 10:07:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-05 10:07:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 299. [2019-08-05 10:07:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-08-05 10:07:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 503 transitions. [2019-08-05 10:07:47,969 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 503 transitions. Word has length 28 [2019-08-05 10:07:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:47,969 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 503 transitions. [2019-08-05 10:07:47,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 503 transitions. [2019-08-05 10:07:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:07:47,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:47,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:47,970 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1724023608, now seen corresponding path program 1 times [2019-08-05 10:07:47,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:47,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:07:47,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:48,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:48,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:07:48,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:07:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:07:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:48,990 INFO L87 Difference]: Start difference. First operand 299 states and 503 transitions. Second operand 10 states. [2019-08-05 10:07:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:50,809 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-08-05 10:07:50,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:50,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:07:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:50,812 INFO L225 Difference]: With dead ends: 317 [2019-08-05 10:07:50,813 INFO L226 Difference]: Without dead ends: 317 [2019-08-05 10:07:50,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-08-05 10:07:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 288. [2019-08-05 10:07:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-05 10:07:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 484 transitions. [2019-08-05 10:07:50,817 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 484 transitions. Word has length 28 [2019-08-05 10:07:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:50,817 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 484 transitions. [2019-08-05 10:07:50,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 484 transitions. [2019-08-05 10:07:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:07:50,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:50,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:50,819 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1724036037, now seen corresponding path program 1 times [2019-08-05 10:07:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:50,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:07:50,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:50,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:51,382 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2019-08-05 10:07:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:51,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:51,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:07:51,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:07:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:07:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:51,657 INFO L87 Difference]: Start difference. First operand 288 states and 484 transitions. Second operand 9 states. [2019-08-05 10:07:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:54,051 INFO L93 Difference]: Finished difference Result 465 states and 756 transitions. [2019-08-05 10:07:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:54,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:07:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:54,054 INFO L225 Difference]: With dead ends: 465 [2019-08-05 10:07:54,054 INFO L226 Difference]: Without dead ends: 464 [2019-08-05 10:07:54,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-08-05 10:07:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2019-08-05 10:07:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-08-05 10:07:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 673 transitions. [2019-08-05 10:07:54,061 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 673 transitions. Word has length 28 [2019-08-05 10:07:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:54,061 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 673 transitions. [2019-08-05 10:07:54,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:07:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 673 transitions. [2019-08-05 10:07:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:07:54,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:54,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:54,062 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1573284596, now seen corresponding path program 1 times [2019-08-05 10:07:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:54,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:07:54,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:54,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:07:54,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:07:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:07:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:54,290 INFO L87 Difference]: Start difference. First operand 413 states and 673 transitions. Second operand 12 states. [2019-08-05 10:07:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:55,199 INFO L93 Difference]: Finished difference Result 423 states and 686 transitions. [2019-08-05 10:07:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:07:55,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:07:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:55,203 INFO L225 Difference]: With dead ends: 423 [2019-08-05 10:07:55,203 INFO L226 Difference]: Without dead ends: 408 [2019-08-05 10:07:55,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:07:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-08-05 10:07:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 394. [2019-08-05 10:07:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-08-05 10:07:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 646 transitions. [2019-08-05 10:07:55,209 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 646 transitions. Word has length 28 [2019-08-05 10:07:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:55,209 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 646 transitions. [2019-08-05 10:07:55,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:07:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 646 transitions. [2019-08-05 10:07:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:07:55,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:55,210 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:55,211 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1061029624, now seen corresponding path program 1 times [2019-08-05 10:07:55,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:55,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:07:55,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:55,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:07:55,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:07:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:07:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:55,308 INFO L87 Difference]: Start difference. First operand 394 states and 646 transitions. Second operand 10 states. [2019-08-05 10:07:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:57,130 INFO L93 Difference]: Finished difference Result 534 states and 857 transitions. [2019-08-05 10:07:57,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:07:57,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:07:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:57,138 INFO L225 Difference]: With dead ends: 534 [2019-08-05 10:07:57,138 INFO L226 Difference]: Without dead ends: 532 [2019-08-05 10:07:57,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:07:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-08-05 10:07:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 398. [2019-08-05 10:07:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-08-05 10:07:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 650 transitions. [2019-08-05 10:07:57,146 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 650 transitions. Word has length 29 [2019-08-05 10:07:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:57,146 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 650 transitions. [2019-08-05 10:07:57,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 650 transitions. [2019-08-05 10:07:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:07:57,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:57,147 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:57,147 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1061042053, now seen corresponding path program 1 times [2019-08-05 10:07:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:57,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:07:57,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:57,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:57,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:07:57,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:07:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:07:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:07:57,258 INFO L87 Difference]: Start difference. First operand 398 states and 650 transitions. Second operand 11 states. [2019-08-05 10:07:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:59,416 INFO L93 Difference]: Finished difference Result 567 states and 910 transitions. [2019-08-05 10:07:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:07:59,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:07:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:59,420 INFO L225 Difference]: With dead ends: 567 [2019-08-05 10:07:59,420 INFO L226 Difference]: Without dead ends: 555 [2019-08-05 10:07:59,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=1556, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:07:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-08-05 10:07:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 414. [2019-08-05 10:07:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-08-05 10:07:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 677 transitions. [2019-08-05 10:07:59,426 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 677 transitions. Word has length 29 [2019-08-05 10:07:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:59,426 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 677 transitions. [2019-08-05 10:07:59,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:07:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 677 transitions. [2019-08-05 10:07:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:07:59,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:59,427 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:59,428 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1192586278, now seen corresponding path program 1 times [2019-08-05 10:07:59,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:59,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:59,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:59,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:59,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:59,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:59,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:07:59,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:59,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:07:59,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:59,528 INFO L87 Difference]: Start difference. First operand 414 states and 677 transitions. Second operand 8 states. [2019-08-05 10:08:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:00,464 INFO L93 Difference]: Finished difference Result 606 states and 979 transitions. [2019-08-05 10:08:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:00,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:08:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:00,468 INFO L225 Difference]: With dead ends: 606 [2019-08-05 10:08:00,468 INFO L226 Difference]: Without dead ends: 606 [2019-08-05 10:08:00,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:08:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-08-05 10:08:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 411. [2019-08-05 10:08:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-08-05 10:08:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 670 transitions. [2019-08-05 10:08:00,475 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 670 transitions. Word has length 29 [2019-08-05 10:08:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:00,475 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 670 transitions. [2019-08-05 10:08:00,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 670 transitions. [2019-08-05 10:08:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:08:00,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:00,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:00,476 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 733787981, now seen corresponding path program 1 times [2019-08-05 10:08:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:00,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:00,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:00,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:00,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:00,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:00,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:00,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:00,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:08:00,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:00,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:00,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:00,604 INFO L87 Difference]: Start difference. First operand 411 states and 670 transitions. Second operand 10 states. [2019-08-05 10:08:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:02,214 INFO L93 Difference]: Finished difference Result 647 states and 1038 transitions. [2019-08-05 10:08:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:08:02,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:08:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:02,219 INFO L225 Difference]: With dead ends: 647 [2019-08-05 10:08:02,219 INFO L226 Difference]: Without dead ends: 640 [2019-08-05 10:08:02,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:08:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-08-05 10:08:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 410. [2019-08-05 10:08:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-08-05 10:08:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 668 transitions. [2019-08-05 10:08:02,225 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 668 transitions. Word has length 29 [2019-08-05 10:08:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:02,226 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 668 transitions. [2019-08-05 10:08:02,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 668 transitions. [2019-08-05 10:08:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:08:02,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:02,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:02,227 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -640183555, now seen corresponding path program 1 times [2019-08-05 10:08:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:02,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:08:02,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:02,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:02,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:02,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:08:02,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:02,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:02,451 INFO L87 Difference]: Start difference. First operand 410 states and 668 transitions. Second operand 10 states. [2019-08-05 10:08:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:02,917 INFO L93 Difference]: Finished difference Result 409 states and 664 transitions. [2019-08-05 10:08:02,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:08:02,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:08:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:02,920 INFO L225 Difference]: With dead ends: 409 [2019-08-05 10:08:02,920 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 10:08:02,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:08:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 10:08:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2019-08-05 10:08:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-08-05 10:08:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 642 transitions. [2019-08-05 10:08:02,926 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 642 transitions. Word has length 29 [2019-08-05 10:08:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:02,926 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 642 transitions. [2019-08-05 10:08:02,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 642 transitions. [2019-08-05 10:08:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:08:02,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:02,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:02,927 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash -414125092, now seen corresponding path program 1 times [2019-08-05 10:08:02,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:02,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:08:02,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:02,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:02,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:02,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:08:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:08:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:08:02,947 INFO L87 Difference]: Start difference. First operand 395 states and 642 transitions. Second operand 3 states. [2019-08-05 10:08:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:03,055 INFO L93 Difference]: Finished difference Result 222 states and 362 transitions. [2019-08-05 10:08:03,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:08:03,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-08-05 10:08:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:03,057 INFO L225 Difference]: With dead ends: 222 [2019-08-05 10:08:03,057 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:08:03,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:08:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:08:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2019-08-05 10:08:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:08:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 215 transitions. [2019-08-05 10:08:03,060 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 215 transitions. Word has length 29 [2019-08-05 10:08:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:03,060 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 215 transitions. [2019-08-05 10:08:03,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:08:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 215 transitions. [2019-08-05 10:08:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:08:03,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:03,061 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:03,061 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 901158853, now seen corresponding path program 1 times [2019-08-05 10:08:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:08:03,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:08:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:03,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:03,569 INFO L87 Difference]: Start difference. First operand 131 states and 215 transitions. Second operand 7 states. [2019-08-05 10:08:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:04,560 INFO L93 Difference]: Finished difference Result 158 states and 251 transitions. [2019-08-05 10:08:04,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:08:04,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-08-05 10:08:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:04,562 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:08:04,562 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:08:04,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:08:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2019-08-05 10:08:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:08:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 195 transitions. [2019-08-05 10:08:04,565 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 195 transitions. Word has length 30 [2019-08-05 10:08:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:04,566 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 195 transitions. [2019-08-05 10:08:04,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 195 transitions. [2019-08-05 10:08:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:08:04,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:04,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:04,567 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1336368899, now seen corresponding path program 1 times [2019-08-05 10:08:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:04,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:08:04,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:04,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:04,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:04,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:08:04,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:04,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:04,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:04,712 INFO L87 Difference]: Start difference. First operand 118 states and 195 transitions. Second operand 8 states. [2019-08-05 10:08:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:05,766 INFO L93 Difference]: Finished difference Result 200 states and 314 transitions. [2019-08-05 10:08:05,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:08:05,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 10:08:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:05,768 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:08:05,768 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:08:05,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:08:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:08:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 124. [2019-08-05 10:08:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:08:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 205 transitions. [2019-08-05 10:08:05,772 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 205 transitions. Word has length 30 [2019-08-05 10:08:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:05,773 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 205 transitions. [2019-08-05 10:08:05,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 205 transitions. [2019-08-05 10:08:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:08:05,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:05,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:05,774 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1336356470, now seen corresponding path program 1 times [2019-08-05 10:08:05,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:05,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:08:05,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:08:05,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:05,885 INFO L87 Difference]: Start difference. First operand 124 states and 205 transitions. Second operand 10 states. [2019-08-05 10:08:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:07,570 INFO L93 Difference]: Finished difference Result 279 states and 436 transitions. [2019-08-05 10:08:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:08:07,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-08-05 10:08:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:07,572 INFO L225 Difference]: With dead ends: 279 [2019-08-05 10:08:07,572 INFO L226 Difference]: Without dead ends: 264 [2019-08-05 10:08:07,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:08:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-08-05 10:08:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 136. [2019-08-05 10:08:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:08:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 223 transitions. [2019-08-05 10:08:07,577 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 223 transitions. Word has length 30 [2019-08-05 10:08:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:07,577 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 223 transitions. [2019-08-05 10:08:07,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 223 transitions. [2019-08-05 10:08:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:08:07,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:07,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:07,578 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash -403751328, now seen corresponding path program 1 times [2019-08-05 10:08:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:08:07,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:07,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:08:07,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:07,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:08:07,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:07,676 INFO L87 Difference]: Start difference. First operand 136 states and 223 transitions. Second operand 7 states. [2019-08-05 10:08:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:08,369 INFO L93 Difference]: Finished difference Result 135 states and 209 transitions. [2019-08-05 10:08:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:08:08,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-08-05 10:08:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:08,371 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:08:08,372 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:08:08,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:08:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2019-08-05 10:08:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:08:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-08-05 10:08:08,374 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 31 [2019-08-05 10:08:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:08,375 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-08-05 10:08:08,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-08-05 10:08:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:08:08,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:08,375 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:08,375 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1957538364, now seen corresponding path program 1 times [2019-08-05 10:08:08,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:08,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:08:08,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:08,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:08,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:08,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:08,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:08:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:08:08,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:08:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:08:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:08:08,694 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 11 states. [2019-08-05 10:08:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:09,665 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2019-08-05 10:08:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:09,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-08-05 10:08:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:09,667 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:08:09,667 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:08:09,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:08:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:08:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2019-08-05 10:08:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:08:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-08-05 10:08:09,670 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 32 [2019-08-05 10:08:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:09,671 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-08-05 10:08:09,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:08:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-08-05 10:08:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:08:09,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:09,671 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:09,672 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1288586745, now seen corresponding path program 1 times [2019-08-05 10:08:09,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:09,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:08:09,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:09,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:09,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:08:09,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:08:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:08:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:08:09,787 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 12 states. [2019-08-05 10:08:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:10,805 INFO L93 Difference]: Finished difference Result 123 states and 192 transitions. [2019-08-05 10:08:10,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:08:10,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-08-05 10:08:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:10,807 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:08:10,808 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:08:10,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:08:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2019-08-05 10:08:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:08:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2019-08-05 10:08:10,811 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 33 [2019-08-05 10:08:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:10,811 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2019-08-05 10:08:10,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:08:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2019-08-05 10:08:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:08:10,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:10,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:10,812 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash 458380670, now seen corresponding path program 1 times [2019-08-05 10:08:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:10,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:08:10,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:08:10,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:10,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:08:10,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:08:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:08:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:08:10,949 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand 11 states. [2019-08-05 10:08:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:11,740 INFO L93 Difference]: Finished difference Result 90 states and 146 transitions. [2019-08-05 10:08:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:08:11,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-08-05 10:08:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:11,741 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:08:11,741 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:08:11,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:08:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:08:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:08:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:08:11,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-08-05 10:08:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:11,744 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:08:11,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:08:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:08:11,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:08:11,749 INFO L202 PluginConnector]: Adding new model RanFile062.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:08:11 BoogieIcfgContainer [2019-08-05 10:08:11,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:08:11,751 INFO L168 Benchmark]: Toolchain (without parser) took 266313.94 ms. Allocated memory was 140.5 MB in the beginning and 319.8 MB in the end (delta: 179.3 MB). Free memory was 108.8 MB in the beginning and 211.3 MB in the end (delta: -102.5 MB). Peak memory consumption was 76.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:11,751 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:08:11,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.77 ms. Allocated memory is still 140.5 MB. Free memory was 108.8 MB in the beginning and 106.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:11,753 INFO L168 Benchmark]: Boogie Preprocessor took 71.52 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 104.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:11,753 INFO L168 Benchmark]: RCFGBuilder took 2518.00 ms. Allocated memory was 140.5 MB in the beginning and 177.7 MB in the end (delta: 37.2 MB). Free memory was 104.6 MB in the beginning and 116.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:11,754 INFO L168 Benchmark]: TraceAbstraction took 263679.59 ms. Allocated memory was 177.7 MB in the beginning and 319.8 MB in the end (delta: 142.1 MB). Free memory was 116.1 MB in the beginning and 211.3 MB in the end (delta: -95.2 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:11,757 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.20 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.77 ms. Allocated memory is still 140.5 MB. Free memory was 108.8 MB in the beginning and 106.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.52 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 104.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2518.00 ms. Allocated memory was 140.5 MB in the beginning and 177.7 MB in the end (delta: 37.2 MB). Free memory was 104.6 MB in the beginning and 116.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263679.59 ms. Allocated memory was 177.7 MB in the beginning and 319.8 MB in the end (delta: 142.1 MB). Free memory was 116.1 MB in the beginning and 211.3 MB in the end (delta: -95.2 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 316]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 317]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 318]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 3 error locations. SAFE Result, 263.6s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 194.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5428 SDtfs, 3643 SDslu, 4798 SDs, 0 SdLazy, 36091 SolverSat, 599 SolverUnsat, 41 SolverUnknown, 0 SolverNotchecked, 68.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1613 GetRequests, 1010 SyntacticMatches, 7 SemanticMatches, 596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 185.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 2709 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 68.0s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1363 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1311 ConstructedInterpolants, 147 QuantifiedInterpolants, 213120 SizeOfPredicates, 185 NumberOfNonLiveVariables, 3363 ConjunctsInSsa, 409 ConjunctsInUnsatCore, 52 InterpolantComputations, 45 PerfectInterpolantSequences, 106/113 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...