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/WaterTank1-NumberVariables.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:39:37,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:39:37,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:39:37,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:39:37,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:39:37,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:39:37,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:39:37,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:39:37,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:39:37,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:39:37,427 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:39:37,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:39:37,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:39:37,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:39:37,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:39:37,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:39:37,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:39:37,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:39:37,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:39:37,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:39:37,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:39:37,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:39:37,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:39:37,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:39:37,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:39:37,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:39:37,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:39:37,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:39:37,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:39:37,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:39:37,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:39:37,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:39:37,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:39:37,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:39:37,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:39:37,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:39:37,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:39:37,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:39:37,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:39:37,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:39:37,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:39:37,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:39:37,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:39:37,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:39:37,509 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:39:37,509 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:39:37,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/WaterTank1-NumberVariables.bpl [2019-08-05 10:39:37,511 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/WaterTank1-NumberVariables.bpl' [2019-08-05 10:39:37,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:39:37,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:39:37,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:37,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:39:37,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:39:37,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,588 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:39:37,588 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:39:37,589 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:39:37,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:37,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:39:37,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:39:37,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:39:37,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/1) ... [2019-08-05 10:39:37,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:39:37,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:39:37,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:39:37,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:39:37,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (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:39:37,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure waterTank given in one single declaration [2019-08-05 10:39:37,689 INFO L130 BoogieDeclarations]: Found specification of procedure waterTank [2019-08-05 10:39:37,689 INFO L138 BoogieDeclarations]: Found implementation of procedure waterTank [2019-08-05 10:39:37,913 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:39:37,913 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:39:37,914 INFO L202 PluginConnector]: Adding new model WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:37 BoogieIcfgContainer [2019-08-05 10:39:37,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:39:37,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:39:37,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:39:37,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:39:37,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:37" (1/2) ... [2019-08-05 10:39:37,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac4a3 and model type WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:39:37, skipping insertion in model container [2019-08-05 10:39:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:37" (2/2) ... [2019-08-05 10:39:37,922 INFO L109 eAbstractionObserver]: Analyzing ICFG WaterTank1-NumberVariables.bpl [2019-08-05 10:39:37,932 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:39:37,939 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:39:37,953 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:39:37,977 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:39:37,978 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:39:37,978 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:39:37,978 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:39:37,978 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:39:37,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:39:37,979 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:39:37,979 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:39:37,979 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:39:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:39:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:39:38,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:38,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:39:38,008 INFO L418 AbstractCegarLoop]: === Iteration 1 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:39:38,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:38,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:39:38,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:38,193 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:39:38,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:38,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:39:38,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:38,230 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:39:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:38,306 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:39:38,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:38,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:39:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:38,321 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:38,321 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:39:38,324 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:39:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:39:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:39:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:39:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:39:38,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:39:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:38,372 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:39:38,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:39:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:39:38,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:38,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:39:38,374 INFO L418 AbstractCegarLoop]: === Iteration 2 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:39:38,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:38,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:39:38,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:38,500 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:39:38,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:38,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:39:38,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:39:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:39:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:38,503 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:39:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:38,546 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:39:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:39:38,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:39:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:38,547 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:39:38,547 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:39:38,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:39:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:39:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:39:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:39:38,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:39:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:38,551 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:39:38,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:39:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:39:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:39:38,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:38,552 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:39:38,553 INFO L418 AbstractCegarLoop]: === Iteration 3 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:39:38,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:38,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:39:38,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:38,755 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:39:38,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:38,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:39:38,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:39:38,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:39:38,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:38,757 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:39:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:38,812 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:39:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:38,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:39:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:38,813 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:39:38,813 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:39:38,814 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:39:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:39:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:39:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:39:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:39:38,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:39:38,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:38,817 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:39:38,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:39:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:39:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:39:38,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:38,818 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:39:38,818 INFO L418 AbstractCegarLoop]: === Iteration 4 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:39:38,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:38,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:39:38,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:39,080 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:39:39,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:39:39,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:39:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:39:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:39,082 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:39:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:39,111 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:39:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:39:39,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:39:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:39,112 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:39:39,112 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:39:39,113 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:39:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:39:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:39:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:39:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:39:39,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:39:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:39,115 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:39:39,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:39:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:39:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:39:39,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:39,116 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:39:39,116 INFO L418 AbstractCegarLoop]: === Iteration 5 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:39:39,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:39,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:39:39,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:39,514 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:39:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:39:39,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:39:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:39:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:39,516 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:39:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:39,549 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:39:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:39,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:39:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:39,551 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:39:39,551 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:39:39,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:39:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:39:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:39:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:39:39,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:39:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:39,554 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:39:39,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:39:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:39:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:39:39,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:39,555 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:39:39,557 INFO L418 AbstractCegarLoop]: === Iteration 6 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:39:39,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:39,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:39:39,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:39,846 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:39:39,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:39,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:39:39,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:39:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:39:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:39,848 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:39:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:39,912 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:39:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:39:39,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:39:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:39,913 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:39:39,913 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:39:39,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:39:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:39:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:39:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:39:39,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:39:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:39,917 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:39:39,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:39:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:39:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:39:39,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:39,917 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:39:39,918 INFO L418 AbstractCegarLoop]: === Iteration 7 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:39:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:39,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:39:39,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:40,175 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:39:40,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:40,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:39:40,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:39:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:39:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:40,176 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:39:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:40,277 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:39:40,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:39:40,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:39:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:40,278 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:39:40,278 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:39:40,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:39:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:39:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:39:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:39:40,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:39:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:40,281 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:39:40,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:39:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:39:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:39:40,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:40,282 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:39:40,283 INFO L418 AbstractCegarLoop]: === Iteration 8 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:39:40,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:40,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:39:40,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:40,732 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:39:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:39:40,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:39:40,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:39:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:40,734 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:39:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:40,807 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:39:40,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:39:40,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:39:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:40,808 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:39:40,808 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:39:40,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:39:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:39:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:39:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:39:40,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:39:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:40,812 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:39:40,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:39:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:39:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:39:40,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:40,813 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:39:40,813 INFO L418 AbstractCegarLoop]: === Iteration 9 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:39:40,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:40,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:39:40,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,086 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:39:41,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:39:41,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:39:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:39:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:41,088 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:39:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,123 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:39:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:39:41,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:39:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,125 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:39:41,125 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:39:41,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:39:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:39:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:39:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:39:41,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:39:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,129 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:39:41,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:39:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:39:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:39:41,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,130 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:39:41,130 INFO L418 AbstractCegarLoop]: === Iteration 10 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:39:41,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,671 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:39:41,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:39:41,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:39:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:39:41,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:41,672 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:39:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,752 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:39:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:39:41,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:39:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,760 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:39:41,760 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:39:41,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:39:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:39:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:39:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:39:41,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:39:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,763 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:39:41,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:39:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:39:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:39:41,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,764 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:39:41,764 INFO L418 AbstractCegarLoop]: === Iteration 11 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:39:41,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,114 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:39:42,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:39:42,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:39:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:39:42,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:42,116 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:39:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,176 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:39:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:39:42,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:39:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,178 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:39:42,178 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:39:42,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:39:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:39:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:39:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:39:42,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:39:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,182 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:39:42,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:39:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:39:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:39:42,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,183 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:39:42,183 INFO L418 AbstractCegarLoop]: === Iteration 12 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:39:42,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,666 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:39:42,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:39:42,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:39:42,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:39:42,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:42,668 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:39:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,759 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:39:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:39:42,760 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:39:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,761 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:39:42,761 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:39:42,762 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:39:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:39:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:39:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:39:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:39:42,765 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:39:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,766 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:39:42,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:39:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:39:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:39:42,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,767 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:39:42,767 INFO L418 AbstractCegarLoop]: === Iteration 13 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:39:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,140 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:39:43,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:39:43,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:39:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:39:43,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:43,142 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:39:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,181 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:39:43,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:39:43,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:39:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,182 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:39:43,182 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:39:43,183 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:39:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:39:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:39:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:39:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:39:43,187 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:39:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,187 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:39:43,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:39:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:39:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:39:43,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,188 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:39:43,188 INFO L418 AbstractCegarLoop]: === Iteration 14 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:39:43,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,489 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:39:43,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:39:43,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:39:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:39:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:39:43,491 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:39:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,528 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:39:43,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:39:43,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:39:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,529 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:39:43,529 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:39:43,530 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:39:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:39:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:39:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:39:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:39:43,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:39:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,533 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:39:43,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:39:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:39:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:39:43,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,534 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:39:43,534 INFO L418 AbstractCegarLoop]: === Iteration 15 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:39:43,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,857 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:39:43,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:39:43,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:39:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:39:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:43,859 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:39:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,060 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:39:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:39:44,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:39:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,063 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:39:44,063 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:39:44,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:39:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:39:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:39:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:39:44,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:39:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,073 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:39:44,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:39:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:39:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:39:44,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,074 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:39:44,075 INFO L418 AbstractCegarLoop]: === Iteration 16 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:39:44,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,501 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:39:44,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:39:44,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:39:44,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:39:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:44,503 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:39:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,541 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:39:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:39:44,542 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:39:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,542 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:39:44,542 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:39:44,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:39:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:39:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:39:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:39:44,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:39:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,546 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:39:44,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:39:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:39:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:39:44,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,547 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:39:44,547 INFO L418 AbstractCegarLoop]: === Iteration 17 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:39:44,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,966 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:39:44,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:39:44,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:39:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:39:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:44,968 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:39:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:45,010 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:39:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:39:45,011 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:39:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:45,012 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:39:45,012 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:39:45,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:39:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:39:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:39:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:39:45,016 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:39:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:45,016 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:39:45,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:39:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:39:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:39:45,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:45,017 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:39:45,017 INFO L418 AbstractCegarLoop]: === Iteration 18 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:39:45,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:45,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:39:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:46,634 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:39:46,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:46,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:39:46,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:39:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:39:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:46,636 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:39:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:46,747 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:39:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:39:46,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:39:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:46,748 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:39:46,749 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:39:46,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:39:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:39:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:39:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:39:46,753 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:39:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,754 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:39:46,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:39:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:39:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:39:46,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,755 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:39:46,755 INFO L418 AbstractCegarLoop]: === Iteration 19 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,757 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:39:46,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:46,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:39:46,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,228 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:39:47,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:39:47,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:39:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:39:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:47,230 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:39:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,268 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:39:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:39:47,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:39:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,269 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:39:47,270 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:39:47,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:39:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:39:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:39:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:39:47,274 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:39:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,274 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:39:47,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:39:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:39:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:39:47,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,275 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:39:47,275 INFO L418 AbstractCegarLoop]: === Iteration 20 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:39:47,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,724 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:39:47,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:39:47,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:39:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:39:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:39:47,725 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:39:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,769 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:39:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:39:47,769 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:39:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,770 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:39:47,770 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:39:47,771 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:39:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:39:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:39:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:39:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:39:47,774 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:39:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,774 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:39:47,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:39:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:39:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:39:47,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,775 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:39:47,775 INFO L418 AbstractCegarLoop]: === Iteration 21 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:39:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:48,313 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:39:48,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:48,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:39:48,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:39:48,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:39:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:48,314 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:39:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:48,361 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:39:48,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:39:48,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:39:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:48,362 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:39:48,362 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:39:48,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:39:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:39:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:39:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:39:48,366 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:39:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:48,366 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:39:48,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:39:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:39:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:39:48,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:48,367 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:39:48,367 INFO L418 AbstractCegarLoop]: === Iteration 22 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:39:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:48,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:39:48,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:48,996 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:39:48,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:48,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:39:48,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:39:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:39:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:39:48,997 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:39:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:49,061 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:39:49,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:39:49,064 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:39:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:49,064 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:39:49,064 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:39:49,065 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:39:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:39:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:39:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:39:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:39:49,068 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:39:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:49,068 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:39:49,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:39:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:39:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:39:49,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:49,069 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:39:49,069 INFO L418 AbstractCegarLoop]: === Iteration 23 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:39:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:49,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:39:49,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:49,634 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:39:49,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:49,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:39:49,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:39:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:39:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:39:49,636 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:39:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:49,688 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:39:49,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:39:49,689 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:39:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:49,689 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:39:49,690 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:39:49,690 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:39:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:39:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:39:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:39:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:39:49,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:39:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:49,694 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:39:49,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:39:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:39:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:39:49,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:49,694 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:39:49,695 INFO L418 AbstractCegarLoop]: === Iteration 24 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:39:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:49,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:39:49,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,425 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:39:50,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:39:50,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:39:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:39:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:39:50,427 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:39:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,510 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:39:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:39:50,511 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:39:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,512 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:39:50,512 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:39:50,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:39:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:39:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:39:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:39:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:39:50,516 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:39:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,516 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:39:50,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:39:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:39:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:39:50,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,517 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:39:50,518 INFO L418 AbstractCegarLoop]: === Iteration 25 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:39:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,528 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:39:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:39:51,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:39:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:39:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:51,530 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:39:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,572 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:39:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:39:51,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:39:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,574 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:39:51,574 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:39:51,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:39:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:39:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:39:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:39:51,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:39:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,579 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:39:51,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:39:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:39:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:39:51,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,580 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:39:51,580 INFO L418 AbstractCegarLoop]: === Iteration 26 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:39:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:51,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:39:51,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,415 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:39:52,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:52,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:39:52,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:39:52,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:39:52,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:52,417 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:39:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,495 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:39:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:39:52,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:39:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,496 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:39:52,497 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:39:52,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:39:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:39:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:39:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:39:52,500 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:39:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,500 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:39:52,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:39:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:39:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:39:52,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,501 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:39:52,502 INFO L418 AbstractCegarLoop]: === Iteration 27 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:39:52,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:53,805 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:39:53,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:39:53,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:39:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:39:53,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:53,806 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:39:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:54,052 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:39:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:39:54,052 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:39:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:54,053 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:39:54,053 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:39:54,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:39:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:39:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:39:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:39:54,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:39:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:54,057 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:39:54,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:39:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:39:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:39:54,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:54,058 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:39:54,059 INFO L418 AbstractCegarLoop]: === Iteration 28 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:39:54,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:54,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:39:54,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:54,808 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:39:54,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:54,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:39:54,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:39:54,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:39:54,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:54,809 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:39:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:54,886 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:39:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:39:54,886 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:39:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:54,887 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:39:54,887 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:39:54,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:39:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:39:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:39:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:39:54,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:39:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:54,891 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:39:54,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:39:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:39:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:39:54,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:54,892 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:39:54,892 INFO L418 AbstractCegarLoop]: === Iteration 29 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:39:54,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:54,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:39:54,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:56,493 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:39:56,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:39:56,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:39:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:39:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:56,495 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:39:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:56,559 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:39:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:39:56,559 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:39:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:56,560 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:39:56,560 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:39:56,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:39:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:39:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:39:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:39:56,563 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:39:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:56,564 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:39:56,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:39:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:39:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:39:56,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:56,565 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:39:56,565 INFO L418 AbstractCegarLoop]: === Iteration 30 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:39:56,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:56,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:39:56,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:57,250 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:39:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:57,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:39:57,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:39:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:39:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:57,252 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:39:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:57,353 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:39:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:39:57,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:39:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:57,355 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:39:57,355 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:39:57,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:39:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:39:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:39:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:39:57,358 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:39:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:57,359 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:39:57,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:39:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:39:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:39:57,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:57,359 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:39:57,360 INFO L418 AbstractCegarLoop]: === Iteration 31 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:39:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:57,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:39:57,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,370 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:39:58,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:39:58,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:39:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:39:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:58,372 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:39:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,440 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:39:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:39:58,441 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:39:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,442 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:39:58,442 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:39:58,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:39:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:39:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:39:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:39:58,445 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:39:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,445 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:39:58,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:39:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:39:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:39:58,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,446 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:39:58,446 INFO L418 AbstractCegarLoop]: === Iteration 32 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:39:58,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:59,215 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:39:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:39:59,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:39:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:39:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:59,216 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:39:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:59,280 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:39:59,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:39:59,281 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:39:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:59,281 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:39:59,281 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:39:59,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:39:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:39:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:39:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:39:59,285 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:39:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:59,285 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:39:59,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:39:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:39:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:39:59,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:59,286 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:39:59,286 INFO L418 AbstractCegarLoop]: === Iteration 33 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:39:59,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:59,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:39:59,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:01,663 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:40:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:01,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:40:01,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:40:01,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:40:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:40:01,665 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:40:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:01,724 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:40:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:40:01,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:40:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:01,725 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:40:01,725 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:40:01,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:40:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:40:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:40:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:40:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:40:01,729 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:40:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:01,729 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:40:01,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:40:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:40:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:40:01,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:01,730 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:40:01,731 INFO L418 AbstractCegarLoop]: === Iteration 34 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:40:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:01,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:40:01,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,634 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:40:02,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:02,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:40:02,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:40:02,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:40:02,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:40:02,635 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:40:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:02,692 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:40:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:40:02,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:40:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:02,693 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:40:02,693 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:40:02,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:40:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:40:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:40:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:40:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:40:02,696 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:40:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:02,697 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:40:02,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:40:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:40:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:40:02,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:02,697 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:40:02,698 INFO L418 AbstractCegarLoop]: === Iteration 35 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:40:02,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:40:02,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:03,849 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:40:03,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:03,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:40:03,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:40:03,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:40:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:40:03,850 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:40:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:03,917 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:40:03,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:40:03,917 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:40:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:03,918 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:40:03,918 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:40:03,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:40:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:40:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:40:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:40:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:40:03,921 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:40:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:03,922 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:40:03,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:40:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:40:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:40:03,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:03,923 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:40:03,923 INFO L418 AbstractCegarLoop]: === Iteration 36 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:40:03,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:03,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:40:03,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:04,828 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:40:04,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:04,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:40:04,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:40:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:40:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:40:04,830 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:40:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:04,968 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:40:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:40:04,969 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:40:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:04,969 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:40:04,970 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:40:04,970 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:40:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:40:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:40:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:40:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:40:04,973 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:40:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:04,973 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:40:04,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:40:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:40:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:40:04,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:04,974 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:40:04,974 INFO L418 AbstractCegarLoop]: === Iteration 37 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:40:04,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:04,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:40:04,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:05,927 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:40:05,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:05,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:40:05,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:40:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:40:05,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:40:05,929 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:40:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:05,997 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:40:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:40:05,997 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:40:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:05,998 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:40:05,998 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:40:05,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:40:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:40:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:40:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:40:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:40:06,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:40:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,002 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:40:06,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:40:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:40:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:40:06,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,002 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:40:06,003 INFO L418 AbstractCegarLoop]: === Iteration 38 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:40:06,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:07,114 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:40:07,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:07,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:40:07,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:40:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:40:07,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:40:07,116 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:40:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:07,183 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:40:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:40:07,184 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:40:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:07,184 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:40:07,185 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:40:07,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:40:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:40:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:40:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:40:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:40:07,187 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:40:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:07,188 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:40:07,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:40:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:40:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:40:07,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:07,188 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:40:07,189 INFO L418 AbstractCegarLoop]: === Iteration 39 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:40:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:07,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:40:07,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:08,419 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:40:08,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:08,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:40:08,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:40:08,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:40:08,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:40:08,421 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:40:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:08,523 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:40:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:40:08,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:40:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:08,524 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:40:08,524 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:40:08,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:40:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:40:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:40:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:40:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:40:08,527 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:40:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:08,527 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:40:08,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:40:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:40:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:40:08,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:08,528 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:40:08,528 INFO L418 AbstractCegarLoop]: === Iteration 40 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:40:08,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:08,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:40:08,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:09,548 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:40:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:09,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:40:09,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:40:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:40:09,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:40:09,550 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:40:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:09,643 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:40:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:40:09,643 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:40:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:09,644 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:40:09,644 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:40:09,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:40:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:40:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:40:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:40:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:40:09,647 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:40:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:09,648 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:40:09,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:40:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:40:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:40:09,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:09,648 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:40:09,649 INFO L418 AbstractCegarLoop]: === Iteration 41 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:40:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:09,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:40:09,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:11,067 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:40:11,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:40:11,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:40:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:40:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:40:11,069 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:40:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:11,139 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:40:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:40:11,140 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:40:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:11,141 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:40:11,141 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:40:11,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:40:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:40:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:40:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:40:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:40:11,144 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:40:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:11,144 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:40:11,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:40:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:40:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:40:11,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:11,145 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:40:11,145 INFO L418 AbstractCegarLoop]: === Iteration 42 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:40:11,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:11,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:40:11,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:12,287 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:40:12,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:12,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:40:12,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:40:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:40:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:40:12,289 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:40:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:12,359 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:40:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:40:12,360 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:40:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:12,361 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:40:12,361 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:40:12,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:40:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:40:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:40:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:40:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:40:12,364 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:40:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:12,364 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:40:12,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:40:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:40:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:40:12,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:12,365 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:40:12,365 INFO L418 AbstractCegarLoop]: === Iteration 43 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:40:12,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:12,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:40:12,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:13,720 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:40:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:13,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:40:13,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:40:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:40:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:40:13,722 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:40:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:13,808 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:40:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:40:13,809 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:40:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:13,810 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:40:13,810 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:40:13,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:40:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:40:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:40:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:40:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:40:13,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:40:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:13,814 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:40:13,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:40:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:40:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:40:13,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:13,815 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:40:13,815 INFO L418 AbstractCegarLoop]: === Iteration 44 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:40:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:13,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:40:13,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:15,003 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:40:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:15,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:40:15,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:40:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:40:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:40:15,005 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:40:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:15,085 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:40:15,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:40:15,089 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:40:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:15,090 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:40:15,090 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:40:15,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:40:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:40:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:40:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:40:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:40:15,091 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:40:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:15,092 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:40:15,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:40:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:40:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:40:15,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:15,092 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:40:15,093 INFO L418 AbstractCegarLoop]: === Iteration 45 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:40:15,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:15,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:40:15,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:16,694 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:40:16,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:40:16,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:40:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:40:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:16,695 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:40:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:16,810 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:40:16,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:40:16,811 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:40:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:16,812 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:40:16,812 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:40:16,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:40:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:40:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:40:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:40:16,814 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:40:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:16,815 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:40:16,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:40:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:40:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:40:16,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:16,816 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:40:16,816 INFO L418 AbstractCegarLoop]: === Iteration 46 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:40:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:16,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:40:16,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:19,007 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:40:19,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:19,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:40:19,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:40:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:40:19,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:19,008 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:40:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:19,334 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:40:19,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:40:19,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:40:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:19,336 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:40:19,336 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:40:19,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:40:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:40:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:40:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:40:19,340 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:40:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:19,341 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:40:19,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:40:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:40:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:40:19,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:19,341 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:40:19,341 INFO L418 AbstractCegarLoop]: === Iteration 47 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:40:19,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:19,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:40:19,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:20,933 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:40:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:20,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:40:20,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:40:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:40:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:20,935 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:40:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:21,022 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:40:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:40:21,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:40:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:21,024 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:40:21,024 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:40:21,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:40:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:40:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:40:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:40:21,028 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:40:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:21,028 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:40:21,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:40:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:40:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:40:21,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:21,029 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:40:21,029 INFO L418 AbstractCegarLoop]: === Iteration 48 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:40:21,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:21,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:40:21,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:22,509 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:40:22,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:22,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:40:22,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:40:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:40:22,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:22,510 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:40:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:22,594 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:40:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:40:22,595 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:40:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:22,596 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:40:22,596 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:40:22,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:40:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:40:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:40:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:40:22,599 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:40:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:22,599 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:40:22,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:40:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:40:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:40:22,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:22,600 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:40:22,600 INFO L418 AbstractCegarLoop]: === Iteration 49 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:40:22,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:22,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:40:22,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:24,154 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:40:24,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:24,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:40:24,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:40:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:40:24,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:24,156 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:40:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:24,258 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:40:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:40:24,259 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:40:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:24,260 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:40:24,260 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:40:24,261 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:40:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:40:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:40:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:40:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:40:24,263 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:40:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:24,264 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:40:24,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:40:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:40:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:40:24,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:24,264 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:40:24,265 INFO L418 AbstractCegarLoop]: === Iteration 50 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:40:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:24,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:40:24,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:25,913 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:40:25,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:25,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:40:25,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:40:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:40:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:25,915 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:40:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:26,006 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:40:26,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:40:26,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:40:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:26,007 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:40:26,007 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:40:26,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:40:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:40:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:40:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:40:26,010 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:40:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:26,011 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:40:26,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:40:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:40:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:40:26,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:26,011 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:40:26,012 INFO L418 AbstractCegarLoop]: === Iteration 51 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:26,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:40:26,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:26,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:40:26,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:27,631 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:40:27,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:27,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:40:27,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:40:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:40:27,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:27,633 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:40:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:27,740 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:40:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:40:27,740 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:40:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:27,741 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:40:27,742 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:40:27,742 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:40:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:40:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:40:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:40:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:40:27,745 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:40:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:27,745 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:40:27,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:40:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:40:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:40:27,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:27,746 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:40:27,746 INFO L418 AbstractCegarLoop]: === Iteration 52 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:40:27,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:27,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:40:27,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:29,571 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:40:29,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:29,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:40:29,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:40:29,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:40:29,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:29,573 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:40:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:29,698 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:40:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:40:29,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:40:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:29,700 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:40:29,700 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:40:29,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:40:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:40:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:40:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:40:29,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:40:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:29,703 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:40:29,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:40:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:40:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:40:29,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:29,704 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:40:29,704 INFO L418 AbstractCegarLoop]: === Iteration 53 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:40:29,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:29,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:40:29,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:31,431 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:40:31,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:40:31,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:40:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:40:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:31,432 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:40:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:31,515 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:40:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:40:31,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:40:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:31,517 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:40:31,517 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:40:31,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:40:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:40:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:40:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:40:31,520 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:40:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:31,520 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:40:31,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:40:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:40:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:40:31,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:31,521 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:40:31,521 INFO L418 AbstractCegarLoop]: === Iteration 54 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:40:31,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:31,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:40:31,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:33,488 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:40:33,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:33,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:40:33,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:40:33,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:40:33,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:33,490 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:40:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:33,597 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:40:33,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:40:33,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:40:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:33,598 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:40:33,598 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:40:33,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:40:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:40:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:40:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:40:33,601 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:40:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:33,601 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:40:33,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:40:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:40:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:40:33,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:33,601 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:40:33,601 INFO L418 AbstractCegarLoop]: === Iteration 55 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:40:33,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:33,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:40:33,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:35,654 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:40:35,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:35,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:40:35,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:40:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:40:35,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:40:35,655 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:40:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:35,750 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:40:35,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:40:35,751 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:40:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:35,751 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:40:35,752 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:40:35,752 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:40:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:40:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:40:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:40:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:40:35,754 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:40:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:35,754 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:40:35,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:40:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:40:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:40:35,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:35,755 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:40:35,756 INFO L418 AbstractCegarLoop]: === Iteration 56 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:35,756 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:40:35,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:35,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:40:35,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:37,562 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:40:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:37,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:40:37,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:40:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:40:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:40:37,563 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:40:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:37,674 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:40:37,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:40:37,674 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:40:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:37,674 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:40:37,674 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:40:37,675 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:40:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:40:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:40:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:40:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:40:37,676 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:40:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:37,676 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:40:37,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:40:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:40:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:40:37,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:37,677 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:40:37,677 INFO L418 AbstractCegarLoop]: === Iteration 57 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:40:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:37,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:40:37,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:39,835 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:40:39,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:39,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:40:39,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:40:39,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:40:39,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:39,836 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:40:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:39,960 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:40:39,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:40:39,960 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:40:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:39,961 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:40:39,961 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:40:39,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:39,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:40:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:40:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:40:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:40:39,964 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:40:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:39,964 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:40:39,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:40:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:40:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:40:39,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:39,965 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:40:39,966 INFO L418 AbstractCegarLoop]: === Iteration 58 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:40:39,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:39,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:40:39,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:42,328 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:40:42,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:42,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:40:42,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:40:42,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:40:42,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:40:42,330 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:40:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:42,443 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:40:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:40:42,444 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:40:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:42,444 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:40:42,445 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:40:42,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:40:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:40:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:40:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:40:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:40:42,447 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:40:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:42,448 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:40:42,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:40:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:40:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:40:42,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:42,449 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:40:42,449 INFO L418 AbstractCegarLoop]: === Iteration 59 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:40:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:42,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:40:42,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:45,334 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:40:45,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:45,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:40:45,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:40:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:40:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:45,336 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:40:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:45,438 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:40:45,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:40:45,438 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:40:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:45,439 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:40:45,439 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:40:45,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:40:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:40:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:40:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:40:45,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:40:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:45,442 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:40:45,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:40:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:40:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:40:45,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:45,443 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:40:45,443 INFO L418 AbstractCegarLoop]: === Iteration 60 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:40:45,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:45,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:40:45,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:47,577 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:40:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:47,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:40:47,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:40:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:40:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:40:47,578 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:40:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:47,679 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:40:47,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:40:47,680 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:40:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:47,680 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:40:47,680 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:40:47,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:40:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:40:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:40:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:40:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:40:47,683 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:40:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:47,683 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:40:47,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:40:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:40:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:40:47,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:47,683 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:40:47,684 INFO L418 AbstractCegarLoop]: === Iteration 61 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:47,684 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:40:47,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:47,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:40:47,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:50,340 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:40:50,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:50,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:40:50,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:40:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:40:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:40:50,341 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:40:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:50,447 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:40:50,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:40:50,448 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:40:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:50,448 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:40:50,449 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:40:50,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:40:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:40:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:40:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:40:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:40:50,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:40:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:50,451 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:40:50,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:40:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:40:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:40:50,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,452 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:40:50,452 INFO L418 AbstractCegarLoop]: === Iteration 62 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:40:50,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:52,738 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:40:52,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:52,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:40:52,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:40:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:40:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:40:52,740 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:40:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:52,865 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:40:52,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:40:52,865 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:40:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:52,866 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:40:52,866 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:40:52,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:40:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:40:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:40:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:40:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:40:52,869 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:40:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:52,869 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:40:52,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:40:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:40:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:40:52,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:52,870 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:40:52,870 INFO L418 AbstractCegarLoop]: === Iteration 63 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:40:52,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,360 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:40:55,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:40:55,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:40:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:40:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:40:55,361 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:40:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,470 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:40:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:40:55,470 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:40:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,471 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:40:55,471 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:40:55,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:40:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:40:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:40:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:40:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:40:55,473 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:40:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,474 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:40:55,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:40:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:40:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:40:55,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,474 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:40:55,474 INFO L418 AbstractCegarLoop]: === Iteration 64 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:40:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,917 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:40:57,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:57,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:40:57,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:40:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:40:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:40:57,919 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:40:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:58,035 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:40:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:40:58,035 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:40:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:58,036 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:40:58,036 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:40:58,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:40:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:40:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:40:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:40:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:40:58,039 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:40:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:58,040 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:40:58,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:40:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:40:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:40:58,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:58,040 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:40:58,041 INFO L418 AbstractCegarLoop]: === Iteration 65 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:40:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:58,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:40:58,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:01,504 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:41:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:41:01,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:41:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:41:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:01,505 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:41:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:01,646 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:41:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:41:01,646 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:41:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:01,647 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:41:01,647 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:41:01,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:41:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:41:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:41:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:41:01,650 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:41:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:01,650 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:41:01,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:41:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:41:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:41:01,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:01,651 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:41:01,651 INFO L418 AbstractCegarLoop]: === Iteration 66 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:41:01,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:01,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:41:01,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:04,169 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:41:04,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:04,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:41:04,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:41:04,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:41:04,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:04,171 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:41:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:04,300 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:41:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:41:04,301 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:41:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:04,302 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:41:04,302 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:41:04,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:41:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:41:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:41:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:41:04,304 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:41:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:04,305 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:41:04,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:41:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:41:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:41:04,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:04,306 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:41:04,306 INFO L418 AbstractCegarLoop]: === Iteration 67 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:41:04,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:04,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:41:04,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:07,108 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:41:07,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:07,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:41:07,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:41:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:41:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:07,110 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:41:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:07,227 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:41:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:41:07,228 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:41:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:07,229 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:41:07,229 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:41:07,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:41:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:41:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:41:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:41:07,231 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:41:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:07,232 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:41:07,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:41:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:41:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:41:07,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:07,232 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:41:07,232 INFO L418 AbstractCegarLoop]: === Iteration 68 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:41:07,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:07,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:41:07,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:09,920 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:41:09,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:09,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:41:09,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:41:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:41:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:09,921 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:41:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:10,061 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:41:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:41:10,061 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:41:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:10,062 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:41:10,062 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:41:10,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:41:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:41:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:41:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:41:10,065 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:41:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:10,065 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:41:10,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:41:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:41:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:41:10,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:10,066 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:41:10,067 INFO L418 AbstractCegarLoop]: === Iteration 69 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:41:10,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:10,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:41:10,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,696 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:41:12,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:41:12,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:41:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:41:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:12,697 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:41:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:12,827 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:41:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:41:12,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:41:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:12,829 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:41:12,829 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:41:12,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:41:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:41:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:41:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:41:12,832 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:41:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:12,832 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:41:12,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:41:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:41:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:41:12,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:12,833 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:41:12,833 INFO L418 AbstractCegarLoop]: === Iteration 70 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:12,834 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:41:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:12,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:41:12,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:15,726 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:41:15,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:15,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:41:15,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:41:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:41:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:41:15,728 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:41:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:15,898 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:41:15,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:41:15,898 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:41:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:15,899 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:41:15,899 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:41:15,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:41:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:41:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:41:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:41:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:41:15,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:41:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:15,903 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:41:15,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:41:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:41:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:41:15,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:15,904 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:41:15,904 INFO L418 AbstractCegarLoop]: === Iteration 71 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:41:15,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:15,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:41:15,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:19,006 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:41:19,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:19,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:41:19,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:41:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:41:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:41:19,008 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:41:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:19,136 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:41:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:41:19,137 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:41:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:19,138 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:41:19,138 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:41:19,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:41:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:41:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:41:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:41:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:41:19,141 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:41:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:19,141 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:41:19,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:41:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:41:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:41:19,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:19,142 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:41:19,142 INFO L418 AbstractCegarLoop]: === Iteration 72 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:41:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:19,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:41:19,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:22,376 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:41:22,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:22,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:41:22,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:41:22,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:41:22,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:41:22,378 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:41:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:22,520 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:41:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:41:22,520 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:41:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:22,521 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:41:22,522 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:41:22,522 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:41:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:41:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:41:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:41:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:41:22,525 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:41:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:22,525 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:41:22,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:41:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:41:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:41:22,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:22,526 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:41:22,526 INFO L418 AbstractCegarLoop]: === Iteration 73 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:41:22,527 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 374 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:41:22,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:25,885 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:41:25,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:41:25,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:41:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:41:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:41:25,886 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:41:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:26,018 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:41:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:41:26,019 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:41:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:26,020 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:41:26,020 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:41:26,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:41:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:41:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:41:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:41:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:41:26,023 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:41:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:26,023 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:41:26,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:41:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:41:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:41:26,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:26,024 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:41:26,025 INFO L418 AbstractCegarLoop]: === Iteration 74 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:41:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:26,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:41:26,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:29,056 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:41:29,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:29,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:41:29,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:41:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:41:29,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:41:29,057 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:41:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:29,207 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:41:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:41:29,208 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:41:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:29,208 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:41:29,208 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:41:29,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:41:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:41:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:41:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:41:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:41:29,211 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:41:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:29,211 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:41:29,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:41:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:41:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:41:29,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:29,211 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:41:29,212 INFO L418 AbstractCegarLoop]: === Iteration 75 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:29,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:41:29,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:29,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:41:29,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:32,520 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:41:32,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:32,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:41:32,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:41:32,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:41:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:41:32,522 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:41:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:32,659 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:41:32,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:41:32,660 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:41:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:32,661 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:41:32,661 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:41:32,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:41:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:41:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:41:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:41:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:41:32,663 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:41:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:32,664 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:41:32,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:41:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:41:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:41:32,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:32,665 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:41:32,665 INFO L418 AbstractCegarLoop]: === Iteration 76 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:41:32,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:32,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:41:32,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:36,022 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:41:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:41:36,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:41:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:41:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:41:36,023 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:41:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:36,181 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:41:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:41:36,182 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:41:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:36,183 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:41:36,183 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:41:36,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:41:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:41:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:41:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:41:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:41:36,186 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:41:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:36,186 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:41:36,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:41:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:41:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:41:36,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:36,187 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:41:36,187 INFO L418 AbstractCegarLoop]: === Iteration 77 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:41:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:36,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:41:36,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:40,164 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:41:40,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:40,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:41:40,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:41:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:41:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:41:40,166 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:41:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:40,323 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:41:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:41:40,324 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:41:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:40,325 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:41:40,325 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:41:40,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:41:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:41:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:41:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:41:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:41:40,328 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:41:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:40,328 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:41:40,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:41:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:41:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:41:40,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:40,329 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:41:40,330 INFO L418 AbstractCegarLoop]: === Iteration 78 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:41:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:40,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:41:40,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,856 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:41:43,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:43,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:41:43,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:41:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:41:43,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:41:43,857 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:41:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,083 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:41:44,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:41:44,084 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:41:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,084 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:41:44,085 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:41:44,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:41:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:41:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:41:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:41:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:41:44,088 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:41:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,088 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:41:44,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:41:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:41:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:41:44,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,089 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:41:44,089 INFO L418 AbstractCegarLoop]: === Iteration 79 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,089 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 10:41:44,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:47,832 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:41:47,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:47,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:41:47,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:41:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:41:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:41:47,834 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:41:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,067 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:41:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:41:48,068 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:41:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,068 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:41:48,069 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:41:48,069 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:41:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:41:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:41:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:41:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:41:48,072 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:41:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,072 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:41:48,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:41:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:41:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:41:48,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,073 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:41:48,073 INFO L418 AbstractCegarLoop]: === Iteration 80 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,074 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 10:41:48,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:51,764 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:41:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:51,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:41:51,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:41:51,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:41:51,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:41:51,765 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:41:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:51,911 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:41:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:41:51,911 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:41:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:51,912 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:41:51,912 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:41:51,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:41:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:41:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:41:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:41:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:41:51,915 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:41:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:51,915 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:41:51,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:41:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:41:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:41:51,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:51,916 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:41:51,916 INFO L418 AbstractCegarLoop]: === Iteration 81 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 10:41:51,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:51,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:41:51,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:57,441 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:41:57,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:57,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:41:57,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:41:57,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:41:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:41:57,442 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:41:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:57,632 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:41:57,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:41:57,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:41:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:57,633 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:41:57,633 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:41:57,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:41:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:41:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:41:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:41:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:41:57,635 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:41:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:57,636 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:41:57,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:41:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:41:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:41:57,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:57,636 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:41:57,636 INFO L418 AbstractCegarLoop]: === Iteration 82 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:57,637 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 10:41:57,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:57,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:41:57,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:01,875 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:42:01,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:01,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:42:01,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:42:01,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:42:01,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:42:01,877 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:42:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:02,202 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:42:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:42:02,203 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:42:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:02,203 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:42:02,203 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:42:02,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:42:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:42:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:42:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:42:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:42:02,206 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:42:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:02,207 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:42:02,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:42:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:42:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:42:02,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:02,207 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:42:02,208 INFO L418 AbstractCegarLoop]: === Iteration 83 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 10:42:02,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:02,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:42:02,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:06,781 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:42:06,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:06,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:42:06,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:42:06,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:42:06,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:42:06,783 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:42:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:06,956 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:42:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:42:06,957 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:42:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:06,958 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:42:06,958 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:42:06,958 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:42:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:42:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:42:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:42:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:42:06,960 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:42:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:06,961 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:42:06,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:42:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:42:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:42:06,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:06,961 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:42:06,961 INFO L418 AbstractCegarLoop]: === Iteration 84 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 10:42:06,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:06,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:42:06,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:10,720 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:42:10,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:10,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:42:10,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:42:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:42:10,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:42:10,722 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:42:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:10,949 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:42:10,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:42:10,950 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:42:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:10,950 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:42:10,951 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:42:10,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:42:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:42:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:42:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:42:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:42:10,953 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:42:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:10,954 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:42:10,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:42:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:42:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:42:10,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:10,955 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:42:10,955 INFO L418 AbstractCegarLoop]: === Iteration 85 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 10:42:10,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:10,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:42:10,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:15,084 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:42:15,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:15,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:42:15,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:42:15,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:42:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:42:15,087 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:42:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:15,241 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:42:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:42:15,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:42:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:15,242 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:42:15,242 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:42:15,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:42:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:42:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:42:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:42:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:42:15,245 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:42:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:15,245 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:42:15,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:42:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:42:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:42:15,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:15,246 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:42:15,246 INFO L418 AbstractCegarLoop]: === Iteration 86 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 10:42:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:15,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:42:15,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,672 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:42:19,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:19,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:42:19,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:42:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:42:19,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:42:19,674 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:42:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,901 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:42:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:42:19,902 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:42:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,902 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:42:19,903 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:42:19,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:42:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:42:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:42:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:42:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:42:19,906 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:42:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,907 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:42:19,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:42:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:42:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:42:19,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,907 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:42:19,908 INFO L418 AbstractCegarLoop]: === Iteration 87 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 10:42:19,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:24,368 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:42:24,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:24,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:42:24,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:42:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:42:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:42:24,370 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:42:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:24,569 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:42:24,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:42:24,570 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:42:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:24,571 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:42:24,571 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:42:24,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:42:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:42:24,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:42:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:42:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:42:24,574 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:42:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:24,574 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:42:24,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:42:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:42:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:42:24,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:24,575 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:42:24,575 INFO L418 AbstractCegarLoop]: === Iteration 88 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:24,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:24,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 10:42:24,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:24,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:42:24,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,114 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:42:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:29,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:42:29,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:42:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:42:29,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:42:29,116 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:42:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:29,340 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:42:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:42:29,340 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:42:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:29,341 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:42:29,341 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:42:29,342 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:42:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:42:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:42:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:42:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:42:29,344 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:42:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:29,344 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:42:29,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:42:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:42:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:42:29,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:29,345 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:42:29,345 INFO L418 AbstractCegarLoop]: === Iteration 89 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 10:42:29,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:29,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:42:29,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:34,457 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:42:34,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:34,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:42:34,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:42:34,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:42:34,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:42:34,458 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:42:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:34,628 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:42:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:42:34,629 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:42:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:34,630 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:42:34,630 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:42:34,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:42:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:42:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:42:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:42:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:42:34,633 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:42:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:34,633 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:42:34,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:42:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:42:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:42:34,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:34,634 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:42:34,634 INFO L418 AbstractCegarLoop]: === Iteration 90 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:34,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 10:42:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:34,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:42:34,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:39,567 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:42:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:39,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:42:39,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:42:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:42:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:42:39,569 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:42:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:39,747 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:42:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:42:39,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:42:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:39,748 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:42:39,748 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:42:39,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:42:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:42:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:42:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:42:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:42:39,751 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:42:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:39,752 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:42:39,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:42:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:42:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:42:39,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:39,753 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:42:39,753 INFO L418 AbstractCegarLoop]: === Iteration 91 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 10:42:39,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:39,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:42:39,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:44,551 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:42:44,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:44,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:42:44,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:42:44,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:42:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:42:44,553 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:42:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:44,843 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:42:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:42:44,843 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:42:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:44,844 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:42:44,844 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:42:44,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:42:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:42:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:42:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:42:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:42:44,848 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:42:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:44,848 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:42:44,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:42:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:42:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:42:44,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:44,849 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:42:44,849 INFO L418 AbstractCegarLoop]: === Iteration 92 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 10:42:44,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:44,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:42:44,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:49,723 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:42:49,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:49,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:42:49,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:42:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:42:49,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:42:49,725 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:42:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:49,909 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:42:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:42:49,910 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:42:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:49,911 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:42:49,911 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:42:49,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:42:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:42:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:42:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:42:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:42:49,915 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:42:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:49,915 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:42:49,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:42:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:42:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:42:49,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:49,916 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:42:49,916 INFO L418 AbstractCegarLoop]: === Iteration 93 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 10:42:49,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:49,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:42:49,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:54,891 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:42:54,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:54,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:42:54,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:42:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:42:54,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:42:54,893 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:42:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:55,090 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:42:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:42:55,090 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:42:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:55,091 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:42:55,091 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:42:55,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:42:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:42:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:42:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:42:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:42:55,094 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:42:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:55,094 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:42:55,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:42:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:42:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:42:55,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:55,095 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:42:55,095 INFO L418 AbstractCegarLoop]: === Iteration 94 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 10:42:55,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:55,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:42:55,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:00,351 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:43:00,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:00,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:43:00,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:43:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:43:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:43:00,352 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:43:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:00,528 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:43:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:43:00,529 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:43:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:00,529 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:43:00,530 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:43:00,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:43:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:43:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:43:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:43:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:43:00,532 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:43:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:00,532 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:43:00,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:43:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:43:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:43:00,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:00,533 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:43:00,533 INFO L418 AbstractCegarLoop]: === Iteration 95 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 10:43:00,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:00,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:43:00,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:05,890 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:43:05,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:05,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:43:05,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:43:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:43:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:43:05,891 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:43:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:06,084 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:43:06,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:43:06,084 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:43:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:06,085 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:43:06,086 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:43:06,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:43:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:43:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:43:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:43:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:43:06,088 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:43:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:06,089 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:43:06,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:43:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:43:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:43:06,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:06,090 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:43:06,090 INFO L418 AbstractCegarLoop]: === Iteration 96 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 10:43:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:06,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:43:06,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:11,418 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:43:11,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:11,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:43:11,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:43:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:43:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:43:11,420 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:43:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:11,624 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:43:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:43:11,625 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:43:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:11,626 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:43:11,626 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:43:11,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:43:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:43:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:43:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:43:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:43:11,629 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:43:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:11,629 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:43:11,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:43:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:43:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:43:11,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:11,630 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:43:11,630 INFO L418 AbstractCegarLoop]: === Iteration 97 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:11,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 10:43:11,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:11,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:43:11,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:17,110 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:43:17,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:17,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:43:17,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:43:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:43:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:43:17,113 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:43:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:17,390 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:43:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:43:17,390 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:43:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:17,391 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:43:17,392 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:43:17,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:43:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:43:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:43:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:43:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:43:17,395 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:43:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:17,395 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:43:17,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:43:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:43:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:43:17,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:17,396 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:43:17,396 INFO L418 AbstractCegarLoop]: === Iteration 98 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 10:43:17,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:17,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:43:17,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:23,181 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:43:23,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:23,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:43:23,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:43:23,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:43:23,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:43:23,183 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:43:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:23,400 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:43:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:43:23,400 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:43:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:23,401 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:43:23,402 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:43:23,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:43:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:43:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:43:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:43:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:43:23,405 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:43:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:23,405 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:43:23,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:43:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:43:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:43:23,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:23,406 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:43:23,406 INFO L418 AbstractCegarLoop]: === Iteration 99 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 10:43:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:23,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:43:23,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,822 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:43:28,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:43:28,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:43:28,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:43:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:43:28,824 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:43:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,166 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:43:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:43:29,167 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:43:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,168 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:43:29,168 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:43:29,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:43:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:43:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:43:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:43:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:43:29,171 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:43:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,171 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:43:29,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:43:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:43:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:43:29,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,172 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:43:29,172 INFO L418 AbstractCegarLoop]: === Iteration 100 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 10:43:29,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,799 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:43:34,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:43:34,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:43:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:43:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:43:34,801 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:43:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,020 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:43:35,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:43:35,021 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:43:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,022 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:43:35,022 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:43:35,022 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:43:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:43:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:43:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:43:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:43:35,025 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:43:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,026 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:43:35,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:43:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:43:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:43:35,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,027 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:43:35,027 INFO L418 AbstractCegarLoop]: === Iteration 101 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 10:43:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:40,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:40,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:43:40,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:43:40,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:43:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:43:40,700 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:43:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,923 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:43:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:43:40,924 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:43:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,925 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:43:40,926 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:43:40,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:43:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:43:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:43:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:43:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:43:40,939 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:43:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:43:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:43:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:43:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:43:40,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,940 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:43:40,940 INFO L418 AbstractCegarLoop]: === Iteration 102 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833862, now seen corresponding path program 101 times [2019-08-05 10:43:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:43:43,459 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:43:43,459 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:43:43,463 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:43:43,464 INFO L202 PluginConnector]: Adding new model WaterTank1-NumberVariables.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:43 BoogieIcfgContainer [2019-08-05 10:43:43,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:43,466 INFO L168 Benchmark]: Toolchain (without parser) took 245918.22 ms. Allocated memory was 139.5 MB in the beginning and 566.2 MB in the end (delta: 426.8 MB). Free memory was 109.1 MB in the beginning and 445.2 MB in the end (delta: -336.1 MB). Peak memory consumption was 90.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,467 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.1 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:43:43,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.32 ms. Allocated memory is still 139.5 MB. Free memory was 109.1 MB in the beginning and 107.2 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:43:43,468 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 139.5 MB. Free memory was 107.2 MB in the beginning and 106.0 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:43:43,468 INFO L168 Benchmark]: RCFGBuilder took 298.63 ms. Allocated memory is still 139.5 MB. Free memory was 106.0 MB in the beginning and 96.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,469 INFO L168 Benchmark]: TraceAbstraction took 245547.92 ms. Allocated memory was 139.5 MB in the beginning and 566.2 MB in the end (delta: 426.8 MB). Free memory was 96.4 MB in the beginning and 445.2 MB in the end (delta: -348.7 MB). Peak memory consumption was 78.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,472 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.1 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 43.32 ms. Allocated memory is still 139.5 MB. Free memory was 109.1 MB in the beginning and 107.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 139.5 MB. Free memory was 107.2 MB in the beginning and 106.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 298.63 ms. Allocated memory is still 139.5 MB. Free memory was 106.0 MB in the beginning and 96.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245547.92 ms. Allocated memory was 139.5 MB in the beginning and 566.2 MB in the end (delta: 426.8 MB). Free memory was 96.4 MB in the beginning and 445.2 MB in the end (delta: -348.7 MB). Peak memory consumption was 78.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 101,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 245.4s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 0 SDslu, 1372 SDs, 0 SdLazy, 6474 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5252 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 222.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=101, 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, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 227.6s InterpolantComputationTime, 5353 NumberOfCodeBlocks, 5353 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 5252 ConstructedInterpolants, 5251 QuantifiedInterpolants, 5025330 SizeOfPredicates, 103 NumberOfNonLiveVariables, 26664 ConjunctsInSsa, 5454 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 0/171700 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown