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/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex04-Minimum.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:06,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:06,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:06,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:06,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:06,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:06,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:06,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:06,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:06,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:06,393 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:06,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:06,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:06,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:06,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:06,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:06,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:06,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:06,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:06,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:06,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:06,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:06,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:06,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:06,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:06,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:06,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:06,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:06,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:06,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:06,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:06,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:06,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:06,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:06,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:06,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:06,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:06,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:06,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:06,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:06,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:06,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:06,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:06,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:06,468 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:06,468 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:06,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex04-Minimum.bpl [2019-08-05 10:31:06,469 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex04-Minimum.bpl' [2019-08-05 10:31:06,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:06,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:06,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:06,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:06,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:06,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,540 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:06,541 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:06,541 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:06,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:06,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:06,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:06,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:06,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/1) ... [2019-08-05 10:31:06,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:06,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:06,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:06,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:06,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (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:31:06,640 INFO L124 BoogieDeclarations]: Specification and implementation of procedure findmin given in one single declaration [2019-08-05 10:31:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure findmin [2019-08-05 10:31:06,640 INFO L138 BoogieDeclarations]: Found implementation of procedure findmin [2019-08-05 10:31:06,714 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:31:06,953 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:06,953 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:31:06,955 INFO L202 PluginConnector]: Adding new model 2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:06 BoogieIcfgContainer [2019-08-05 10:31:06,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:06,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:06,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:06,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:06,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:06" (1/2) ... [2019-08-05 10:31:06,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@903f9e and model type 2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:06, skipping insertion in model container [2019-08-05 10:31:06,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:06" (2/2) ... [2019-08-05 10:31:06,966 INFO L109 eAbstractionObserver]: Analyzing ICFG 2019ProgVerif-Sheet12Ex04-Minimum.bpl [2019-08-05 10:31:06,979 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:06,988 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:31:07,010 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:31:07,041 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:07,042 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:07,042 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:07,042 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:07,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:07,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:07,043 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:07,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:07,043 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:31:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:31:07,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:07,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:31:07,085 INFO L418 AbstractCegarLoop]: === Iteration 1 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash 52536, now seen corresponding path program 1 times [2019-08-05 10:31:07,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:07,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:07,282 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:31:07,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:07,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:31:07,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:07,308 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:31:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:07,377 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:31:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:07,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:31:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:07,390 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:31:07,390 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:31:07,392 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:31:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:31:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:31:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:31:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:31:07,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:31:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:07,426 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:31:07,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:31:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:07,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:07,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:31:07,428 INFO L418 AbstractCegarLoop]: === Iteration 2 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash 50037029, now seen corresponding path program 1 times [2019-08-05 10:31:07,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:07,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:07,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:07,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:07,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:31:07,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:07,517 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 10:31:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:07,606 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:31:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:07,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:31:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:07,607 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:31:07,607 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:31:07,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:31:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:31:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:31:07,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:31:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:07,611 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:31:07,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:31:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:07,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:07,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:31:07,612 INFO L418 AbstractCegarLoop]: === Iteration 3 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1551384265, now seen corresponding path program 1 times [2019-08-05 10:31:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:07,654 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:07,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:07,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:08,128 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2019-08-05 10:31:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:08,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:08,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:08,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:08,291 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2019-08-05 10:31:08,655 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-08-05 10:31:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:08,724 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 10:31:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:08,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:31:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:08,727 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:31:08,728 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:08,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 10:31:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:31:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 10:31:08,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2019-08-05 10:31:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:08,731 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 10:31:08,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 10:31:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:08,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:08,733 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 10:31:08,733 INFO L418 AbstractCegarLoop]: === Iteration 4 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:08,734 INFO L82 PathProgramCache]: Analyzing trace with hash -868149352, now seen corresponding path program 2 times [2019-08-05 10:31:08,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:08,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:08,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:31:08,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:08,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:08,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:08,844 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2019-08-05 10:31:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:09,031 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 10:31:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:09,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:31:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:09,035 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:09,035 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:09,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:31:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 10:31:09,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-08-05 10:31:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:09,040 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 10:31:09,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 10:31:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:09,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,041 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2019-08-05 10:31:09,041 INFO L418 AbstractCegarLoop]: === Iteration 5 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1142589770, now seen corresponding path program 3 times [2019-08-05 10:31:09,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:09,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:09,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:09,154 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 7 states. [2019-08-05 10:31:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:09,314 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 10:31:09,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:09,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:31:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:09,315 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:09,315 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:09,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:31:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:31:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:31:09,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-08-05 10:31:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:09,319 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:31:09,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:31:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:09,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,320 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 10:31:09,320 INFO L418 AbstractCegarLoop]: === Iteration 6 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1951293550, now seen corresponding path program 4 times [2019-08-05 10:31:09,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:09,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:09,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:09,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:09,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:10,122 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-08-05 10:31:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:10,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:10,132 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 10 states. [2019-08-05 10:31:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,330 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 10:31:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:10,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 10:31:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,331 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:31:10,332 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:10,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 10:31:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 10:31:10,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2019-08-05 10:31:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,336 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 10:31:10,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 10:31:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:10,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,337 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1] [2019-08-05 10:31:10,338 INFO L418 AbstractCegarLoop]: === Iteration 7 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash -360321540, now seen corresponding path program 5 times [2019-08-05 10:31:10,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:10,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:10,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:10,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:10,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:10,459 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-08-05 10:31:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,621 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 10:31:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:10,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:31:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,622 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:31:10,622 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:10,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:10,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 10:31:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-08-05 10:31:10,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2019-08-05 10:31:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,626 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-08-05 10:31:10,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-08-05 10:31:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:10,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,627 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1] [2019-08-05 10:31:10,628 INFO L418 AbstractCegarLoop]: === Iteration 8 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1251306954, now seen corresponding path program 6 times [2019-08-05 10:31:10,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:10,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:10,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:10,778 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 9 states. [2019-08-05 10:31:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,990 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-08-05 10:31:10,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:10,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:31:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,992 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:31:10,992 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:10,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 10:31:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-08-05 10:31:10,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2019-08-05 10:31:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,998 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-08-05 10:31:10,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-08-05 10:31:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:10,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,999 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 10:31:11,001 INFO L418 AbstractCegarLoop]: === Iteration 9 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash -135573544, now seen corresponding path program 7 times [2019-08-05 10:31:11,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:31:11,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:11,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:11,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:11,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:11,137 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 9 states. [2019-08-05 10:31:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,276 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-08-05 10:31:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:11,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 10:31:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,280 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:31:11,280 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:31:11,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:31:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:31:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:31:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-08-05 10:31:11,284 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 13 [2019-08-05 10:31:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,285 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-08-05 10:31:11,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-08-05 10:31:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:11,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,286 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2019-08-05 10:31:11,286 INFO L418 AbstractCegarLoop]: === Iteration 10 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -92321025, now seen corresponding path program 8 times [2019-08-05 10:31:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:31:11,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:11,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:11,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:11,506 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 8 states. [2019-08-05 10:31:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,649 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-08-05 10:31:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:31:11,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:31:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,650 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:31:11,651 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:11,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:31:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-08-05 10:31:11,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2019-08-05 10:31:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,654 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-08-05 10:31:11,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-08-05 10:31:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:11,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,655 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 1, 1, 1] [2019-08-05 10:31:11,655 INFO L418 AbstractCegarLoop]: === Iteration 11 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1899314089, now seen corresponding path program 9 times [2019-08-05 10:31:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,299 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,253 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-08-05 10:31:13,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:13,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,885 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-08-05 10:31:14,536 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-08-05 10:31:14,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:14,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:14,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:14,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:14,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:14,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:14,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:14,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,376 WARN L188 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-08-05 10:31:15,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:15,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:15,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,595 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 201 [2019-08-05 10:31:16,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:16,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:16,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,000 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 264 [2019-08-05 10:31:18,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:18,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:18,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:18,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:18,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:18,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:18,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:48,644 WARN L188 SmtUtils]: Spent 29.70 s on a formula simplification that was a NOOP. DAG size: 463 [2019-08-05 10:31:48,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 256 terms [2019-08-05 10:31:49,263 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-08-05 10:31:49,395 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-08-05 10:31:49,979 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-08-05 10:32:37,240 WARN L188 SmtUtils]: Spent 36.35 s on a formula simplification that was a NOOP. DAG size: 3607 [2019-08-05 10:32:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:37,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:37,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:37,323 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 18 states. [2019-08-05 10:32:40,681 WARN L188 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 292 DAG size of output: 135 [2019-08-05 10:32:50,337 WARN L188 SmtUtils]: Spent 9.11 s on a formula simplification. DAG size of input: 524 DAG size of output: 122 [2019-08-05 10:34:48,113 WARN L188 SmtUtils]: Spent 1.93 m on a formula simplification. DAG size of input: 4008 DAG size of output: 504 [2019-08-05 10:34:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:48,515 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-08-05 10:34:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:34:48,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:34:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:48,517 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:34:48,517 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:34:48,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 203.5s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:34:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:34:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-08-05 10:34:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:34:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-08-05 10:34:48,522 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-08-05 10:34:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:48,522 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-08-05 10:34:48,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:34:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-08-05 10:34:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:34:48,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:48,525 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 3, 1, 1, 1] [2019-08-05 10:34:48,525 INFO L418 AbstractCegarLoop]: === Iteration 12 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1250569019, now seen corresponding path program 10 times [2019-08-05 10:34:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:48,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:34:48,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 54 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:34:48,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:48,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:34:48,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:34:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:34:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:34:48,694 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 11 states. [2019-08-05 10:34:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:48,800 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-08-05 10:34:48,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:34:48,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:34:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:48,802 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:34:48,802 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:34:48,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:34:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:34:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-08-05 10:34:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:34:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-08-05 10:34:48,807 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2019-08-05 10:34:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:48,807 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-08-05 10:34:48,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:34:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-08-05 10:34:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:34:48,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:48,809 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 3, 1, 1, 1] [2019-08-05 10:34:48,809 INFO L418 AbstractCegarLoop]: === Iteration 13 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash -785856379, now seen corresponding path program 11 times [2019-08-05 10:34:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:48,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:34:48,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 10:34:48,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:48,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:34:48,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:34:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:34:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:34:48,938 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 11 states. [2019-08-05 10:34:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:49,147 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-08-05 10:34:49,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:34:49,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:34:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:49,149 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:34:49,149 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:34:49,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:34:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:34:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-08-05 10:34:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:34:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-08-05 10:34:49,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 19 [2019-08-05 10:34:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:49,156 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-08-05 10:34:49,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:34:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-08-05 10:34:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:49,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:49,158 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 4, 1, 1, 1] [2019-08-05 10:34:49,158 INFO L418 AbstractCegarLoop]: === Iteration 14 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash -989132168, now seen corresponding path program 12 times [2019-08-05 10:34:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:49,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:34:49,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 58 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 10:34:49,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:49,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:34:49,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:34:49,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:34:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:34:49,528 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 10 states. [2019-08-05 10:34:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:49,682 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-08-05 10:34:49,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:34:49,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-08-05 10:34:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:49,684 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:34:49,684 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:34:49,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:34:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:34:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:34:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:34:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-08-05 10:34:49,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2019-08-05 10:34:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:49,689 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-08-05 10:34:49,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:34:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-08-05 10:34:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:34:49,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:49,690 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1] [2019-08-05 10:34:49,690 INFO L418 AbstractCegarLoop]: === Iteration 15 === [findminErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1633492588, now seen corresponding path program 13 times [2019-08-05 10:34:49,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:57,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:57,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:57,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:57,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:57,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:57,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,129 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-08-05 10:34:58,303 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-08-05 10:34:58,438 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-08-05 10:34:58,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,700 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:34:58,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:58,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:58,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:58,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,075 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-08-05 10:34:59,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,817 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-08-05 10:34:59,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:34:59,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:59,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:35:14,227 WARN L188 SmtUtils]: Spent 13.83 s on a formula simplification that was a NOOP. DAG size: 463 [2019-08-05 10:35:14,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 128 terms [2019-08-05 10:35:14,642 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:35:14,973 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:35:15,321 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:35:15,426 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:35:32,704 WARN L188 SmtUtils]: Spent 12.10 s on a formula simplification that was a NOOP. DAG size: 1565 Received shutdown request... [2019-08-05 10:35:35,056 WARN L196 SmtUtils]: Removed 119 from assertion stack [2019-08-05 10:35:35,056 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:35:35,056 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:35:35,061 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:35:35,061 INFO L202 PluginConnector]: Adding new model 2019ProgVerif-Sheet12Ex04-Minimum.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:35 BoogieIcfgContainer [2019-08-05 10:35:35,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:35,063 INFO L168 Benchmark]: Toolchain (without parser) took 268556.55 ms. Allocated memory was 140.5 MB in the beginning and 516.4 MB in the end (delta: 375.9 MB). Free memory was 110.1 MB in the beginning and 365.1 MB in the end (delta: -255.0 MB). Peak memory consumption was 404.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:35,064 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:35:35,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.14 ms. Allocated memory is still 140.5 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:35,066 INFO L168 Benchmark]: Boogie Preprocessor took 23.15 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:35,067 INFO L168 Benchmark]: RCFGBuilder took 388.11 ms. Allocated memory is still 140.5 MB. Free memory was 106.8 MB in the beginning and 94.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:35,068 INFO L168 Benchmark]: TraceAbstraction took 268104.10 ms. Allocated memory was 140.5 MB in the beginning and 516.4 MB in the end (delta: 375.9 MB). Free memory was 94.6 MB in the beginning and 365.1 MB in the end (delta: -270.5 MB). Peak memory consumption was 388.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:35,071 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.23 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.14 ms. Allocated memory is still 140.5 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.15 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 388.11 ms. Allocated memory is still 140.5 MB. Free memory was 106.8 MB in the beginning and 94.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 268104.10 ms. Allocated memory was 140.5 MB in the beginning and 516.4 MB in the end (delta: 375.9 MB). Free memory was 94.6 MB in the beginning and 365.1 MB in the end (delta: -270.5 MB). Peak memory consumption was 388.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that procedure postcondition always holds (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1567 for 1392ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 268.0s OverallTime, 15 OverallIterations, 16 TraceHistogramMax, 133.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 108 SDslu, 2 SDs, 0 SdLazy, 793 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 207.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=13, 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 87.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 5 QuantifiedInterpolants, 1547458 SizeOfPredicates, 26 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 186/534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown