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/bug-double-call.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:15:55,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:15:55,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:15:55,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:15:55,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:15:55,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:15:55,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:15:55,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:15:55,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:15:55,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:15:55,335 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:15:55,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:15:55,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:15:55,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:15:55,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:15:55,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:15:55,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:15:55,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:15:55,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:15:55,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:15:55,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:15:55,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:15:55,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:15:55,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:15:55,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:15:55,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:15:55,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:15:55,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:15:55,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:15:55,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:15:55,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:15:55,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:15:55,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:15:55,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:15:55,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:15:55,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:15:55,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:15:55,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:15:55,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:15:55,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:15:55,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:15:55,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:15:55,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:15:55,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:15:55,415 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:15:55,415 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:15:55,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/bug-double-call.bpl [2019-08-05 11:15:55,417 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/bug-double-call.bpl' [2019-08-05 11:15:55,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:15:55,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:15:55,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:55,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:15:55,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:15:55,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:55,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:15:55,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:15:55,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:15:55,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/1) ... [2019-08-05 11:15:55,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:15:55,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:15:55,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:15:55,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:15:55,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (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:15:55,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:15:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:15:55,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:15:55,861 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:15:55,861 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-08-05 11:15:55,862 INFO L202 PluginConnector]: Adding new model bug-double-call.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:55 BoogieIcfgContainer [2019-08-05 11:15:55,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:15:55,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:15:55,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:15:55,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:15:55,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:55" (1/2) ... [2019-08-05 11:15:55,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7796e03d and model type bug-double-call.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:15:55, skipping insertion in model container [2019-08-05 11:15:55,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bug-double-call.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:55" (2/2) ... [2019-08-05 11:15:55,871 INFO L109 eAbstractionObserver]: Analyzing ICFG bug-double-call.bpl [2019-08-05 11:15:55,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:15:55,889 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:15:55,908 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:15:55,935 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:15:55,936 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:15:55,936 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:15:55,937 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:15:55,937 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:15:55,937 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:15:55,937 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:15:55,937 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:15:55,938 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:15:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:15:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:15:55,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:55,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:15:55,964 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash 953243, now seen corresponding path program 1 times [2019-08-05 11:15:56,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,161 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:15:56,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:15:56,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:15:56,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:15:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:56,219 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:15:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,327 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:15:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:15:56,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:15:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,342 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:15:56,342 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:15:56,345 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:15:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:15:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:15:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:15:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:15:56,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-05 11:15:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,377 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:15:56,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:15:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:15:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:15:56,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:15:56,379 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash 895805691, now seen corresponding path program 1 times [2019-08-05 11:15:56,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:15:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:15:56,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:15:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:15:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:56,461 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:15:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,524 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:15:56,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:15:56,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:15:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,525 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:15:56,525 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:15:56,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:15:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:15:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:15:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:15:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:15:56,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:15:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,529 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:15:56,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:15:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:15:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:15:56,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,530 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:15:56,531 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1254962459, now seen corresponding path program 2 times [2019-08-05 11:15:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:15:56,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:15:56,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:56,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:56,625 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:15:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,710 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:15:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:56,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:15:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,712 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:15:56,712 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:15:56,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:15:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:15:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:15:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:15:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:15:56,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:15:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,716 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:15:56,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:15:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:15:56,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,717 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 11:15:56,717 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1368918651, now seen corresponding path program 3 times [2019-08-05 11:15:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:15:56,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:56,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:56,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:56,831 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 11:15:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,966 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:15:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:15:56,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:15:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,968 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:15:56,968 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:15:56,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:15:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:15:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:15:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:15:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:15:56,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:15:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,973 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:15:56,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:15:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:15:56,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,974 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 11:15:56,975 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1868570267, now seen corresponding path program 4 times [2019-08-05 11:15:56,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:15:57,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:15:57,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:57,205 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 11:15:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,308 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:15:57,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:15:57,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:15:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,310 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:15:57,310 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:15:57,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:15:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:15:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:15:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:15:57,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:15:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,314 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:15:57,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:15:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:15:57,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,315 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 11:15:57,315 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1756982267, now seen corresponding path program 5 times [2019-08-05 11:15:57,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:57,373 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:15:57,392 INFO L202 PluginConnector]: Adding new model bug-double-call.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:57 BoogieIcfgContainer [2019-08-05 11:15:57,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:57,395 INFO L168 Benchmark]: Toolchain (without parser) took 1945.20 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 111.2 MB in the beginning and 130.9 MB in the end (delta: -19.7 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:57,396 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.2 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:15:57,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.88 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 109.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:57,398 INFO L168 Benchmark]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 133.7 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:57,399 INFO L168 Benchmark]: RCFGBuilder took 343.26 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 97.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:57,401 INFO L168 Benchmark]: TraceAbstraction took 1528.65 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 97.3 MB in the beginning and 130.9 MB in the end (delta: -33.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:57,405 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 133.7 MB. Free memory was 112.5 MB in the beginning and 112.2 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 41.88 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 109.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 133.7 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 343.26 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 97.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1528.65 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 97.3 MB in the beginning and 130.9 MB in the end (delta: -33.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: assertion can be violated assertion can be violated We found a FailurePath: [L14] local := e; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND TRUE local >= 5 [L14] local := e; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND FALSE !(local >= 5) [L20] local := local + 1; [L17] COND TRUE local >= 5 [L28] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 51 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 535 SizeOfPredicates, 5 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 20/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...