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/recursive/regression/bpl/addition-incorrect2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:07:54,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:07:54,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:07:54,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:07:54,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:07:54,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:07:54,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:07:54,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:07:54,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:07:54,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:07:54,368 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:07:54,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:07:54,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:07:54,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:07:54,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:07:54,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:07:54,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:07:54,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:07:54,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:07:54,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:07:54,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:07:54,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:07:54,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:07:54,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:07:54,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:07:54,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:07:54,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:07:54,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:07:54,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:07:54,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:07:54,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:07:54,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:07:54,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:07:54,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:07:54,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:07:54,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:07:54,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:07:54,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:07:54,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:07:54,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:07:54,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:07:54,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:07:54,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:07:54,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:07:54,454 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:07:54,454 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:07:54,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/addition-incorrect2.bpl [2019-08-05 11:07:54,457 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/addition-incorrect2.bpl' [2019-08-05 11:07:54,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:07:54,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:07:54,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:54,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:07:54,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:07:54,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,541 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:07:54,541 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:07:54,541 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:07:54,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:54,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:07:54,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:07:54,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:07:54,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:07:54,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:07:54,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:07:54,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:07:54,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (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 11:07:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:07:54,652 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:07:54,652 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2019-08-05 11:07:54,652 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2019-08-05 11:07:54,727 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 11:07:54,887 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 11:07:54,997 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:07:54,998 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:07:54,999 INFO L202 PluginConnector]: Adding new model addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:54 BoogieIcfgContainer [2019-08-05 11:07:54,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:07:55,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:07:55,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:07:55,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:07:55,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/2) ... [2019-08-05 11:07:55,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e1ca61 and model type addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:07:55, skipping insertion in model container [2019-08-05 11:07:55,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:54" (2/2) ... [2019-08-05 11:07:55,016 INFO L109 eAbstractionObserver]: Analyzing ICFG addition-incorrect2.bpl [2019-08-05 11:07:55,039 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:07:55,059 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-08-05 11:07:55,093 INFO L252 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-08-05 11:07:55,150 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:07:55,151 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:07:55,151 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:07:55,151 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:07:55,152 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:07:55,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:07:55,152 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:07:55,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:07:55,152 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:07:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-08-05 11:07:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:55,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:55,181 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 11:07:55,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,311 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 11:07:55,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:55,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:55,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,334 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-08-05 11:07:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,394 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 11:07:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:55,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,406 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:07:55,406 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:07:55,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 11:07:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:07:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:07:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:07:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:07:55,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 2 [2019-08-05 11:07:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,444 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:07:55,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:07:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:55,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:55,446 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2019-08-05 11:07:55,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,506 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 11:07:55,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:55,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,511 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2019-08-05 11:07:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,563 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:07:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:55,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,566 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:07:55,566 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:07:55,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 11:07:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:07:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:07:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:07:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:07:55,572 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 2 [2019-08-05 11:07:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,573 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:07:55,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:07:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:55,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:55,575 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 37838, now seen corresponding path program 1 times [2019-08-05 11:07:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,703 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 11:07:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:55,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,705 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-08-05 11:07:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,831 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:07:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:55,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:07:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,833 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:07:55,833 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:07:55,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:07:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:07:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:07:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:07:55,837 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 3 [2019-08-05 11:07:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,838 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:07:55,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:07:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:55,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:55,839 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash 37898, now seen corresponding path program 1 times [2019-08-05 11:07:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,914 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 11:07:55,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:55,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:55,916 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2019-08-05 11:07:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,106 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-05 11:07:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:07:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,109 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:07:56,109 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:07:56,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:07:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-08-05 11:07:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:07:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:07:56,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 3 [2019-08-05 11:07:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,116 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:07:56,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:07:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:07:56,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:07:56,118 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1173030, now seen corresponding path program 1 times [2019-08-05 11:07:56,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,189 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 11:07:56,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:56,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:56,191 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-08-05 11:07:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,240 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:07:56,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:56,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:07:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,242 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:07:56,242 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:07:56,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:07:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:07:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:07:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:07:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:07:56,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 4 [2019-08-05 11:07:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,247 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:07:56,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:07:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:56,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,249 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 777535240, now seen corresponding path program 1 times [2019-08-05 11:07:56,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,391 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 11:07:56,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:56,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:56,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:56,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,393 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2019-08-05 11:07:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,505 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:07:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:07:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,506 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:07:56,506 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:07:56,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:07:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:07:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:07:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 11:07:56,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2019-08-05 11:07:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,512 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 11:07:56,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 11:07:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:07:56,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,513 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1666211298, now seen corresponding path program 1 times [2019-08-05 11:07:56,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,608 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 11:07:56,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:56,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,610 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2019-08-05 11:07:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,716 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 11:07:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:56,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:07:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,717 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:07:56,718 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:07:56,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:07:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:07:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:07:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:07:56,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2019-08-05 11:07:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,722 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:07:56,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:07:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:07:56,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,723 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,724 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 919761605, now seen corresponding path program 1 times [2019-08-05 11:07:56,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:07:56,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:07:56,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,855 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2019-08-05 11:07:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,905 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 11:07:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:07:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,908 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:07:56,908 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:07:56,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:07:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:07:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:07:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 11:07:56,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-08-05 11:07:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,913 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 11:07:56,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 11:07:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:07:56,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,914 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,915 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1231304857, now seen corresponding path program 1 times [2019-08-05 11:07:56,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:07:56,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:07:56,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,979 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2019-08-05 11:07:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,048 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:07:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:57,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-08-05 11:07:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,050 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:07:57,050 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:07:57,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:07:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:07:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:07:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 11:07:57,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2019-08-05 11:07:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,056 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 11:07:57,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 11:07:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:07:57,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,057 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,058 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 484255135, now seen corresponding path program 1 times [2019-08-05 11:07:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,421 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:07:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:07:57,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:07:57,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:07:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:07:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:57,425 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 7 states. [2019-08-05 11:07:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,592 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:07:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:57,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-08-05 11:07:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,593 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:07:57,593 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:07:57,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:07:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:07:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:07:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:07:57,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2019-08-05 11:07:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,600 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:07:57,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:07:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:07:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:07:57,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,601 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1] [2019-08-05 11:07:57,602 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash -328984954, now seen corresponding path program 2 times [2019-08-05 11:07:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 11:07:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:07:57,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:57,745 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2019-08-05 11:07:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,864 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 11:07:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:57,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-08-05 11:07:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,865 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:07:57,865 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:07:57,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:07:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:07:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:07:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:07:57,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2019-08-05 11:07:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,870 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:07:57,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:07:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:07:57,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,871 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,872 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1330349672, now seen corresponding path program 2 times [2019-08-05 11:07:57,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 11:07:57,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:07:57,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:07:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:07:57,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:57,982 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-08-05 11:07:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,109 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:07:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:07:58,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-08-05 11:07:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,111 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:07:58,111 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:07:58,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:07:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 11:07:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:07:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-08-05 11:07:58,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2019-08-05 11:07:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,116 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-08-05 11:07:58,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:07:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-08-05 11:07:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:07:58,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,118 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,118 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1708833090, now seen corresponding path program 2 times [2019-08-05 11:07:58,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:07:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:07:58,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:07:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:07:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:58,331 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-08-05 11:07:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,526 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:07:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:07:58,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-08-05 11:07:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,527 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:07:58,528 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:07:58,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:07:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:07:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:07:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 11:07:58,532 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2019-08-05 11:07:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,532 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 11:07:58,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:07:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 11:07:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:07:58,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,533 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1] [2019-08-05 11:07:58,534 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 84355045, now seen corresponding path program 3 times [2019-08-05 11:07:58,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:07:58,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:07:58,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:58,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:58,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:58,671 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2019-08-05 11:07:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,811 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-08-05 11:07:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:58,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-08-05 11:07:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,813 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:07:58,813 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:07:58,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:07:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:07:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:07:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 11:07:58,818 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-08-05 11:07:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,819 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 11:07:58,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 11:07:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:07:58,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,820 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,820 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash -249289849, now seen corresponding path program 3 times [2019-08-05 11:07:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:07:58,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:07:58,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:07:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:07:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:58,911 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-08-05 11:07:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,031 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 11:07:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:59,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 11:07:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,033 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:07:59,033 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:07:59,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:07:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:07:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:07:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:07:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-05 11:07:59,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 26 [2019-08-05 11:07:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,039 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-05 11:07:59,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:07:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-05 11:07:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:07:59,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,041 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:59,041 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash 861949311, now seen corresponding path program 3 times [2019-08-05 11:07:59,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:07:59,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:07:59,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:07:59,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:07:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:59,215 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2019-08-05 11:07:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,360 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 11:07:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:59,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 11:07:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,363 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:07:59,363 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:07:59,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:07:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 11:07:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:07:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:07:59,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 27 [2019-08-05 11:07:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,368 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:07:59,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:07:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:07:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:07:59,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,369 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1] [2019-08-05 11:07:59,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash -549982490, now seen corresponding path program 4 times [2019-08-05 11:07:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 11:07:59,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:07:59,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:07:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:07:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:59,512 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2019-08-05 11:07:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,645 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 11:07:59,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:59,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 11:07:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,647 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:07:59,647 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:07:59,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:07:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:07:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:07:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 11:07:59,653 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2019-08-05 11:07:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,653 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 11:07:59,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:07:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 11:07:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:07:59,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,655 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 11:07:59,656 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 635958728, now seen corresponding path program 4 times [2019-08-05 11:07:59,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 11:07:59,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:07:59,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:07:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:07:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:59,820 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-08-05 11:07:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,938 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 11:07:59,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:07:59,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-08-05 11:07:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,940 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:07:59,940 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:07:59,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:07:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:07:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-08-05 11:07:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:07:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-08-05 11:07:59,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 32 [2019-08-05 11:07:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,947 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-08-05 11:07:59,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:07:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-08-05 11:07:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:07:59,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,948 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:59,948 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1760115874, now seen corresponding path program 4 times [2019-08-05 11:07:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:08:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:00,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:00,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:00,296 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2019-08-05 11:08:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:00,507 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 11:08:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:00,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-08-05 11:08:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:00,508 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:08:00,508 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:08:00,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:08:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:08:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:08:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 11:08:00,513 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 33 [2019-08-05 11:08:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:00,513 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 11:08:00,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 11:08:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:08:00,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:00,514 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1] [2019-08-05 11:08:00,515 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:00,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:00,515 INFO L82 PathProgramCache]: Analyzing trace with hash 505607429, now seen corresponding path program 5 times [2019-08-05 11:08:00,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:00,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:08:00,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:08:00,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:00,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:08:00,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:08:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:08:00,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:00,773 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2019-08-05 11:08:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,005 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-08-05 11:08:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:08:01,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-08-05 11:08:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,009 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:08:01,009 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:08:01,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:08:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:08:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:08:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 11:08:01,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 34 [2019-08-05 11:08:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,014 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 11:08:01,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:08:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 11:08:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:08:01,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,016 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:08:01,016 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2030102617, now seen corresponding path program 5 times [2019-08-05 11:08:01,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:08:01,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:01,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:08:01,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:08:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:08:01,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:01,195 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2019-08-05 11:08:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,355 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 11:08:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:08:01,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-08-05 11:08:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,357 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:08:01,357 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:08:01,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:08:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-08-05 11:08:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:08:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-08-05 11:08:01,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 38 [2019-08-05 11:08:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,362 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-08-05 11:08:01,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:08:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-08-05 11:08:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:08:01,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,363 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:01,364 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1491328351, now seen corresponding path program 5 times [2019-08-05 11:08:01,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 11:08:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:01,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:01,615 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2019-08-05 11:08:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,863 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 11:08:01,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:01,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-08-05 11:08:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,867 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:08:01,867 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:08:01,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:08:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:08:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:08:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 11:08:01,871 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 39 [2019-08-05 11:08:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,872 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 11:08:01,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 11:08:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:08:01,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,873 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1] [2019-08-05 11:08:01,874 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1057451846, now seen corresponding path program 6 times [2019-08-05 11:08:01,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-08-05 11:08:02,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:08:02,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:08:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:08:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:02,293 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2019-08-05 11:08:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:02,489 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-08-05 11:08:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:08:02,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-08-05 11:08:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:02,490 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:08:02,490 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:08:02,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:08:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:08:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:08:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 11:08:02,495 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 40 [2019-08-05 11:08:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,495 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 11:08:02,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:08:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 11:08:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:08:02,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,496 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:08:02,497 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash 65506600, now seen corresponding path program 6 times [2019-08-05 11:08:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-08-05 11:08:03,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:03,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:03,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:03,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:03,099 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 10 states. [2019-08-05 11:08:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,176 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 11:08:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:03,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-08-05 11:08:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,177 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:08:03,178 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:08:03,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:08:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-08-05 11:08:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:08:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-08-05 11:08:03,181 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 44 [2019-08-05 11:08:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,182 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-08-05 11:08:03,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-08-05 11:08:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:08:03,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,183 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1] [2019-08-05 11:08:03,183 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1623972389, now seen corresponding path program 7 times [2019-08-05 11:08:03,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:08:03,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:03,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:03,423 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2019-08-05 11:08:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,806 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-08-05 11:08:03,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:03,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-08-05 11:08:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,807 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:08:03,807 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:08:03,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:08:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 11:08:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:08:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-08-05 11:08:03,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 46 [2019-08-05 11:08:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,812 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-08-05 11:08:03,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-08-05 11:08:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:08:03,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,813 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:03,813 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2030704638, now seen corresponding path program 6 times [2019-08-05 11:08:03,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:04,235 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:08:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:08:04,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:08:04,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:08:04,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:08:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:04,244 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 11 states. [2019-08-05 11:08:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,614 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 11:08:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:08:04,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-08-05 11:08:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,615 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:08:04,615 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:08:04,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:08:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:08:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:08:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 11:08:04,621 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 45 [2019-08-05 11:08:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,621 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 11:08:04,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:08:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 11:08:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:08:04,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,622 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:08:04,622 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr2ASSERT_VIOLATIONASSERT, additionErr3ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1760386105, now seen corresponding path program 7 times [2019-08-05 11:08:04,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:08:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:08:04,681 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:08:04,699 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,700 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,700 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,701 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,701 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,701 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,702 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,702 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) [2019-08-05 11:08:04,725 INFO L202 PluginConnector]: Adding new model addition-incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:08:04 BoogieIcfgContainer [2019-08-05 11:08:04,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:08:04,726 INFO L168 Benchmark]: Toolchain (without parser) took 10227.70 ms. Allocated memory was 138.9 MB in the beginning and 302.5 MB in the end (delta: 163.6 MB). Free memory was 108.5 MB in the beginning and 273.3 MB in the end (delta: -164.7 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:04,727 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.83 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:08:04,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.61 ms. Allocated memory is still 138.9 MB. Free memory was 108.5 MB in the beginning and 106.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:04,729 INFO L168 Benchmark]: Boogie Preprocessor took 25.87 ms. Allocated memory is still 138.9 MB. Free memory was 106.5 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:04,730 INFO L168 Benchmark]: RCFGBuilder took 427.94 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 94.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:04,731 INFO L168 Benchmark]: TraceAbstraction took 9719.32 ms. Allocated memory was 138.9 MB in the beginning and 302.5 MB in the end (delta: 163.6 MB). Free memory was 94.4 MB in the beginning and 273.3 MB in the end (delta: -178.8 MB). Peak memory consumption was 143.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:04,735 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.83 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.61 ms. Allocated memory is still 138.9 MB. Free memory was 108.5 MB in the beginning and 106.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.87 ms. Allocated memory is still 138.9 MB. Free memory was 106.5 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.94 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 94.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9719.32 ms. Allocated memory was 138.9 MB in the beginning and 302.5 MB in the end (delta: 163.6 MB). Free memory was 94.4 MB in the beginning and 273.3 MB in the end (delta: -178.8 MB). Peak memory consumption was 143.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures res >= x + y - 2; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: assertion can be violated assertion can be violated We found a FailurePath: [L14] free requires a >= 0; [L15] free requires b >= 0; VAL [a=7, b=7] [L20] CALL call c := addition(a, b); VAL [x=7, y=7] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=7, y=7] [L32] COND FALSE !(y == 0) VAL [x=7, y=7] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=8, y=6] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=8, y=6] [L32] COND FALSE !(y == 0) VAL [x=8, y=6] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=9, y=5] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=9, y=5] [L32] COND FALSE !(y == 0) VAL [x=9, y=5] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=10, y=4] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=10, y=4] [L32] COND FALSE !(y == 0) VAL [x=10, y=4] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=11, y=3] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=11, y=3] [L32] COND FALSE !(y == 0) VAL [x=11, y=3] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=12, y=2] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=12, y=2] [L32] COND FALSE !(y == 0) VAL [x=12, y=2] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=13, y=1] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=13, y=1] [L32] COND FALSE !(y == 0) VAL [x=13, y=1] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=14, y=0] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=14, y=0] [L32] COND TRUE y == 0 [L33] res := x; VAL [res=14, x=14, y=0] [L38] assert x + y >= 0; VAL [res=14, x=14, y=0] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=13, y=1] [L38] assert x + y >= 0; VAL [res=14, x=13, y=1] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=12, y=2] [L38] assert x + y >= 0; VAL [res=14, x=12, y=2] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=11, y=3] [L38] assert x + y >= 0; VAL [res=14, x=11, y=3] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=10, y=4] [L38] assert x + y >= 0; VAL [res=14, x=10, y=4] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=9, y=5] [L38] assert x + y >= 0; VAL [res=14, x=9, y=5] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=8, y=6] [L38] assert x + y >= 0; VAL [res=14, x=8, y=6] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=7, y=7] [L38] assert x + y >= 0; VAL [res=14, x=7, y=7] [L20] RET call c := addition(a, b); VAL [a=7, b=7, c=14] [L21] assert a == 7 && b == 7 ==> c == 5; VAL [a=7, b=7, c=14] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 8 error locations. UNSAFE Result, 9.5s OverallTime, 27 OverallIterations, 8 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 153 SDslu, 354 SDs, 0 SdLazy, 2045 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 31 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 84643 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1344 ConjunctsInSsa, 374 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 514/1078 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...