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 -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:49,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:49,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:49,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:49,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:49,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:49,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:49,173 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:49,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:49,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:49,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:49,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:49,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:49,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:49,180 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:49,181 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:49,182 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:49,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:49,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:49,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:49,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:49,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:49,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:49,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:49,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:49,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:49,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:49,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:49,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:49,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:49,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:49,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:49,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:49,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:49,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:49,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:49,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:49,217 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:49,217 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:49,218 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:49,218 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:49,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:49,219 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:49,219 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:49,219 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:49,220 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:49,220 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:49,220 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:49,220 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:49,220 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:49,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:49,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:49,222 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:49,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:49,222 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:49,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:49,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:49,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:49,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:49,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:49,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:49,224 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:49,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:49,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:49,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:49,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:49,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:49,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:49,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:49,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:49,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:49,226 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:49,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:49,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:49,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:49,226 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:49,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:49,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:49,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:49,293 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:49,293 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:49,294 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 [2019-03-04 16:23:49,295 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl' [2019-03-04 16:23:49,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:49,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:49,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:49,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:49,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:49,374 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,388 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:49,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:49,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:49,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:49,411 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,411 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,414 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,414 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,420 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,422 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,424 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 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:49,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:49,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:49,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:49,428 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 04.03 04:23:49" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:23:49,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:23:49,736 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:23:49,737 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-03-04 16:23:49,738 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49 BoogieIcfgContainer [2019-03-04 16:23:49,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:49,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:49,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:49,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:49,743 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 04.03 04:23:49" (1/2) ... [2019-03-04 16:23:49,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e530a4 and model type verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:49, skipping insertion in model container [2019-03-04 16:23:49,744 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 04.03 04:23:49" (2/2) ... [2019-03-04 16:23:49,746 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop.i_2.bpl [2019-03-04 16:23:49,755 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:49,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:49,789 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:49,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:49,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:49,821 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:49,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:49,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:49,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:49,822 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:49,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:49,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:23:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:49,844 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:49,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:23:49,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-03-04 16:23:49,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:49,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:50,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:23:50,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:50,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:50,178 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-03-04 16:23:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,282 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-03-04 16:23:50,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:50,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:23:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,301 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:23:50,301 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:23:50,304 INFO L631 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-03-04 16:23:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:23:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-03-04 16:23:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:23:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:23:50,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-03-04 16:23:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,339 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:23:50,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:23:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:23:50,340 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,340 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:23:50,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-03-04 16:23:50,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:50,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:50,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:23:50,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:50,932 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-03-04 16:23:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:51,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:51,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-03-04 16:23:51,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:23:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:23:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:51,030 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2019-03-04 16:23:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:51,214 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:23:51,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:51,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:23:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:51,215 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:23:51,215 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:23:51,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:23:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:23:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-03-04 16:23:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:23:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:23:51,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-03-04 16:23:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:51,221 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:23:51,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:23:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:23:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:23:51,221 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:51,222 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-03-04 16:23:51,222 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-03-04 16:23:51,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:51,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:51,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-03-04 16:23:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-03-04 16:23:51,296 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-03-04 16:23:51,330 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:23:51 BoogieIcfgContainer [2019-03-04 16:23:51,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:23:51,332 INFO L168 Benchmark]: Toolchain (without parser) took 1977.74 ms. Allocated memory was 105.4 MB in the beginning and 127.4 MB in the end (delta: 22.0 MB). Free memory was 73.6 MB in the beginning and 53.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:51,334 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 105.4 MB. Free memory is still 75.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:23:51,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.02 ms. Allocated memory is still 105.4 MB. Free memory was 73.5 MB in the beginning and 71.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:51,336 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 105.4 MB. Free memory was 71.8 MB in the beginning and 70.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:51,337 INFO L168 Benchmark]: RCFGBuilder took 311.50 ms. Allocated memory is still 105.4 MB. Free memory was 70.7 MB in the beginning and 60.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:51,338 INFO L168 Benchmark]: TraceAbstraction took 1591.78 ms. Allocated memory was 105.4 MB in the beginning and 127.4 MB in the end (delta: 22.0 MB). Free memory was 59.9 MB in the beginning and 53.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:51,346 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.23 ms. Allocated memory is still 105.4 MB. Free memory is still 75.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.02 ms. Allocated memory is still 105.4 MB. Free memory was 73.5 MB in the beginning and 71.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 105.4 MB. Free memory was 71.8 MB in the beginning and 70.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.50 ms. Allocated memory is still 105.4 MB. Free memory was 70.7 MB in the beginning and 60.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1591.78 ms. Allocated memory was 105.4 MB in the beginning and 127.4 MB in the end (delta: 22.0 MB). Free memory was 59.9 MB in the beginning and 53.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 28.5 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] [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, 7 locations, 1 error locations. UNSAFE Result, 1.5s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7 SDtfs, 2 SDslu, 12 SDs, 0 SdLazy, 20 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s 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.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 14 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...