java -ea -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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:13,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:13,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:13,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:13,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:13,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:13,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:13,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:13,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:13,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:13,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:13,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:13,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:13,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:13,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:13,864 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:13,865 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:13,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:13,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:13,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:13,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:13,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:13,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:13,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:13,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:13,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:13,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:13,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:13,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:13,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:13,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:13,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:13,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:13,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:13,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:13,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:13,886 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:31:13,911 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:13,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:13,913 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:13,913 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:13,913 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:13,913 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:13,914 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:13,914 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:13,914 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:13,914 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:13,914 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:13,915 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:13,915 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:13,915 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:13,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:13,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:13,917 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:13,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:13,917 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:13,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:13,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:13,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:13,919 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:13,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:13,919 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:13,920 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:13,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:13,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:13,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:13,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:13,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:13,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:13,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:13,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:13,922 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:13,922 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:13,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:13,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:13,922 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:13,923 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:13,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:13,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:13,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:13,980 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:13,981 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:13,981 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-01-31 14:31:13,982 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl' [2019-01-31 14:31:14,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:14,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:14,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:14,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:14,034 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:14,051 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,062 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:14,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:14,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:14,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:14,083 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,083 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,085 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,085 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,089 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,091 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,092 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 31.01 02:31:14" (1/1) ... [2019-01-31 14:31:14,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:14,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:14,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:14,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:14,096 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 31.01 02:31: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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:31:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:31:14,592 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:31:14,592 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 14:31:14,593 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:14 BoogieIcfgContainer [2019-01-31 14:31:14,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:14,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:14,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:14,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:14,601 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 31.01 02:31:14" (1/2) ... [2019-01-31 14:31:14,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214a4f9 and model type verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:14, skipping insertion in model container [2019-01-31 14:31:14,603 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 31.01 02:31:14" (2/2) ... [2019-01-31 14:31:14,606 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop.i_2.bpl [2019-01-31 14:31:14,616 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:14,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:14,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:14,682 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:14,683 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:14,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:14,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:14,683 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:14,684 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:14,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:14,684 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 14:31:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:14,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:14,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:14,715 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-01-31 14:31:14,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:14,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:14,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:15,030 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp.base, ~tmp.offset := 0, 0;havoc main_#res;havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 32 - 4;~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;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;havoc glob2_#res;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;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {12#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:15,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13#(= ULTIMATE.start___VERIFIER_assert_~cond 1)} is VALID [2019-01-31 14:31:15,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {13#(= ULTIMATE.start___VERIFIER_assert_~cond 1)} assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2019-01-31 14:31:15,059 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-01-31 14:31:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:15,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:15,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 14:31:15,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:15,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:15,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:15,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:15,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:15,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:15,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:15,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:15,105 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-01-31 14:31:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:15,474 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-31 14:31:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:31:15,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-31 14:31:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-31 14:31:15,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2019-01-31 14:31:15,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:15,538 INFO L225 Difference]: With dead ends: 12 [2019-01-31 14:31:15,539 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 14:31:15,541 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-01-31 14:31:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 14:31:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-31 14:31:15,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:15,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 7 states. [2019-01-31 14:31:15,595 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 7 states. [2019-01-31 14:31:15,595 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 7 states. [2019-01-31 14:31:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:15,598 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:15,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:15,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:15,599 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states. [2019-01-31 14:31:15,599 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states. [2019-01-31 14:31:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:15,601 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:15,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:15,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:15,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:15,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 14:31:15,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-01-31 14:31:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:15,606 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 14:31:15,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:31:15,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:15,607 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 14:31:15,607 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-01-31 14:31:15,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:15,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:15,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:15,918 INFO L273 TraceCheckUtils]: 0: Hoare triple {65#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp.base, ~tmp.offset := 0, 0;havoc main_#res;havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 32 - 4;~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;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;havoc glob2_#res;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;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {67#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:15,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {67#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {68#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:15,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !(__VERIFIER_assert_~cond == 0);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:15,924 INFO L273 TraceCheckUtils]: 3: Hoare triple {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {70#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2019-01-31 14:31:15,932 INFO L273 TraceCheckUtils]: 4: Hoare triple {70#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume __VERIFIER_assert_~cond == 0;assume !false; {66#false} is VALID [2019-01-31 14:31:15,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {66#false} assume !false; {66#false} is VALID [2019-01-31 14:31:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:15,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:15,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:15,935 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 14:31:15,937 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-01-31 14:31:15,975 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:15,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:16,447 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:16,449 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 268 root evaluator evaluations with a maximum evaluation depth of 5. Performed 268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:31:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:16,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:16,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:16,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-01-31 14:31:16,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:16,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:16,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:16,907 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2019-01-31 14:31:17,294 INFO L273 TraceCheckUtils]: 0: Hoare triple {65#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp.base, ~tmp.offset := 0, 0;havoc main_#res;havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 32 - 4;~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;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;havoc glob2_#res;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;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {67#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:17,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {67#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {77#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:17,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {77#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !(__VERIFIER_assert_~cond == 0);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:17,297 INFO L273 TraceCheckUtils]: 3: Hoare triple {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {84#(= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2019-01-31 14:31:17,298 INFO L273 TraceCheckUtils]: 4: Hoare triple {84#(= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume __VERIFIER_assert_~cond == 0;assume !false; {66#false} is VALID [2019-01-31 14:31:17,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {66#false} assume !false; {66#false} is VALID [2019-01-31 14:31:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:17,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:17,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {66#false} assume !false; {66#false} is VALID [2019-01-31 14:31:17,478 INFO L273 TraceCheckUtils]: 4: Hoare triple {70#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume __VERIFIER_assert_~cond == 0;assume !false; {66#false} is VALID [2019-01-31 14:31:17,480 INFO L273 TraceCheckUtils]: 3: Hoare triple {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {70#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2019-01-31 14:31:17,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {100#(or (and (< (+ ULTIMATE.start_glob2_~p~4.offset 3) ~tmp.offset) (= ULTIMATE.start_glob2_~p~4.base ~tmp.base)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(__VERIFIER_assert_~cond == 0);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-01-31 14:31:17,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {104#(or (< (+ ULTIMATE.start_glob2_~p~4.offset 3) ~tmp.offset) (not (= ULTIMATE.start_glob2_~p~4.base ~tmp.base)) (< ~tmp.offset ULTIMATE.start_glob2_~p~4.offset))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {100#(or (and (< (+ ULTIMATE.start_glob2_~p~4.offset 3) ~tmp.offset) (= ULTIMATE.start_glob2_~p~4.base ~tmp.base)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2019-01-31 14:31:17,492 INFO L273 TraceCheckUtils]: 0: Hoare triple {65#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp.base, ~tmp.offset := 0, 0;havoc main_#res;havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 32 - 4;~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;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;havoc glob2_#res;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;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {104#(or (< (+ ULTIMATE.start_glob2_~p~4.offset 3) ~tmp.offset) (not (= ULTIMATE.start_glob2_~p~4.base ~tmp.base)) (< ~tmp.offset ULTIMATE.start_glob2_~p~4.offset))} is VALID [2019-01-31 14:31:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:17,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:17,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 14:31:17,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:17,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 14:31:17,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:17,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 14:31:17,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 14:31:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 14:31:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 14:31:17,541 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2019-01-31 14:31:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:17,676 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 14:31:17,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 14:31:17,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 14:31:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-31 14:31:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-31 14:31:17,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 12 transitions. [2019-01-31 14:31:17,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:17,701 INFO L225 Difference]: With dead ends: 12 [2019-01-31 14:31:17,701 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 14:31:17,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-31 14:31:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 14:31:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-31 14:31:17,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:17,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2019-01-31 14:31:17,728 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2019-01-31 14:31:17,728 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2019-01-31 14:31:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:17,730 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 14:31:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 14:31:17,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:17,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:17,731 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2019-01-31 14:31:17,731 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2019-01-31 14:31:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:17,732 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 14:31:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 14:31:17,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:17,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:17,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:17,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 14:31:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-31 14:31:17,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-01-31 14:31:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:17,735 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-31 14:31:17,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 14:31:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 14:31:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 14:31:17,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:17,736 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-01-31 14:31:17,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-01-31 14:31:17,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:17,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:17,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-31 14:31:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-31 14:31:17,806 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-31 14:31:17,838 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:17,838 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2019-01-31 14:31:17,839 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2019-01-31 14:31:17,839 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2019-01-31 14:31:17,839 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2019-01-31 14:31:17,839 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2019-01-31 14:31:17,839 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:17,839 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:17,841 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:17 BoogieIcfgContainer [2019-01-31 14:31:17,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:17,843 INFO L168 Benchmark]: Toolchain (without parser) took 3810.69 ms. Allocated memory was 136.8 MB in the beginning and 215.0 MB in the end (delta: 78.1 MB). Free memory was 105.3 MB in the beginning and 134.8 MB in the end (delta: -29.5 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:17,844 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:17,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.25 ms. Allocated memory is still 136.8 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:17,846 INFO L168 Benchmark]: Boogie Preprocessor took 22.86 ms. Allocated memory is still 136.8 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:17,847 INFO L168 Benchmark]: RCFGBuilder took 498.98 ms. Allocated memory is still 136.8 MB. Free memory was 102.3 MB in the beginning and 88.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:17,848 INFO L168 Benchmark]: TraceAbstraction took 3246.85 ms. Allocated memory was 136.8 MB in the beginning and 215.0 MB in the end (delta: 78.1 MB). Free memory was 88.5 MB in the beginning and 134.8 MB in the end (delta: -46.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:17,852 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.25 ms. Allocated memory is still 136.8 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.86 ms. Allocated memory is still 136.8 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.98 ms. Allocated memory is still 136.8 MB. Free memory was 102.3 MB in the beginning and 88.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3246.85 ms. Allocated memory was 136.8 MB in the beginning and 215.0 MB in the end (delta: 78.1 MB). Free memory was 88.5 MB in the beginning and 134.8 MB in the end (delta: -46.3 MB). Peak memory consumption was 31.8 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, 3.1s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.6s 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, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s 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.5s AbstIntTime, 1 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, 1.5s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 14 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...