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/abstractInterpretation/regression/all/recursive-easy-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:13:17,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:13:17,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:13:17,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:13:17,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:13:17,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:13:17,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:13:17,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:13:17,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:13:17,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:13:17,308 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:13:17,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:13:17,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:13:17,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:13:17,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:13:17,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:13:17,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:13:17,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:13:17,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:13:17,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:13:17,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:13:17,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:13:17,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:13:17,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:13:17,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:13:17,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:13:17,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:13:17,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:13:17,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:13:17,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:13:17,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:13:17,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:13:17,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:13:17,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:13:17,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:13:17,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:13:17,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:13:17,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:13:17,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:13:17,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:13:17,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:13:17,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:13:17,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:13:17,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:13:17,404 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:13:17,405 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:13:17,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/all/recursive-easy-2.bpl [2019-08-05 11:13:17,406 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/all/recursive-easy-2.bpl' [2019-08-05 11:13:17,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:13:17,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:13:17,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:17,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:13:17,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:13:17,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:17,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:13:17,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:13:17,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:13:17,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/1) ... [2019-08-05 11:13:17,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:13:17,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:13:17,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:13:17,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:13:17,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (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:13:17,577 INFO L124 BoogieDeclarations]: Specification and implementation of procedure add given in one single declaration [2019-08-05 11:13:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure add [2019-08-05 11:13:17,578 INFO L138 BoogieDeclarations]: Found implementation of procedure add [2019-08-05 11:13:17,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:13:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:13:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:13:17,869 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:13:17,869 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:13:17,872 INFO L202 PluginConnector]: Adding new model recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:17 BoogieIcfgContainer [2019-08-05 11:13:17,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:13:17,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:13:17,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:13:17,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:13:17,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:17" (1/2) ... [2019-08-05 11:13:17,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcd1351 and model type recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:13:17, skipping insertion in model container [2019-08-05 11:13:17,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:17" (2/2) ... [2019-08-05 11:13:17,883 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-easy-2.bpl [2019-08-05 11:13:17,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:13:17,904 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:13:17,924 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:13:17,959 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:13:17,960 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:13:17,960 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:13:17,960 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:13:17,960 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:13:17,961 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:13:17,961 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:13:17,961 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:13:17,961 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:13:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:13:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:13:17,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:13:17,986 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1522303530, now seen corresponding path program 1 times [2019-08-05 11:13:18,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,140 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:13:18,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:18,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:13:18,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:18,164 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 11:13:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,304 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 11:13:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:18,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:13:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,319 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:13:18,319 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:13:18,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:13:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:13:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:13:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:13:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 11:13:18,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2019-08-05 11:13:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,367 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 11:13:18,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 11:13:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:13:18,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,370 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:18,371 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 630648948, now seen corresponding path program 1 times [2019-08-05 11:13:18,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:13:18,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:13:18,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:18,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:18,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:18,520 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 4 states. [2019-08-05 11:13:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,673 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-08-05 11:13:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:13:18,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:13:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,675 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:13:18,676 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:13:18,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:13:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:13:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:13:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 11:13:18,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 10 [2019-08-05 11:13:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,684 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 11:13:18,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:13:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 11:13:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:13:18,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,685 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:13:18,686 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1371407298, now seen corresponding path program 2 times [2019-08-05 11:13:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:13:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:13:18,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:13:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:13:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:18,783 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 5 states. [2019-08-05 11:13:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,929 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-08-05 11:13:18,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:13:18,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-08-05 11:13:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,932 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:13:18,932 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:13:18,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:13:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:13:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:13:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-08-05 11:13:18,940 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 14 [2019-08-05 11:13:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,940 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-08-05 11:13:18,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:13:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2019-08-05 11:13:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:13:18,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,942 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 11:13:18,942 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1572321912, now seen corresponding path program 3 times [2019-08-05 11:13:18,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:13:19,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:13:19,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:13:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:13:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:19,223 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 7 states. [2019-08-05 11:13:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,353 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-08-05 11:13:19,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:13:19,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 11:13:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,355 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:13:19,356 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:13:19,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:13:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-08-05 11:13:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:13:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-08-05 11:13:19,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 18 [2019-08-05 11:13:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,365 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-08-05 11:13:19,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:13:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-08-05 11:13:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:13:19,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,368 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 11:13:19,368 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2030857298, now seen corresponding path program 4 times [2019-08-05 11:13:19,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-08-05 11:13:19,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:19,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:13:19,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:13:19,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:13:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:13:19,469 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 6 states. [2019-08-05 11:13:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,676 INFO L93 Difference]: Finished difference Result 33 states and 54 transitions. [2019-08-05 11:13:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:13:19,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-08-05 11:13:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,686 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:13:19,687 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:13:19,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:13:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:13:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:13:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:13:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 11:13:19,700 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2019-08-05 11:13:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,701 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 11:13:19,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:13:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 11:13:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:13:19,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,703 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:19,704 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1196389401, now seen corresponding path program 1 times [2019-08-05 11:13:19,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:13:19,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:13:19,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:19,799 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-08-05 11:13:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,863 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-08-05 11:13:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:13:19,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 11:13:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,864 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:13:19,864 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:13:19,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:13:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:13:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:13:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:13:19,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-08-05 11:13:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,866 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:13:19,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:13:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:13:19,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:13:19,871 INFO L202 PluginConnector]: Adding new model recursive-easy-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:13:19 BoogieIcfgContainer [2019-08-05 11:13:19,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:13:19,874 INFO L168 Benchmark]: Toolchain (without parser) took 2429.95 ms. Allocated memory was 138.9 MB in the beginning and 179.3 MB in the end (delta: 40.4 MB). Free memory was 108.6 MB in the beginning and 108.5 MB in the end (delta: 123.1 kB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:19,875 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 109.7 MB in the beginning and 109.5 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:13:19,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.56 ms. Allocated memory is still 138.9 MB. Free memory was 108.4 MB in the beginning and 106.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:19,877 INFO L168 Benchmark]: Boogie Preprocessor took 23.13 ms. Allocated memory is still 138.9 MB. Free memory was 106.6 MB in the beginning and 105.7 MB in the end (delta: 933.5 kB). Peak memory consumption was 933.5 kB. Max. memory is 7.1 GB. [2019-08-05 11:13:19,878 INFO L168 Benchmark]: RCFGBuilder took 364.73 ms. Allocated memory is still 138.9 MB. Free memory was 105.5 MB in the beginning and 95.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:19,879 INFO L168 Benchmark]: TraceAbstraction took 1996.76 ms. Allocated memory was 138.9 MB in the beginning and 179.3 MB in the end (delta: 40.4 MB). Free memory was 95.5 MB in the beginning and 108.5 MB in the end (delta: -13.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:19,883 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 109.7 MB in the beginning and 109.5 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 40.56 ms. Allocated memory is still 138.9 MB. Free memory was 108.4 MB in the beginning and 106.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.13 ms. Allocated memory is still 138.9 MB. Free memory was 106.6 MB in the beginning and 105.7 MB in the end (delta: 933.5 kB). Peak memory consumption was 933.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 364.73 ms. Allocated memory is still 138.9 MB. Free memory was 105.5 MB in the beginning and 95.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1996.76 ms. Allocated memory was 138.9 MB in the beginning and 179.3 MB in the end (delta: 40.4 MB). Free memory was 95.5 MB in the beginning and 108.5 MB in the end (delta: -13.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. SAFE Result, 1.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 12 SDslu, 75 SDs, 0 SdLazy, 166 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 2855 SizeOfPredicates, 1 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 84/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...