java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/WaterTank2-NumberVariables.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:40:49,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:40:49,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:40:49,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:40:49,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:40:49,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:40:49,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:40:49,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:40:49,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:40:49,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:40:49,431 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:40:49,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:40:49,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:40:49,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:40:49,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:40:49,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:40:49,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:40:49,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:40:49,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:40:49,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:40:49,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:40:49,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:40:49,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:40:49,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:40:49,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:40:49,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:40:49,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:40:49,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:40:49,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:40:49,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:40:49,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:40:49,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:40:49,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:40:49,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:40:49,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:40:49,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:40:49,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:40:49,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:40:49,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:40:49,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:40:49,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:40:49,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:40:49,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:40:49,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:40:49,554 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:40:49,554 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:40:49,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/WaterTank2-NumberVariables.bpl [2019-08-05 10:40:49,556 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/WaterTank2-NumberVariables.bpl' [2019-08-05 10:40:49,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:40:49,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:40:49,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:40:49,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:40:49,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:40:49,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,619 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:40:49,619 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:40:49,619 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:40:49,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:40:49,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:40:49,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:40:49,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:40:49,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/1) ... [2019-08-05 10:40:49,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:40:49,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:40:49,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:40:49,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:40:49,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (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:40:49,712 INFO L124 BoogieDeclarations]: Specification and implementation of procedure waterTank given in one single declaration [2019-08-05 10:40:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure waterTank [2019-08-05 10:40:49,713 INFO L138 BoogieDeclarations]: Found implementation of procedure waterTank [2019-08-05 10:40:49,961 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:40:49,961 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:40:49,963 INFO L202 PluginConnector]: Adding new model WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:40:49 BoogieIcfgContainer [2019-08-05 10:40:49,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:40:49,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:40:49,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:40:49,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:40:49,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:49" (1/2) ... [2019-08-05 10:40:49,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d6d463 and model type WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:40:49, skipping insertion in model container [2019-08-05 10:40:49,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:40:49" (2/2) ... [2019-08-05 10:40:49,971 INFO L109 eAbstractionObserver]: Analyzing ICFG WaterTank2-NumberVariables.bpl [2019-08-05 10:40:49,982 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:40:49,991 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:40:50,009 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:40:50,040 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:40:50,040 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:40:50,041 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:40:50,041 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:40:50,041 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:40:50,041 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:40:50,041 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:40:50,041 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:40:50,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:40:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:40:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:40:50,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:40:50,065 INFO L418 AbstractCegarLoop]: === Iteration 1 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:40:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:50,252 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:40:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:40:50,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:40:50,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:40:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:40:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:50,305 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:40:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:50,373 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:40:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:40:50,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:40:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:50,386 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:40:50,387 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:40:50,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:40:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:40:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:40:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:40:50,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:40:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:50,426 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:40:50,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:40:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:40:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:40:50,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:40:50,428 INFO L418 AbstractCegarLoop]: === Iteration 2 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:40:50,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:50,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:50,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:40:50,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:40:50,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:40:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:40:50,581 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:40:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:50,618 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:40:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:40:50,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:40:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:50,619 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:40:50,620 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:40:50,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:40:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:40:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:40:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:40:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:40:50,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:40:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:50,623 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:40:50,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:40:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:40:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:40:50,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,625 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:40:50,625 INFO L418 AbstractCegarLoop]: === Iteration 3 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:40:50,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:50,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:50,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:40:50,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:40:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:40:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:40:50,802 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:40:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:50,879 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:40:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:50,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:40:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:50,881 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:40:50,881 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:40:50,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:40:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:40:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:40:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:40:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:40:50,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:40:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:50,885 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:40:50,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:40:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:40:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:40:50,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,886 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:40:50,886 INFO L418 AbstractCegarLoop]: === Iteration 4 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,896 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:40:50,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:51,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:40:51,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:40:51,232 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:40:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:51,289 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:40:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:40:51,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:40:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:51,291 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:40:51,291 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:40:51,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:40:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:40:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:40:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:40:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:40:51,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:40:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:51,294 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:40:51,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:40:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:40:51,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:51,295 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:40:51,295 INFO L418 AbstractCegarLoop]: === Iteration 5 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:40:51,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:51,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:40:51,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:51,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:51,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:51,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:40:51,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:40:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:40:51,587 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:40:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:51,628 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:40:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:40:51,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:40:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:51,629 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:40:51,629 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:40:51,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:40:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:40:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:40:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:40:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:40:51,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:40:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:51,633 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:40:51,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:40:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:40:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:40:51,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:51,634 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:40:51,635 INFO L418 AbstractCegarLoop]: === Iteration 6 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:51,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:51,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:40:51,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:51,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:40:51,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:51,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:40:51,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:40:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:40:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:40:51,996 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:40:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:52,038 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:40:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:40:52,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:40:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:52,039 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:40:52,039 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:40:52,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:40:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:40:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:40:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:40:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:40:52,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:40:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:52,044 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:40:52,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:40:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:40:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:40:52,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:52,045 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:40:52,045 INFO L418 AbstractCegarLoop]: === Iteration 7 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:40:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:52,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:52,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:40:52,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:40:52,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:40:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:40:52,280 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:40:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:52,365 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:40:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:40:52,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:40:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:52,367 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:40:52,367 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:40:52,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:40:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:40:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:40:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:40:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:40:52,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:40:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:52,370 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:40:52,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:40:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:40:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:40:52,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:52,371 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:40:52,372 INFO L418 AbstractCegarLoop]: === Iteration 8 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:40:52,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:40:52,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:40:52,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:40:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:40:52,885 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:40:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:52,919 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:40:52,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:40:52,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:40:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:52,920 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:40:52,921 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:40:52,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:40:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:40:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:40:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:40:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:40:52,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:40:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:52,926 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:40:52,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:40:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:40:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:40:52,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:52,927 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:40:52,927 INFO L418 AbstractCegarLoop]: === Iteration 9 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:40:52,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:40:53,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:40:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:40:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:40:53,483 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:40:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,564 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:40:53,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:40:53,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:40:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,565 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:40:53,565 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:40:53,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:40:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:40:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:40:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:40:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:40:53,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:40:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,568 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:40:53,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:40:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:40:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:40:53,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,569 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:40:53,569 INFO L418 AbstractCegarLoop]: === Iteration 10 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:40:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:40:53,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:40:53,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:40:53,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:40:53,901 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:40:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,951 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:40:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:40:53,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:40:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,952 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:40:53,952 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:40:53,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:40:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:40:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:40:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:40:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:40:53,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:40:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,957 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:40:53,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:40:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:40:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:40:53,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,957 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:40:53,958 INFO L418 AbstractCegarLoop]: === Iteration 11 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:40:53,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:54,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:54,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:40:54,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:40:54,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:40:54,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:40:54,506 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:40:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:54,566 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:40:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:40:54,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:40:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:54,567 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:40:54,568 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:40:54,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:40:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:40:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:40:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:40:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:40:54,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:40:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:54,571 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:40:54,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:40:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:40:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:40:54,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:54,572 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:40:54,572 INFO L418 AbstractCegarLoop]: === Iteration 12 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:40:54,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:54,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:40:54,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:40:55,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:40:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:40:55,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:40:55,078 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:40:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,112 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:40:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:40:55,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:40:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,113 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:40:55,114 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:40:55,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:40:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:40:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:40:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:40:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:40:55,118 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:40:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,118 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:40:55,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:40:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:40:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:40:55,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,119 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:40:55,119 INFO L418 AbstractCegarLoop]: === Iteration 13 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:40:55,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:40:55,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:40:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:40:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:40:55,532 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:40:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,573 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:40:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:40:55,574 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:40:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,575 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:40:55,575 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:40:55,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:40:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:40:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:40:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:40:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:40:55,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:40:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,579 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:40:55,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:40:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:40:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:40:55,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,580 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:40:55,581 INFO L418 AbstractCegarLoop]: === Iteration 14 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:40:55,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:40:55,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:40:55,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:40:55,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:40:55,915 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:40:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,962 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:40:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:40:55,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:40:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,963 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:55,963 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:40:55,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:40:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:40:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:40:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:40:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:40:55,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:40:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,967 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:40:55,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:40:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:40:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:40:55,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,968 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:40:55,968 INFO L418 AbstractCegarLoop]: === Iteration 15 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:40:55,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:56,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:56,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:40:56,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:40:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:40:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:40:56,343 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:40:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:56,560 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:40:56,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:40:56,560 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:40:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:56,561 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:40:56,561 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:56,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:40:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:40:56,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:40:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:56,569 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:40:56,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:40:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:40:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:40:56,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:56,572 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:40:56,573 INFO L418 AbstractCegarLoop]: === Iteration 16 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:40:56,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:56,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:40:56,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:59,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:40:59,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:40:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:40:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:40:59,515 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:40:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:59,565 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:40:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:40:59,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:40:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:59,566 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:40:59,566 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:40:59,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:40:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:40:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:40:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:40:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:40:59,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:40:59,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:59,570 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:40:59,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:40:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:40:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:40:59,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:59,571 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:40:59,571 INFO L418 AbstractCegarLoop]: === Iteration 17 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:40:59,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:59,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:40:59,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:41:00,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:41:00,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:41:00,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:41:00,098 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:41:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,140 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:41:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:41:00,140 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:41:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,141 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:41:00,141 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:41:00,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:41:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:41:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:41:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:41:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:41:00,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:41:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,145 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:41:00,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:41:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:41:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:41:00,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,146 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:41:00,146 INFO L418 AbstractCegarLoop]: === Iteration 18 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:41:00,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:41:00,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:41:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:41:00,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:41:00,627 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:41:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,695 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:41:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:41:00,696 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:41:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,696 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:41:00,696 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:41:00,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:41:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:41:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:41:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:41:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:41:00,700 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:41:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,701 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:41:00,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:41:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:41:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:41:00,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,702 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:41:00,702 INFO L418 AbstractCegarLoop]: === Iteration 19 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:41:00,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:01,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:01,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:41:01,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:41:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:41:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:41:01,059 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:41:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:01,102 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:41:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:41:01,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:41:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:01,103 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:41:01,104 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:41:01,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:41:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:41:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:41:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:41:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:41:01,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:41:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:01,108 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:41:01,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:41:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:41:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:41:01,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:01,109 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:41:01,109 INFO L418 AbstractCegarLoop]: === Iteration 20 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:41:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:01,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:41:01,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:41:01,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:41:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:41:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:41:01,611 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:41:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:01,657 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:41:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:41:01,658 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:41:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:01,659 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:41:01,659 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:41:01,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:41:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:41:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:41:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:41:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:41:01,664 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:41:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:01,664 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:41:01,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:41:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:41:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:41:01,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:01,665 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:41:01,665 INFO L418 AbstractCegarLoop]: === Iteration 21 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:41:01,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:01,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:41:01,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:02,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:02,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:41:02,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:41:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:41:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:41:02,348 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:41:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:02,389 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:41:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:41:02,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:41:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:02,390 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:41:02,390 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:41:02,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:41:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:41:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:41:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:41:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:41:02,394 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:41:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:02,394 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:41:02,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:41:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:41:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:41:02,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:02,395 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:41:02,395 INFO L418 AbstractCegarLoop]: === Iteration 22 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:41:02,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:02,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:41:02,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:02,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:02,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:41:02,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:41:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:41:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:41:02,985 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:41:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:03,045 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:41:03,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:41:03,048 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:41:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:03,048 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:41:03,049 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:41:03,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:41:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:41:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:41:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:41:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:41:03,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:41:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:03,052 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:41:03,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:41:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:41:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:41:03,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:03,052 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:41:03,053 INFO L418 AbstractCegarLoop]: === Iteration 23 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:41:03,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:03,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:41:03,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:03,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:03,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:41:03,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:41:03,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:41:03,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:41:03,612 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:41:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:03,652 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:41:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:41:03,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:41:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:03,653 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:41:03,653 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:41:03,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:41:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:41:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:41:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:41:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:41:03,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:41:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:03,657 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:41:03,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:41:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:41:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:41:03,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:03,658 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:41:03,658 INFO L418 AbstractCegarLoop]: === Iteration 24 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:41:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:03,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:41:03,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:04,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:04,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:41:04,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:41:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:41:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:41:04,277 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:41:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:04,359 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:41:04,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:41:04,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:41:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:04,360 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:41:04,360 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:41:04,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:41:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:41:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:41:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:41:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:41:04,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:41:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:04,364 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:41:04,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:41:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:41:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:41:04,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:04,367 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:41:04,367 INFO L418 AbstractCegarLoop]: === Iteration 25 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:04,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:04,367 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:41:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:04,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:41:04,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:06,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:06,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:41:06,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:41:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:41:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:41:06,209 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:41:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:06,257 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:41:06,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:41:06,258 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:41:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:06,258 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:41:06,258 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:41:06,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:41:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:41:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:41:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:41:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:41:06,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:41:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:06,263 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:41:06,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:41:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:41:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:41:06,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:06,264 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:41:06,264 INFO L418 AbstractCegarLoop]: === Iteration 26 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:41:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:06,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:41:06,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:07,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:07,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:41:07,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:41:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:41:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:41:07,204 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:41:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:07,284 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:41:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:41:07,284 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:41:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:07,285 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:41:07,285 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:41:07,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:41:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:41:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:41:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:41:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:41:07,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:41:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:07,289 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:41:07,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:41:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:41:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:41:07,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:07,290 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:41:07,290 INFO L418 AbstractCegarLoop]: === Iteration 27 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:41:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:07,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:41:07,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:09,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:09,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:41:09,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:41:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:41:09,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:41:09,882 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:41:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:10,060 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:41:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:41:10,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:41:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:10,061 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:41:10,061 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:41:10,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:41:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:41:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:41:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:41:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:41:10,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:41:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:10,064 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:41:10,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:41:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:41:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:41:10,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:10,065 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:41:10,065 INFO L418 AbstractCegarLoop]: === Iteration 28 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:41:10,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:10,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:41:10,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:10,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:41:10,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:41:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:41:10,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:41:10,872 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:41:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:10,980 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:41:10,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:41:10,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:41:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:10,981 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:41:10,981 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:41:10,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:41:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:41:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:41:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:41:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:41:10,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:41:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:10,986 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:41:10,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:41:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:41:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:41:10,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:10,987 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:41:10,987 INFO L418 AbstractCegarLoop]: === Iteration 29 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:41:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:11,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:41:11,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:12,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:41:12,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:41:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:41:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:41:12,107 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:41:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:12,165 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:41:12,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:41:12,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:41:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:12,166 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:41:12,167 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:41:12,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:41:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:41:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:41:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:41:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:41:12,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:41:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:12,171 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:41:12,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:41:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:41:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:41:12,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:12,172 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:41:12,172 INFO L418 AbstractCegarLoop]: === Iteration 30 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:41:12,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:12,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:41:12,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:13,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:41:13,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:41:13,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:41:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:41:13,316 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:41:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:13,366 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:41:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:41:13,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:41:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:13,367 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:41:13,367 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:41:13,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:41:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:41:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:41:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:41:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:41:13,371 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:41:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:13,371 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:41:13,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:41:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:41:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:41:13,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:13,372 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:41:13,372 INFO L418 AbstractCegarLoop]: === Iteration 31 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:41:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:13,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:41:13,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:14,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:14,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:41:14,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:41:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:41:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:41:14,245 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:41:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:14,301 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:41:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:41:14,302 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:41:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:14,302 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:41:14,302 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:41:14,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:41:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:41:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:41:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:41:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:41:14,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:41:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:14,305 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:41:14,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:41:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:41:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:41:14,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:14,306 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:41:14,306 INFO L418 AbstractCegarLoop]: === Iteration 32 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:41:14,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:14,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:41:14,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:15,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:15,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:41:15,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:41:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:41:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:41:15,433 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:41:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:15,495 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:41:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:41:15,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:41:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:15,496 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:41:15,497 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:41:15,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:41:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:41:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:41:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:41:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:41:15,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:41:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:15,501 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:41:15,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:41:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:41:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:41:15,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:15,501 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:41:15,502 INFO L418 AbstractCegarLoop]: === Iteration 33 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:15,502 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:41:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:15,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:41:15,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:16,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:16,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:41:16,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:41:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:41:16,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:41:16,339 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:41:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:16,401 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:41:16,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:41:16,401 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:41:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:16,402 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:41:16,402 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:41:16,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:41:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:41:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:41:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:41:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:41:16,405 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:41:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:16,406 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:41:16,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:41:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:41:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:41:16,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:16,406 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:41:16,407 INFO L418 AbstractCegarLoop]: === Iteration 34 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:41:16,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:16,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:41:16,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:17,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:17,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:41:17,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:41:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:41:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:41:17,371 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:41:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:17,427 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:41:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:41:17,428 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:41:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:17,428 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:41:17,428 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:41:17,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:41:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:41:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:41:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:41:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:41:17,432 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:41:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:17,432 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:41:17,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:41:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:41:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:41:17,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:17,433 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:41:17,433 INFO L418 AbstractCegarLoop]: === Iteration 35 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:17,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:41:17,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:17,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:41:17,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:18,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:18,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:41:18,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:41:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:41:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:41:18,365 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:41:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:18,426 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:41:18,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:41:18,426 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:41:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:18,427 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:41:18,427 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:41:18,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:41:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:41:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:41:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:41:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:41:18,431 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:41:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:18,431 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:41:18,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:41:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:41:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:41:18,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:18,432 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:41:18,432 INFO L418 AbstractCegarLoop]: === Iteration 36 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:41:18,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:18,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:41:18,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:41:19,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:41:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:41:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:41:19,362 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:41:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:19,439 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:41:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:41:19,439 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:41:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:19,440 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:41:19,440 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:41:19,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:41:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:41:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:41:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:41:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:41:19,443 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:41:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:19,443 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:41:19,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:41:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:41:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:41:19,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:19,444 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:41:19,444 INFO L418 AbstractCegarLoop]: === Iteration 37 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:41:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:19,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:41:19,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:21,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:41:21,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:41:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:41:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:41:21,024 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:41:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:21,138 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:41:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:41:21,139 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:41:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:21,139 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:41:21,139 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:41:21,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:41:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:41:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:41:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:41:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:41:21,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:41:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:21,142 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:41:21,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:41:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:41:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:41:21,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:21,142 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:41:21,143 INFO L418 AbstractCegarLoop]: === Iteration 38 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:41:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:21,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:41:21,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:22,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:41:22,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:41:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:41:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:41:22,451 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:41:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:22,522 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:41:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:41:22,522 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:41:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:22,523 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:41:22,523 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:41:22,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:41:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:41:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:41:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:41:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:41:22,526 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:41:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:22,526 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:41:22,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:41:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:41:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:41:22,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:22,527 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:41:22,527 INFO L418 AbstractCegarLoop]: === Iteration 39 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:41:22,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:22,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:41:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:24,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:41:24,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:41:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:41:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:41:24,032 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:41:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:24,114 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:41:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:41:24,114 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:41:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:24,115 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:41:24,115 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:41:24,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:41:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:41:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:41:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:41:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:41:24,118 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:41:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:24,118 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:41:24,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:41:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:41:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:41:24,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:24,119 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:41:24,120 INFO L418 AbstractCegarLoop]: === Iteration 40 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:41:24,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:24,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:41:24,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:25,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:25,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:41:25,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:41:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:41:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:41:25,454 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:41:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:25,565 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:41:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:41:25,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:41:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:25,566 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:41:25,566 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:41:25,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:41:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:41:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:41:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:41:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:41:25,569 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:41:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:25,570 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:41:25,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:41:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:41:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:41:25,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:25,570 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:41:25,570 INFO L418 AbstractCegarLoop]: === Iteration 41 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:41:25,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:25,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:41:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:26,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:26,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:41:26,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:41:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:41:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:41:26,659 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:41:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:26,728 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:41:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:41:26,728 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:41:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:26,729 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:41:26,729 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:41:26,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:41:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:41:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:41:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:41:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:41:26,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:41:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:26,732 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:41:26,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:41:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:41:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:41:26,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:26,733 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:41:26,733 INFO L418 AbstractCegarLoop]: === Iteration 42 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:41:26,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:26,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:41:26,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:41:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:41:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:41:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:41:28,037 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:41:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:28,109 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:41:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:41:28,109 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:41:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:28,110 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:41:28,110 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:41:28,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:41:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:41:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:41:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:41:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:41:28,114 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:41:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:28,114 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:41:28,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:41:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:41:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:41:28,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:28,115 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:41:28,115 INFO L418 AbstractCegarLoop]: === Iteration 43 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:41:28,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:28,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:41:28,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:29,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:29,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:41:29,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:41:29,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:41:29,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:41:29,299 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:41:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:29,376 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:41:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:41:29,376 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:41:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:29,377 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:41:29,377 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:41:29,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:41:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:41:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:41:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:41:29,380 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:41:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:29,380 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:41:29,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:41:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:41:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:41:29,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:29,381 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:41:29,381 INFO L418 AbstractCegarLoop]: === Iteration 44 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:41:29,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:29,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:41:29,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:30,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:30,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:41:30,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:41:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:41:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:41:30,905 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:41:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:30,984 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:41:30,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:41:30,984 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:41:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:30,985 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:30,985 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:41:30,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:41:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:41:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:41:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:41:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:41:30,988 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:41:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:30,989 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:41:30,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:41:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:41:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:41:30,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:30,990 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:41:30,990 INFO L418 AbstractCegarLoop]: === Iteration 45 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:41:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:31,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:41:31,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:32,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:32,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:41:32,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:41:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:41:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:41:32,284 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:41:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:32,400 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:41:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:41:32,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:41:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:32,401 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:41:32,401 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:32,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:41:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:41:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:41:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:41:32,404 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:41:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:32,405 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:41:32,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:41:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:41:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:41:32,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:32,406 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:41:32,406 INFO L418 AbstractCegarLoop]: === Iteration 46 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:41:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:32,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:41:32,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:33,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:33,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:41:33,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:41:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:41:33,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:41:33,774 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:41:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:34,101 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:41:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:41:34,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:41:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:34,102 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:41:34,102 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:41:34,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:41:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:41:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:41:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:41:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:41:34,104 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:41:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:34,105 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:41:34,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:41:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:41:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:41:34,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:34,105 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:41:34,105 INFO L418 AbstractCegarLoop]: === Iteration 47 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:41:34,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:41:34,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:35,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:35,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:41:35,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:41:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:41:35,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:41:35,786 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:41:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:35,871 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:41:35,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:41:35,872 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:41:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:35,873 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:41:35,873 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:41:35,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:41:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:41:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:41:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:41:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:41:35,876 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:41:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:35,876 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:41:35,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:41:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:41:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:41:35,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:35,877 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:41:35,877 INFO L418 AbstractCegarLoop]: === Iteration 48 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:41:35,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:35,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:41:35,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:37,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:41:37,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:41:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:41:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:41:37,299 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:41:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:37,383 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:41:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:41:37,383 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:41:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:37,384 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:41:37,384 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:41:37,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:41:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:41:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:41:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:41:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:41:37,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:41:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:41:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:41:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:41:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:41:37,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:37,388 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:41:37,389 INFO L418 AbstractCegarLoop]: === Iteration 49 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:41:37,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:37,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:41:37,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:38,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:38,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:41:38,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:41:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:41:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:41:38,937 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:41:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:39,038 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:41:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:41:39,039 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:41:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:39,039 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:41:39,039 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:41:39,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:41:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:41:39,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:41:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:41:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:41:39,042 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:41:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:39,043 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:41:39,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:41:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:41:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:41:39,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:39,043 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:41:39,044 INFO L418 AbstractCegarLoop]: === Iteration 50 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:41:39,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:39,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:41:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:41,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:41,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:41:41,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:41:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:41:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:41:41,536 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:41:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:41,632 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:41:41,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:41:41,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:41:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:41,633 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:41:41,633 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:41:41,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:41:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:41:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:41:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:41:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:41:41,636 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:41:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:41,637 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:41:41,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:41:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:41:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:41:41,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:41,637 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:41:41,638 INFO L418 AbstractCegarLoop]: === Iteration 51 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:41:41,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:41,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:41:41,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:43,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:43,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:41:43,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:41:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:41:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:41:43,219 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:41:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:43,329 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:41:43,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:41:43,330 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:41:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:43,331 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:41:43,331 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:41:43,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:41:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:41:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:41:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:41:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:41:43,334 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:41:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:43,334 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:41:43,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:41:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:41:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:41:43,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:43,335 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:41:43,335 INFO L418 AbstractCegarLoop]: === Iteration 52 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:41:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:43,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:41:43,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:45,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:45,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:41:45,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:41:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:41:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:41:45,109 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:41:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:45,214 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:41:45,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:41:45,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:41:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:45,215 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:41:45,215 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:41:45,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:41:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:41:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:41:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:41:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:41:45,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:41:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:45,218 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:41:45,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:41:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:41:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:41:45,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:45,219 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:41:45,219 INFO L418 AbstractCegarLoop]: === Iteration 53 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:41:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:45,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:41:45,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:47,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:47,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:41:47,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:41:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:41:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:41:47,141 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:41:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:47,233 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:41:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:41:47,233 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:41:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:47,234 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:41:47,235 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:41:47,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:41:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:41:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:41:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:41:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:41:47,238 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:41:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:47,238 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:41:47,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:41:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:41:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:41:47,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:47,239 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:41:47,239 INFO L418 AbstractCegarLoop]: === Iteration 54 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:47,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:41:47,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:47,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:41:47,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:48,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:41:48,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:41:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:41:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:41:48,990 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:41:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:49,130 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:41:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:41:49,130 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:41:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:49,131 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:41:49,131 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:41:49,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:41:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:41:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:41:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:41:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:41:49,134 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:41:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:49,134 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:41:49,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:41:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:41:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:41:49,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:49,135 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:41:49,135 INFO L418 AbstractCegarLoop]: === Iteration 55 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:41:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:49,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:41:49,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:51,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:41:51,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:41:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:41:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:41:51,179 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:41:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:51,274 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:41:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:41:51,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:41:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:51,275 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:41:51,275 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:41:51,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:41:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:41:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:41:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:41:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:41:51,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:41:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:51,279 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:41:51,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:41:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:41:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:41:51,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:51,279 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:41:51,280 INFO L418 AbstractCegarLoop]: === Iteration 56 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:41:51,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:51,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:41:51,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:53,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:41:53,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:41:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:41:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:41:53,144 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:41:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:53,253 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:41:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:41:53,253 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:41:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:53,254 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:41:53,254 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:41:53,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:41:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:41:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:41:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:41:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:41:53,257 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:41:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:53,257 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:41:53,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:41:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:41:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:41:53,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:53,258 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:41:53,258 INFO L418 AbstractCegarLoop]: === Iteration 57 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:41:53,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:53,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:41:53,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:55,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:55,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:41:55,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:41:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:41:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:41:55,249 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:41:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:55,369 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:41:55,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:41:55,370 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:41:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:55,370 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:41:55,371 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:41:55,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:41:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:41:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:41:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:41:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:41:55,373 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:41:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:55,374 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:41:55,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:41:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:41:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:41:55,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:55,375 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:41:55,375 INFO L418 AbstractCegarLoop]: === Iteration 58 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:41:55,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:55,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:41:55,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:57,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:57,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:41:57,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:41:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:41:57,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:41:57,570 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:41:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:57,677 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:41:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:41:57,678 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:41:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:57,679 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:41:57,679 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:41:57,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:41:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:41:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:41:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:41:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:41:57,682 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:41:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:57,683 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:41:57,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:41:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:41:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:41:57,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:57,683 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:41:57,684 INFO L418 AbstractCegarLoop]: === Iteration 59 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:41:57,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:57,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:41:57,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:00,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:42:00,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:42:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:42:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:42:00,752 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:42:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:00,863 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:42:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:42:00,864 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:42:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:00,865 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:42:00,865 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:42:00,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:42:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:42:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:42:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:42:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:42:00,867 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:42:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:00,868 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:42:00,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:42:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:42:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:42:00,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:00,869 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:42:00,869 INFO L418 AbstractCegarLoop]: === Iteration 60 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:00,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:00,869 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:42:00,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:00,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:42:00,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:03,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:03,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:42:03,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:42:03,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:42:03,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:42:03,195 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:42:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:03,299 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:42:03,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:42:03,299 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:42:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:03,300 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:42:03,300 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:42:03,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:42:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:42:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:42:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:42:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:42:03,303 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:42:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:03,303 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:42:03,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:42:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:42:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:42:03,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:03,304 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:42:03,304 INFO L418 AbstractCegarLoop]: === Iteration 61 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:42:03,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:03,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:42:03,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:05,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:05,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:42:05,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:42:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:42:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:42:05,526 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:42:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:05,631 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:42:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:42:05,632 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:42:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:05,633 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:42:05,633 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:42:05,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:42:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:42:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:42:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:42:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:42:05,636 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:42:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:05,636 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:42:05,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:42:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:42:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:42:05,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:05,637 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:42:05,637 INFO L418 AbstractCegarLoop]: === Iteration 62 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:42:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:05,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:42:05,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:08,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:08,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:42:08,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:42:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:42:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:42:08,206 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:42:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:08,341 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:42:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:42:08,341 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:42:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:08,342 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:42:08,342 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:42:08,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:42:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:42:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:42:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:42:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:42:08,344 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:42:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:08,345 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:42:08,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:42:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:42:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:42:08,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:08,345 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:42:08,346 INFO L418 AbstractCegarLoop]: === Iteration 63 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:42:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:08,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:42:08,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:10,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:10,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:42:10,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:42:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:42:10,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:42:10,595 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:42:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:10,703 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:42:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:42:10,703 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:42:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:10,704 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:42:10,704 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:42:10,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:42:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:42:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:42:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:42:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:42:10,707 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:42:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:10,708 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:42:10,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:42:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:42:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:42:10,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:10,708 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:42:10,709 INFO L418 AbstractCegarLoop]: === Iteration 64 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:42:10,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:10,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:42:10,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:13,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:13,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:42:13,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:42:13,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:42:13,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:42:13,468 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:42:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:13,583 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:42:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:42:13,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:42:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:13,585 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:42:13,585 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:42:13,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:42:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:42:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:42:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:42:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:42:13,588 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:42:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:13,589 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:42:13,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:42:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:42:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:42:13,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:13,589 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:42:13,590 INFO L418 AbstractCegarLoop]: === Iteration 65 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:42:13,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:13,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:42:13,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:42:16,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:42:16,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:42:16,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:42:16,006 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:42:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:16,149 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:42:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:42:16,149 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:42:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:16,150 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:42:16,150 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:42:16,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:42:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:42:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:42:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:42:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:42:16,153 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:42:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:16,153 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:42:16,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:42:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:42:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:42:16,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:16,154 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:42:16,154 INFO L418 AbstractCegarLoop]: === Iteration 66 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:42:16,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:16,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:42:16,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:18,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:18,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:42:18,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:42:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:42:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:42:18,933 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:42:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,062 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:42:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:42:19,062 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:42:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,063 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:42:19,063 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:42:19,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:42:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:42:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:42:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:42:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:42:19,066 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:42:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,066 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:42:19,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:42:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:42:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:42:19,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,067 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:42:19,067 INFO L418 AbstractCegarLoop]: === Iteration 67 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:42:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:22,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:22,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:42:22,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:42:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:42:22,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:42:22,652 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:42:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:22,767 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:42:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:42:22,767 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:42:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:22,768 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:42:22,768 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:42:22,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:42:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:42:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:42:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:42:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:42:22,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:42:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:22,770 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:42:22,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:42:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:42:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:42:22,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:22,771 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:42:22,771 INFO L418 AbstractCegarLoop]: === Iteration 68 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:42:22,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:22,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:42:22,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:25,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:42:25,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:42:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:42:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:42:25,387 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:42:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,506 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:42:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:42:25,507 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:42:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,508 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:42:25,508 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:42:25,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:42:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:42:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:42:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:42:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:42:25,511 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:42:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,511 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:42:25,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:42:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:42:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:42:25,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,512 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:42:25,512 INFO L418 AbstractCegarLoop]: === Iteration 69 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:42:25,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:28,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:28,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:42:28,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:42:28,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:42:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:42:28,429 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:42:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:28,558 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:42:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:42:28,559 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:42:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:28,560 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:42:28,560 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:42:28,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:42:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:42:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:42:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:42:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:42:28,564 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:42:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:28,564 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:42:28,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:42:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:42:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:42:28,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:28,565 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:42:28,565 INFO L418 AbstractCegarLoop]: === Iteration 70 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:42:28,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:28,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:42:28,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:31,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:42:31,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:42:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:42:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:42:31,298 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:42:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:31,465 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:42:31,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:42:31,466 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:42:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:31,467 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:42:31,467 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:42:31,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:42:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:42:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:42:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:42:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:42:31,472 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:42:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:31,473 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:42:31,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:42:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:42:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:42:31,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:31,474 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:42:31,474 INFO L418 AbstractCegarLoop]: === Iteration 71 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:42:31,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:31,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:42:31,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:34,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:34,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:42:34,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:42:34,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:42:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:42:34,987 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:42:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:35,778 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:42:35,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:42:35,778 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:42:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:35,779 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:42:35,779 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:42:35,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:42:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:42:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:42:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:42:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:42:35,782 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:42:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:35,782 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:42:35,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:42:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:42:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:42:35,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:35,784 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:42:35,784 INFO L418 AbstractCegarLoop]: === Iteration 72 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:42:35,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:35,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:42:35,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:39,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:39,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:42:39,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:42:39,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:42:39,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:39,078 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:42:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:39,220 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:42:39,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:42:39,220 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:42:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:39,221 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:42:39,222 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:42:39,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:42:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:42:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:42:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:42:39,225 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:42:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:39,225 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:42:39,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:42:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:42:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:42:39,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:39,226 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:42:39,226 INFO L418 AbstractCegarLoop]: === Iteration 73 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:42:39,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:39,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:42:39,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:42,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:42,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:42:42,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:42:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:42:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:42,713 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:42:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:42,850 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:42:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:42:42,851 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:42:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:42,852 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:42:42,852 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:42:42,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:42:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:42:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:42:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:42:42,855 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:42:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:42,855 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:42:42,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:42:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:42:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:42:42,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:42,856 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:42:42,857 INFO L418 AbstractCegarLoop]: === Iteration 74 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:42,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:42:42,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:42,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:42:42,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:46,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:46,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:42:46,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:42:46,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:42:46,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:46,019 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:42:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:46,190 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:42:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:42:46,190 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:42:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:46,191 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:42:46,191 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:42:46,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:42:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:42:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:42:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:42:46,193 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:42:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:46,194 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:42:46,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:42:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:42:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:42:46,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:46,195 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:42:46,195 INFO L418 AbstractCegarLoop]: === Iteration 75 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:46,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:42:46,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:46,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:42:46,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:49,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:49,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:42:49,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:42:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:42:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:49,458 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:42:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:49,599 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:42:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:42:49,599 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:42:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:49,600 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:42:49,600 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:42:49,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:42:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:42:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:42:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:42:49,603 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:42:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:49,603 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:42:49,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:42:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:42:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:42:49,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:49,604 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:42:49,604 INFO L418 AbstractCegarLoop]: === Iteration 76 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:42:49,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:49,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:42:49,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:42:53,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:42:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:42:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:53,081 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:42:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:53,234 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:42:53,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:42:53,234 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:42:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:53,235 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:42:53,235 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:42:53,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:42:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:42:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:42:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:42:53,238 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:42:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:53,239 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:42:53,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:42:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:42:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:42:53,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:53,239 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:42:53,240 INFO L418 AbstractCegarLoop]: === Iteration 77 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:42:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:53,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:42:53,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:42:58,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:42:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:42:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:58,327 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:42:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:58,484 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:42:58,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:42:58,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:42:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:58,485 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:42:58,485 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:42:58,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:42:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:42:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:42:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:42:58,488 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:42:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:58,488 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:42:58,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:42:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:42:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:42:58,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:58,489 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:42:58,489 INFO L418 AbstractCegarLoop]: === Iteration 78 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:42:58,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:58,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:42:58,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:01,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:01,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:01,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:43:01,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:43:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:43:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:43:01,818 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:43:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:02,054 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:43:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:43:02,055 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:43:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:02,056 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:43:02,056 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:43:02,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:43:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:43:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:43:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:43:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:43:02,058 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:43:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:02,059 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:43:02,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:43:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:43:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:43:02,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:02,060 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:43:02,060 INFO L418 AbstractCegarLoop]: === Iteration 79 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 10:43:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:02,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:43:02,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:43:05,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:43:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:43:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:43:05,888 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:43:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:06,129 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:43:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:43:06,129 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:43:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:06,130 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:43:06,130 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:43:06,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:43:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:43:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:43:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:43:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:43:06,133 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:43:06,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:06,134 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:43:06,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:43:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:43:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:43:06,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:06,135 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:43:06,135 INFO L418 AbstractCegarLoop]: === Iteration 80 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 10:43:06,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:06,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:43:06,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:09,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:09,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:43:09,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:43:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:43:09,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:43:09,928 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:43:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:10,085 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:43:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:43:10,085 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:43:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:10,086 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:43:10,086 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:43:10,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:43:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:43:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:43:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:43:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:43:10,089 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:43:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:10,089 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:43:10,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:43:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:43:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:43:10,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:10,090 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:43:10,090 INFO L418 AbstractCegarLoop]: === Iteration 81 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 10:43:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:10,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:43:10,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:14,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:14,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:43:14,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:43:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:43:14,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:43:14,378 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:43:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:14,550 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:43:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:43:14,550 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:43:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:14,551 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:43:14,551 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:43:14,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:43:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:43:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:43:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:43:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:43:14,554 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:43:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:14,554 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:43:14,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:43:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:43:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:43:14,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:14,555 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:43:14,556 INFO L418 AbstractCegarLoop]: === Iteration 82 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 10:43:14,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:14,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:43:14,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:18,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:18,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:43:18,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:43:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:43:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:43:18,944 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:43:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:19,266 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:43:19,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:43:19,267 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:43:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:19,268 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:43:19,268 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:43:19,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:43:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:43:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:43:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:43:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:43:19,270 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:43:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:19,271 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:43:19,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:43:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:43:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:43:19,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:19,271 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:43:19,272 INFO L418 AbstractCegarLoop]: === Iteration 83 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 10:43:19,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:19,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:43:19,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:23,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:23,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:43:23,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:43:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:43:23,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:43:23,898 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:43:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:24,049 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:43:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:43:24,050 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:43:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:24,050 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:43:24,051 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:43:24,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:43:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:43:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:43:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:43:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:43:24,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:43:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:24,054 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:43:24,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:43:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:43:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:43:24,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:24,055 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:43:24,055 INFO L418 AbstractCegarLoop]: === Iteration 84 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 10:43:24,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:24,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:43:24,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:43:27,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:43:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:43:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:43:27,940 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:43:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,215 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:43:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:43:28,216 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:43:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,217 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:43:28,217 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:43:28,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:43:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:43:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:43:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:43:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:43:28,220 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:43:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,220 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:43:28,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:43:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:43:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:43:28,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,221 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:43:28,221 INFO L418 AbstractCegarLoop]: === Iteration 85 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 10:43:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:43:32,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:43:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:43:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:43:32,205 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:43:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,366 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:43:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:43:32,366 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:43:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,367 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:43:32,367 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:43:32,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:43:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:43:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:43:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:43:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:43:32,370 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:43:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,370 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:43:32,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:43:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:43:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:43:32,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,372 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:43:32,372 INFO L418 AbstractCegarLoop]: === Iteration 86 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 10:43:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:43:36,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:43:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:43:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:43:36,710 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:43:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,946 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:43:36,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:43:36,947 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:43:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,947 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:43:36,948 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:43:36,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:43:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:43:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:43:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:43:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:43:36,951 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:43:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,951 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:43:36,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:43:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:43:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:43:36,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,952 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:43:36,952 INFO L418 AbstractCegarLoop]: === Iteration 87 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 10:43:36,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:43:41,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:43:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:43:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:43:41,233 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:43:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:41,407 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:43:41,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:43:41,407 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:43:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:41,408 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:43:41,408 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:43:41,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:43:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:43:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:43:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:43:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:43:41,411 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:43:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:41,411 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:43:41,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:43:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:43:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:43:41,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:41,412 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:43:41,412 INFO L418 AbstractCegarLoop]: === Iteration 88 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 10:43:41,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:41,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:43:41,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:46,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:46,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:43:46,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:43:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:43:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:43:46,033 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:43:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:46,215 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:43:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:43:46,216 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:43:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:46,217 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:43:46,217 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:43:46,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:43:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:43:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:43:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:43:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:43:46,221 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:43:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:46,221 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:43:46,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:43:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:43:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:43:46,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:46,222 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:43:46,222 INFO L418 AbstractCegarLoop]: === Iteration 89 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 10:43:46,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:46,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:43:46,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:51,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:51,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:43:51,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:43:51,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:43:51,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:43:51,182 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:43:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:51,346 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:43:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:43:51,346 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:43:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,347 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:43:51,347 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:43:51,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:43:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:43:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:43:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:43:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:43:51,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:43:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,351 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:43:51,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:43:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:43:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:43:51,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,351 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:43:51,351 INFO L418 AbstractCegarLoop]: === Iteration 90 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 10:43:51,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:43:56,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:43:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:43:56,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:43:56,036 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:43:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,210 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:43:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:43:56,211 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:43:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,211 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:43:56,212 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:43:56,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:43:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:43:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:43:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:43:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:43:56,215 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:43:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,215 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:43:56,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:43:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:43:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:43:56,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,216 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:43:56,216 INFO L418 AbstractCegarLoop]: === Iteration 91 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 10:43:56,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 184 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:44:01,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:44:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:44:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:44:01,171 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:44:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,644 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:44:01,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:44:01,645 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:44:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,646 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:44:01,646 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:44:01,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:44:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:44:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:44:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:44:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:44:01,650 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:44:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,650 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:44:01,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:44:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:44:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:44:01,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,651 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:44:01,651 INFO L418 AbstractCegarLoop]: === Iteration 92 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 10:44:01,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:06,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:44:06,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:44:06,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:44:06,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:44:06,500 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:44:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,671 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:44:06,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:44:06,671 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:44:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,672 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:44:06,672 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:44:06,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:44:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:44:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:44:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:44:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:44:06,675 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:44:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,675 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:44:06,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:44:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:44:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:44:06,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,676 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:44:06,676 INFO L418 AbstractCegarLoop]: === Iteration 93 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 10:44:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:44:11,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:44:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:44:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:44:11,611 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:44:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,793 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:44:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:44:11,793 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:44:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,794 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:44:11,794 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:44:11,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:44:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:44:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:44:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:44:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:44:11,797 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:44:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,797 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:44:11,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:44:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:44:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:44:11,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,797 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:44:11,798 INFO L418 AbstractCegarLoop]: === Iteration 94 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 10:44:11,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:44:16,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:44:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:44:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:44:16,821 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:44:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,999 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:44:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:44:16,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:44:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,000 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:44:17,000 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:44:17,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:44:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:44:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:44:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:44:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:44:17,003 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:44:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,003 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:44:17,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:44:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:44:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:44:17,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,004 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:44:17,004 INFO L418 AbstractCegarLoop]: === Iteration 95 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 10:44:17,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:22,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:22,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:44:22,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:44:22,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:44:22,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:44:22,060 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:44:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:22,245 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:44:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:44:22,246 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:44:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:22,247 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:44:22,247 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:44:22,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:44:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:44:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:44:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:44:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:44:22,250 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:44:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:22,251 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:44:22,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:44:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:44:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:44:22,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:22,252 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:44:22,252 INFO L418 AbstractCegarLoop]: === Iteration 96 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 10:44:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:22,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:44:22,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:44:27,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:44:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:44:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:44:27,619 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:44:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,812 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:44:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:44:27,813 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:44:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,813 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:44:27,814 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:44:27,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:44:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:44:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:44:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:44:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:44:27,816 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:44:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,816 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:44:27,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:44:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:44:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:44:27,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,817 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:44:27,817 INFO L418 AbstractCegarLoop]: === Iteration 97 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:27,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 10:44:27,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 196 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:44:33,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:44:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:44:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:44:33,159 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:44:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,393 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:44:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:44:33,393 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:44:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,394 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:44:33,394 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:44:33,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:44:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:44:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:44:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:44:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:44:33,397 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:44:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,398 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:44:33,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:44:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:44:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:44:33,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,399 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:44:33,399 INFO L418 AbstractCegarLoop]: === Iteration 98 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 10:44:33,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:44:38,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:44:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:44:38,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:44:38,911 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:44:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,128 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:44:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:44:39,128 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:44:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,130 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:44:39,130 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:44:39,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:44:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:44:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:44:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:44:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:44:39,133 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:44:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,133 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:44:39,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:44:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:44:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:44:39,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,134 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:44:39,134 INFO L418 AbstractCegarLoop]: === Iteration 99 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 10:44:39,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:44,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:44,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:44:44,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:44:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:44:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:44:44,658 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:44:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,086 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:44:45,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:44:45,087 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:44:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,088 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:44:45,088 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:44:45,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:44:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:44:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:44:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:44:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:44:45,092 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:44:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,092 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:44:45,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:44:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:44:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:44:45,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,093 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:44:45,093 INFO L418 AbstractCegarLoop]: === Iteration 100 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 10:44:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:44:50,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:44:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:44:50,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:44:50,767 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:44:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:50,995 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:44:50,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:44:50,996 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:44:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:50,997 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:44:50,997 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:44:50,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:44:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:44:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:44:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:44:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:44:51,002 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:44:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:51,002 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:44:51,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:44:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:44:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:44:51,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:51,003 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:44:51,003 INFO L418 AbstractCegarLoop]: === Iteration 101 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 10:44:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:51,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:44:51,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:44:52,786 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:44:52,787 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:44:52,791 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:44:52,791 INFO L202 PluginConnector]: Adding new model WaterTank2-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:44:52 BoogieIcfgContainer [2019-08-05 10:44:52,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:44:52,793 INFO L168 Benchmark]: Toolchain (without parser) took 243207.33 ms. Allocated memory was 133.2 MB in the beginning and 772.3 MB in the end (delta: 639.1 MB). Free memory was 109.4 MB in the beginning and 287.2 MB in the end (delta: -177.8 MB). Peak memory consumption was 461.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,794 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.05 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.43 ms. Allocated memory is still 133.2 MB. Free memory was 109.4 MB in the beginning and 107.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,795 INFO L168 Benchmark]: Boogie Preprocessor took 20.54 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,796 INFO L168 Benchmark]: RCFGBuilder took 320.29 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 97.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,797 INFO L168 Benchmark]: TraceAbstraction took 242826.82 ms. Allocated memory was 133.2 MB in the beginning and 772.3 MB in the end (delta: 639.1 MB). Free memory was 96.8 MB in the beginning and 287.2 MB in the end (delta: -190.3 MB). Peak memory consumption was 448.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,800 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 1.05 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.43 ms. Allocated memory is still 133.2 MB. Free memory was 109.4 MB in the beginning and 107.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.54 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 320.29 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 97.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242826.82 ms. Allocated memory was 133.2 MB in the beginning and 772.3 MB in the end (delta: 639.1 MB). Free memory was 96.8 MB in the beginning and 287.2 MB in the end (delta: -190.3 MB). Peak memory consumption was 448.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 104 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 242.7s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 301 SDtfs, 0 SDslu, 1342 SDs, 0 SdLazy, 6342 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5150 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5050 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 217.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 100 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 223.8s InterpolantComputationTime, 5250 NumberOfCodeBlocks, 5250 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 5150 ConstructedInterpolants, 5149 QuantifiedInterpolants, 4879674 SizeOfPredicates, 5052 NumberOfNonLiveVariables, 31100 ConjunctsInSsa, 10300 ConjunctsInUnsatCore, 100 InterpolantComputations, 1 PerfectInterpolantSequences, 0/166650 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown