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/unclassified/EasyRecursive_incorrect2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:10,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:10,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:10,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:10,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:10,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:10,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:10,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:10,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:10,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:10,189 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:10,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:10,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:10,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:10,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:10,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:10,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:10,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:10,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:10,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:10,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:10,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:10,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:10,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:10,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:10,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:10,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:10,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:10,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:10,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:10,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:10,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:10,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:10,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:10,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:10,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:10,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:10,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:10,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:10,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:10,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:10,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:10,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:10,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:10,267 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:10,268 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:10,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyRecursive_incorrect2.bpl [2019-08-05 11:14:10,269 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyRecursive_incorrect2.bpl' [2019-08-05 11:14:10,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:10,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:10,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:10,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:10,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:10,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,330 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:10,330 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:10,330 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:10,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:10,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:10,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:10,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:10,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/1) ... [2019-08-05 11:14:10,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:10,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:10,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:10,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:10,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (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:14:10,424 INFO L124 BoogieDeclarations]: Specification and implementation of procedure add given in one single declaration [2019-08-05 11:14:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure add [2019-08-05 11:14:10,424 INFO L138 BoogieDeclarations]: Found implementation of procedure add [2019-08-05 11:14:10,425 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:10,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:10,700 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:10,701 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:10,702 INFO L202 PluginConnector]: Adding new model EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:10 BoogieIcfgContainer [2019-08-05 11:14:10,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:10,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:10,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:10,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:10,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:10" (1/2) ... [2019-08-05 11:14:10,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55540c21 and model type EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:10, skipping insertion in model container [2019-08-05 11:14:10,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:10" (2/2) ... [2019-08-05 11:14:10,711 INFO L109 eAbstractionObserver]: Analyzing ICFG EasyRecursive_incorrect2.bpl [2019-08-05 11:14:10,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:10,728 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:10,744 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:10,771 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:10,772 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:10,772 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:10,772 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:10,772 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:10,773 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:10,773 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:10,773 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:10,773 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 11:14:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:14:10,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:10,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:10,802 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1946389013, now seen corresponding path program 1 times [2019-08-05 11:14:10,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:10,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:10,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,942 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:14:10,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:10,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:10,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:10,967 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 11:14:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,122 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 11:14:11,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:11,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 11:14:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,136 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:11,136 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:14:11,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:14:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:14:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:14:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 11:14:11,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2019-08-05 11:14:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,184 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 11:14:11,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 11:14:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:11,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,187 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:11,188 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 420527133, now seen corresponding path program 1 times [2019-08-05 11:14:11,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,344 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:14:11,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:11,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:11,348 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2019-08-05 11:14:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,598 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-08-05 11:14:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:11,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 11:14:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,601 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:14:11,601 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:14:11,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:14:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:14:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:14:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:14:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-08-05 11:14:11,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2019-08-05 11:14:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,611 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-08-05 11:14:11,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-08-05 11:14:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:11,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,613 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:11,614 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash -7967579, now seen corresponding path program 2 times [2019-08-05 11:14:11,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,718 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:14:11,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:11,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:11,720 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 5 states. [2019-08-05 11:14:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,895 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 11:14:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:11,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-08-05 11:14:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,901 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:11,901 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:11,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:14:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:14:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:14:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 11:14:11,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2019-08-05 11:14:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,908 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 11:14:11,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 11:14:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:14:11,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,910 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:11,910 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,911 INFO L82 PathProgramCache]: Analyzing trace with hash -186991699, now seen corresponding path program 3 times [2019-08-05 11:14:11,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:14:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:14:11,958 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:14:11,981 INFO L202 PluginConnector]: Adding new model EasyRecursive_incorrect2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:11 BoogieIcfgContainer [2019-08-05 11:14:11,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:11,984 INFO L168 Benchmark]: Toolchain (without parser) took 1684.90 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 110.7 MB in the beginning and 139.8 MB in the end (delta: -29.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:11,985 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:14:11,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.87 ms. Allocated memory is still 134.2 MB. Free memory was 110.7 MB in the beginning and 108.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:11,988 INFO L168 Benchmark]: Boogie Preprocessor took 21.84 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 107.7 MB in the end (delta: 872.4 kB). Peak memory consumption was 872.4 kB. Max. memory is 7.1 GB. [2019-08-05 11:14:11,989 INFO L168 Benchmark]: RCFGBuilder took 346.69 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 97.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:11,990 INFO L168 Benchmark]: TraceAbstraction took 1277.69 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 97.4 MB in the beginning and 139.8 MB in the end (delta: -42.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:14:11,994 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.87 ms. Allocated memory is still 134.2 MB. Free memory was 110.7 MB in the beginning and 108.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.84 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 107.7 MB in the end (delta: 872.4 kB). Peak memory consumption was 872.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 346.69 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 97.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1277.69 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 97.4 MB in the beginning and 139.8 MB in the end (delta: -42.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: assertion can be violated assertion can be violated We found a FailurePath: [L11] z := 4; VAL [z=4] [L13] CALL call z := add(4, 3); VAL [a=4, b=3] [L20] COND TRUE b > 0 VAL [a=4, b=3] [L22] CALL call res := add(a + 1, b - 1); VAL [a=5, b=2] [L20] COND TRUE b > 0 VAL [a=5, b=2] [L22] CALL call res := add(a + 1, b - 1); VAL [a=6, b=1] [L20] COND TRUE b > 0 VAL [a=6, b=1] [L22] CALL call res := add(a + 1, b - 1); VAL [a=7, b=0] [L20] COND FALSE !(b > 0) VAL [a=7, b=0] [L24] COND FALSE !(b < 0) [L30] res := a; VAL [a=7, b=0, res=7] [L22] RET call res := add(a + 1, b - 1); VAL [a=6, b=1, res=7] [L22] RET call res := add(a + 1, b - 1); VAL [a=5, b=2, res=7] [L22] RET call res := add(a + 1, b - 1); VAL [a=4, b=3, res=7] [L13] RET call z := add(4, 3); VAL [z=7] [L15] assert z <= 6 || z >= 8; VAL [z=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 9 SDslu, 19 SDs, 0 SdLazy, 45 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...