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/linear_search.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:04,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:04,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:04,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:04,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:04,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:04,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:04,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:04,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:04,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:04,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:04,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:04,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:04,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:04,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:04,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:04,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:04,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:04,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:04,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:04,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:04,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:04,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:04,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:04,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:04,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:04,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:04,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:04,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:04,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:04,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:04,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:04,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:04,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:04,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:04,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:04,402 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:04,427 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:04,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:04,428 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:04,429 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:04,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:04,429 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:04,429 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:04,430 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:04,430 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:04,430 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:04,430 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:04,430 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:04,431 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:04,431 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:04,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:04,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:04,432 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:04,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:04,432 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:04,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:04,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:04,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:04,434 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:04,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:04,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:04,435 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:04,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:04,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:04,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:04,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:04,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:04,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:04,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:04,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:04,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:04,437 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:04,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:04,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:04,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:04,437 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:04,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:04,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:04,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:04,502 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:04,502 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:04,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl [2019-01-31 14:31:04,503 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl' [2019-01-31 14:31:04,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:04,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:04,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:04,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:04,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:04,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:04,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:04,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:04,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:04,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/1) ... [2019-01-31 14:31:04,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:04,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:04,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:04,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:04,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (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:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:31:04,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:31:05,233 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:31:05,233 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 14:31:05,234 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:05 BoogieIcfgContainer [2019-01-31 14:31:05,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:05,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:05,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:05,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:05,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:04" (1/2) ... [2019-01-31 14:31:05,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e19563 and model type linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:05, skipping insertion in model container [2019-01-31 14:31:05,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:05" (2/2) ... [2019-01-31 14:31:05,243 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.i_5.bpl [2019-01-31 14:31:05,253 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:05,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:05,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:05,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:05,316 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:05,317 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:05,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:05,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:05,317 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:05,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:05,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 14:31:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:05,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:05,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:05,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-01-31 14:31:05,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:05,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:06,439 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2019-01-31 14:31:06,704 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;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_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0; {12#(or (and (<= ULTIMATE.start_linear_search_~j~5 0) (<= (div ~SIZE 4294967296) (div ULTIMATE.start_linear_search_~j~5 4294967296)) (< 0 ~SIZE)) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)))} is VALID [2019-01-31 14:31:06,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(or (and (<= ULTIMATE.start_linear_search_~j~5 0) (<= (div ~SIZE 4294967296) (div ULTIMATE.start_linear_search_~j~5 4294967296)) (< 0 ~SIZE)) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {13#(<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))} is VALID [2019-01-31 14:31:06,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {13#(<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))} assume !linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);linear_search_#res := 0;main_#t~ret5 := linear_search_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;__VERIFIER_assert_#in~cond := main_#t~ret5;havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2019-01-31 14:31:06,726 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-01-31 14:31:06,727 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:06,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:06,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 14:31:06,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:06,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:06,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:06,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:06,801 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:06,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:06,816 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-01-31 14:31:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,019 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-31 14:31:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:07,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-31 14:31:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-31 14:31:07,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2019-01-31 14:31:07,068 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:07,078 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:07,078 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:31:07,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:31:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 14:31:07,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:07,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:07,300 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:07,300 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,302 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:07,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:07,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:07,305 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:07,305 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,307 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:07,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:07,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:07,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:07,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 14:31:07,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-01-31 14:31:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 14:31:07,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:31:07,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:07,318 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 14:31:07,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:07,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-01-31 14:31:07,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:07,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:07,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:08,231 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-01-31 14:31:08,498 INFO L273 TraceCheckUtils]: 0: Hoare triple {61#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;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_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0; {63#(or (and (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1))) (and (<= (div ~SIZE 4294967296) 0) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 2))))} is VALID [2019-01-31 14:31:08,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#(or (and (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1))) (and (<= (div ~SIZE 4294967296) 0) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 2))))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {63#(or (and (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1))) (and (<= (div ~SIZE 4294967296) 0) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 2))))} is VALID [2019-01-31 14:31:08,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(or (and (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1))) (and (<= (div ~SIZE 4294967296) 0) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 2))))} assume !!linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;linear_search_#t~post2 := linear_search_~j~5;linear_search_~j~5 := linear_search_#t~post2 + 1;havoc linear_search_#t~post2;assume !(linear_search_~j~5 % 4294967296 == 20); {63#(or (and (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1))) (and (<= (div ~SIZE 4294967296) 0) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 2))))} is VALID [2019-01-31 14:31:08,503 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(or (and (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 1))) (and (<= (div ~SIZE 4294967296) 0) (= ~SIZE (+ (* 4294967296 (div ~SIZE 4294967296)) ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ (div ULTIMATE.start_linear_search_~n 4294967296) (div ~SIZE 4294967296) 2))))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {64#(<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))} is VALID [2019-01-31 14:31:08,513 INFO L273 TraceCheckUtils]: 4: Hoare triple {64#(<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))} assume !linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);linear_search_#res := 0;main_#t~ret5 := linear_search_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;__VERIFIER_assert_#in~cond := main_#t~ret5;havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {62#false} is VALID [2019-01-31 14:31:08,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#false} assume !false; {62#false} is VALID [2019-01-31 14:31:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 14:31:08,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:08,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:08,516 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 14:31:08,518 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-01-31 14:31:08,556 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:08,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:09,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:09,112 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 340 root evaluator evaluations with a maximum evaluation depth of 9. Performed 340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:31:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:09,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:09,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,119 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:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:09,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:09,858 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-31 14:31:09,924 INFO L273 TraceCheckUtils]: 0: Hoare triple {61#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;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_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0; {68#(and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-01-31 14:31:09,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#(and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 0 ULTIMATE.start_linear_search_~j~5))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {68#(and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 0 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-01-31 14:31:09,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#(and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 0 ULTIMATE.start_linear_search_~j~5))} assume !!linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;linear_search_#t~post2 := linear_search_~j~5;linear_search_~j~5 := linear_search_#t~post2 + 1;havoc linear_search_#t~post2;assume !(linear_search_~j~5 % 4294967296 == 20); {75#(and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 1 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-01-31 14:31:09,953 INFO L273 TraceCheckUtils]: 3: Hoare triple {75#(and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) (mod ~SIZE 4294967296)) (< 2147483647 (mod ~SIZE 4294967296))) (and (= (mod ~SIZE 4294967296) ULTIMATE.start_linear_search_~n) (<= (mod ~SIZE 4294967296) 2147483647))) (= 1 ULTIMATE.start_linear_search_~j~5))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {79#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 1 ULTIMATE.start_linear_search_~j~5))} is VALID [2019-01-31 14:31:09,965 INFO L273 TraceCheckUtils]: 4: Hoare triple {79#(and (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) (mod ~SIZE 4294967296)) (= 1 ULTIMATE.start_linear_search_~j~5))} assume !linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);linear_search_#res := 0;main_#t~ret5 := linear_search_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;__VERIFIER_assert_#in~cond := main_#t~ret5;havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {62#false} is VALID [2019-01-31 14:31:09,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#false} assume !false; {62#false} is VALID [2019-01-31 14:31:09,966 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:09,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:10,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#false} assume !false; {62#false} is VALID [2019-01-31 14:31:10,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {64#(<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))} assume !linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);linear_search_#res := 0;main_#t~ret5 := linear_search_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;__VERIFIER_assert_#in~cond := main_#t~ret5;havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {62#false} is VALID [2019-01-31 14:31:10,123 INFO L273 TraceCheckUtils]: 3: Hoare triple {92#(or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE)))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {64#(<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))} is VALID [2019-01-31 14:31:10,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {96#(or (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 2) (+ (* 4294967296 (div (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)) ~SIZE)) (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)))} assume !!linear_search_#t~short1;havoc linear_search_#t~mem0;havoc linear_search_#t~short1;linear_search_#t~post2 := linear_search_~j~5;linear_search_~j~5 := linear_search_#t~post2 + 1;havoc linear_search_#t~post2;assume !(linear_search_~j~5 % 4294967296 == 20); {92#(or (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod ULTIMATE.start_linear_search_~j~5 4294967296)) (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE)))} is VALID [2019-01-31 14:31:10,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {96#(or (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 2) (+ (* 4294967296 (div (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)) ~SIZE)) (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)))} linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;assume linear_search_#t~short1;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];linear_search_#t~mem0 := read~int_#value;linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q; {96#(or (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 2) (+ (* 4294967296 (div (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)) ~SIZE)) (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)))} is VALID [2019-01-31 14:31:10,132 INFO L273 TraceCheckUtils]: 0: Hoare triple {61#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;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_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0; {96#(or (<= (+ ULTIMATE.start_linear_search_~j~5 (* 4294967296 (div ~SIZE 4294967296)) 2) (+ (* 4294967296 (div (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)) ~SIZE)) (<= (mod ULTIMATE.start_linear_search_~n 4294967296) (mod (+ ULTIMATE.start_linear_search_~j~5 1) 4294967296)))} is VALID [2019-01-31 14:31:10,133 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:10,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-01-31 14:31:10,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:10,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 14:31:10,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:10,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-31 14:31:10,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 14:31:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 14:31:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-31 14:31:10,209 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-01-31 14:31:10,744 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-31 14:31:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,002 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 14:31:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 14:31:11,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 14:31:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-31 14:31:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-31 14:31:11,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-01-31 14:31:11,049 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:11,050 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:11,050 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:11,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-31 14:31:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:11,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:11,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:11,052 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:11,052 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:11,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:11,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:11,054 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:11,054 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,054 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:11,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:11,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:11,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:11,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:11,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-31 14:31:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:11,056 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:11,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 14:31:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:11,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:11,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:11,243 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-01-31 14:31:11,362 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-31 14:31:11,376 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 11 103) no Hoare annotation was computed. [2019-01-31 14:31:11,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 11 103) no Hoare annotation was computed. [2019-01-31 14:31:11,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 11 103) no Hoare annotation was computed. [2019-01-31 14:31:11,377 INFO L444 ceAbstractionStarter]: At program point L91(lines 91 101) the Hoare annotation is: false [2019-01-31 14:31:11,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) no Hoare annotation was computed. [2019-01-31 14:31:11,377 INFO L444 ceAbstractionStarter]: At program point L75(lines 75 92) the Hoare annotation is: (let ((.cse2 (div ~SIZE 4294967296))) (let ((.cse0 (* 4294967296 .cse2))) (and (let ((.cse1 (div ULTIMATE.start_linear_search_~n 4294967296))) (or (and (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)) (< 0 (+ .cse1 .cse2 1))) (and (<= .cse2 0) (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ .cse1 .cse2 2))))) (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))))) [2019-01-31 14:31:11,377 INFO L444 ceAbstractionStarter]: At program point L100(lines 65 100) the Hoare annotation is: (let ((.cse2 (div ~SIZE 4294967296))) (let ((.cse0 (* 4294967296 .cse2)) (.cse1 (div ULTIMATE.start_linear_search_~n 4294967296))) (or (and (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)) (< 0 (+ .cse1 .cse2 1))) (and (<= .cse2 0) (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ .cse1 .cse2 2)))))) [2019-01-31 14:31:11,379 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:11,382 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:11,382 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:11,382 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:11,382 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:11,393 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:11 BoogieIcfgContainer [2019-01-31 14:31:11,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:11,395 INFO L168 Benchmark]: Toolchain (without parser) took 6841.98 ms. Allocated memory was 132.6 MB in the beginning and 254.3 MB in the end (delta: 121.6 MB). Free memory was 105.1 MB in the beginning and 230.4 MB in the end (delta: -125.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:11,396 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 132.6 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:11,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 132.6 MB. Free memory was 104.9 MB in the beginning and 103.2 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:11,397 INFO L168 Benchmark]: Boogie Preprocessor took 34.18 ms. Allocated memory is still 132.6 MB. Free memory was 103.2 MB in the beginning and 102.1 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:11,398 INFO L168 Benchmark]: RCFGBuilder took 599.59 ms. Allocated memory is still 132.6 MB. Free memory was 102.1 MB in the beginning and 87.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:11,399 INFO L168 Benchmark]: TraceAbstraction took 6157.68 ms. Allocated memory was 132.6 MB in the beginning and 254.3 MB in the end (delta: 121.6 MB). Free memory was 86.7 MB in the beginning and 230.4 MB in the end (delta: -143.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:11,403 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.17 ms. Allocated memory is still 132.6 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 132.6 MB. Free memory was 104.9 MB in the beginning and 103.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.18 ms. Allocated memory is still 132.6 MB. Free memory was 103.2 MB in the beginning and 102.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 599.59 ms. Allocated memory is still 132.6 MB. Free memory was 102.1 MB in the beginning and 87.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6157.68 ms. Allocated memory was 132.6 MB in the beginning and 254.3 MB in the end (delta: 121.6 MB). Free memory was 86.7 MB in the beginning and 230.4 MB in the end (delta: -143.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 1) || ((~SIZE / 4294967296 <= 0 && ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n + 4294967296) && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 2)) && linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 1) || ((~SIZE / 4294967296 <= 0 && ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n + 4294967296) && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 6.0s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 2 SDs, 0 SdLazy, 22 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 112 HoareAnnotationTreeSize, 3 FomulaSimplifications, 48 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 344 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 1893 SizeOfPredicates, 2 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...