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/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:23:14,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:23:14,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:23:14,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:23:14,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:23:14,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:23:14,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:23:14,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:23:14,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:23:14,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:23:14,450 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:23:14,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:23:14,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:23:14,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:23:14,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:23:14,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:23:14,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:23:14,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:23:14,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:23:14,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:23:14,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:23:14,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:23:14,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:23:14,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:23:14,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:23:14,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:23:14,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:23:14,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:23:14,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:23:14,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:23:14,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:23:14,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:23:14,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:23:14,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:23:14,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:23:14,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:23:14,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:23:14,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:23:14,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:23:14,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:23:14,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:23:14,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:23:14,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:23:14,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:23:14,554 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:23:14,555 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:23:14,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl [2019-08-05 10:23:14,556 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl' [2019-08-05 10:23:14,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:23:14,612 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:23:14,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:23:14,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:23:14,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:23:14,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:23:14,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:23:14,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:23:14,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:23:14,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... [2019-08-05 10:23:14,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:23:14,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:23:14,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:23:14,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:23:14,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:23:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:23:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:23:15,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:23:15,094 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:23:15,095 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:23:15 BoogieIcfgContainer [2019-08-05 10:23:15,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:23:15,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:23:15,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:23:15,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:23:15,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:23:14" (1/2) ... [2019-08-05 10:23:15,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6717ed and model type verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:23:15, skipping insertion in model container [2019-08-05 10:23:15,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:23:15" (2/2) ... [2019-08-05 10:23:15,109 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop.i_2.bpl [2019-08-05 10:23:15,118 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:23:15,128 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:23:15,145 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:23:15,173 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:23:15,174 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:23:15,174 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:23:15,174 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:23:15,174 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:23:15,174 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:23:15,175 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:23:15,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:23:15,175 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:23:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:23:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:23:15,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:15,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:23:15,198 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-08-05 10:23:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:15,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:23:15,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:15,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:15,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:23:15,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:23:15,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:23:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:23:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:23:15,547 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:23:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:15,661 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:23:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:23:15,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:23:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:15,674 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:23:15,674 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:23:15,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:23:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:23:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:23:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:23:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:23:15,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:23:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:15,713 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:23:15,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:23:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:23:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:23:15,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:15,715 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:23:15,715 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-08-05 10:23:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:15,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:23:15,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:15,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:15,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:15,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:23:15,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:23:15,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:23:15,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:23:15,875 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:23:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:16,019 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:23:16,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:23:16,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:23:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:16,025 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:23:16,025 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:23:16,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:23:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:23:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:23:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:23:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:23:16,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:23:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:16,030 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:23:16,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:23:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:23:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:23:16,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:16,042 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:23:16,042 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-08-05 10:23:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:23:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:23:16,146 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:23:16,176 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:23:16 BoogieIcfgContainer [2019-08-05 10:23:16,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:23:16,180 INFO L168 Benchmark]: Toolchain (without parser) took 1566.35 ms. Allocated memory was 135.8 MB in the beginning and 168.8 MB in the end (delta: 33.0 MB). Free memory was 113.0 MB in the beginning and 139.4 MB in the end (delta: -26.4 MB). Peak memory consumption was 6.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:16,182 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 114.5 MB in the beginning and 114.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:23:16,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.60 ms. Allocated memory is still 135.8 MB. Free memory was 112.8 MB in the beginning and 111.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:16,184 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 135.8 MB. Free memory was 111.2 MB in the beginning and 110.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:16,186 INFO L168 Benchmark]: RCFGBuilder took 423.01 ms. Allocated memory is still 135.8 MB. Free memory was 109.9 MB in the beginning and 98.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:16,187 INFO L168 Benchmark]: TraceAbstraction took 1080.43 ms. Allocated memory was 135.8 MB in the beginning and 168.8 MB in the end (delta: 33.0 MB). Free memory was 98.1 MB in the beginning and 139.4 MB in the end (delta: -41.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:23:16,193 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.20 ms. Allocated memory is still 135.8 MB. Free memory was 114.5 MB in the beginning and 114.3 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 36.60 ms. Allocated memory is still 135.8 MB. Free memory was 112.8 MB in the beginning and 111.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.50 ms. Allocated memory is still 135.8 MB. Free memory was 111.2 MB in the beginning and 110.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 423.01 ms. Allocated memory is still 135.8 MB. Free memory was 109.9 MB in the beginning and 98.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1080.43 ms. Allocated memory was 135.8 MB in the beginning and 168.8 MB in the end (delta: 33.0 MB). Free memory was 98.1 MB in the beginning and 139.4 MB in the end (delta: -41.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 82]: assertion can be violated assertion can be violated We found a FailurePath: [L33] #NULL.base, #NULL.offset := 0, 0; [L34] #valid := #valid[0 := 0]; [L35] ~tmp.base, ~tmp.offset := 0, 0; [L36] havoc main_#res; [L37] havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset; [L38] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L39] #Ultimate.alloc_~size := 8; [L40] havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L41] havoc #valid, #length; [L42] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0; [L43] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L44] assume #Ultimate.alloc_#res.offset == 0; [L45] assume #Ultimate.alloc_#res.base != 0; [L46] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L47] main_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L48] main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 32 - 4; [L49] ~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4; [L50] glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset; [L51] havoc glob2_#res; [L52] havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~4.base, glob2_~p~4.offset; [L53] glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset; [L54] glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset; [L55] havoc glob2_~p~4.base, glob2_~p~4.offset; [L56] glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=0, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, ~tmp.base=29, ~tmp.offset=4] [L60] assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset); [L61] __VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0); [L62] havoc __VERIFIER_assert_~cond; [L63] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=0, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, ~tmp.base=29, ~tmp.offset=4] [L68] assume !(__VERIFIER_assert_~cond == 0); [L69] write~int_old_#memory_int := #memory_int; [L70] write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4; [L71] havoc #memory_int; [L72] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value]; [L73] glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset; [L74] glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4; [L75] havoc glob2_#t~post0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=4, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L60] assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset); [L61] __VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0); [L62] havoc __VERIFIER_assert_~cond; [L63] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=4, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L68] assume !(__VERIFIER_assert_~cond == 0); [L69] write~int_old_#memory_int := #memory_int; [L70] write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4; [L71] havoc #memory_int; [L72] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value]; [L73] glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset; [L74] glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4; [L75] havoc glob2_#t~post0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L60] assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset); [L61] __VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0); [L62] havoc __VERIFIER_assert_~cond; [L63] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L78] assume __VERIFIER_assert_~cond == 0; [L79] assume !false; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L82] assert false; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7 SDtfs, 2 SDslu, 8 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 24 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...