java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:29:35,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:29:35,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:29:35,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:29:35,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:29:35,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:29:35,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:29:35,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:29:35,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:29:35,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:29:35,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:29:35,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:29:35,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:29:35,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:29:36,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:29:36,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:29:36,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:29:36,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:29:36,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:29:36,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:29:36,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:29:36,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:29:36,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:29:36,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:29:36,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:29:36,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:29:36,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:29:36,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:29:36,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:29:36,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:29:36,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:29:36,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:29:36,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:29:36,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:29:36,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:29:36,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:29:36,040 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:29:36,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:29:36,055 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:29:36,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:29:36,057 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:29:36,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:29:36,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:29:36,057 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:29:36,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:29:36,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:29:36,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:29:36,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:29:36,124 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:29:36,124 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:29:36,125 INFO L418 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 [2018-07-25 13:29:36,125 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl' [2018-07-25 13:29:36,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:29:36,186 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:29:36,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:36,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:29:36,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:29:36,206 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,222 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:36,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:29:36,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:29:36,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:29:36,242 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,242 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,244 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,244 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,248 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,250 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,251 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:29:36,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:29:36,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:29:36,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:29:36,255 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 25.07 01:29:36" (1/1) ... [2018-07-25 13:29:36,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:29:36,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:29:36,525 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:29:36,527 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:36 BoogieIcfgContainer [2018-07-25 13:29:36,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:29:36,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:29:36,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:29:36,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:29:36,535 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 25.07 01:29:36" (1/2) ... [2018-07-25 13:29:36,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320855d1 and model type verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:29:36, skipping insertion in model container [2018-07-25 13:29:36,537 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 25.07 01:29:36" (2/2) ... [2018-07-25 13:29:36,540 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop.i_2.bpl [2018-07-25 13:29:36,550 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:29:36,562 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:29:36,606 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:29:36,606 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:29:36,606 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:29:36,607 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:29:36,607 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:29:36,607 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:29:36,607 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:29:36,607 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:29:36,608 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:29:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:29:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:29:36,628 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:36,629 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:29:36,630 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-07-25 13:29:36,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:36,791 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:36,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:36,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:36,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:36,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:36,835 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-25 13:29:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:36,904 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-25 13:29:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:36,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:29:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:36,919 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:29:36,920 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:29:36,924 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:29:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-25 13:29:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:29:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:29:36,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:29:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:36,972 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:29:36,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:29:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:29:36,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:36,973 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:29:36,973 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-07-25 13:29:36,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:37,071 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:37,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:37,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:37,072 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:29:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,159 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:29:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:37,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:29:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,160 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:29:37,160 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:29:37,162 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:29:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:29:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:29:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:29:37,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:29:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,166 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:29:37,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:29:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:29:37,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,168 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:29:37,168 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-07-25 13:29:37,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:29:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:29:37,237 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 13:29:37,270 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:37 BoogieIcfgContainer [2018-07-25 13:29:37,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:37,272 INFO L168 Benchmark]: Toolchain (without parser) took 1086.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:37,275 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:37,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:37,276 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:37,277 INFO L168 Benchmark]: RCFGBuilder took 273.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:37,278 INFO L168 Benchmark]: TraceAbstraction took 742.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:37,283 INFO L336 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 273.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 742.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. 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] [L59] assume true; [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] [L59] assume true; [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] [L59] assume true; [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, 7 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7 SDtfs, 2 SDslu, 10 SDs, 0 SdLazy, 17 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/verisec_NetBSD-libc__loop.i_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-37-297.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/verisec_NetBSD-libc__loop.i_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-37-297.csv Received shutdown request...