java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:25:12,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:25:12,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:25:12,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:25:12,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:25:12,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:25:12,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:25:12,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:25:12,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:25:12,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:25:12,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:25:12,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:25:12,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:25:12,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:25:12,071 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:25:12,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:25:12,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:25:12,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:25:12,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:25:12,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:25:12,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:25:12,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:25:12,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:25:12,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:25:12,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:25:12,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:25:12,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:25:12,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:25:12,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:25:12,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:25:12,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:25:12,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:25:12,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:25:12,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:25:12,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:25:12,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:25:12,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:25:12,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:25:12,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:25:12,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:25:12,115 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:25:12,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:25:12,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:25:12,117 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:25:12,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:25:12,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:25:12,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:25:12,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:25:12,119 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:25:12,119 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:25:12,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:25:12,120 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:25:12,120 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:25:12,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:25:12,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:25:12,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:25:12,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:25:12,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:25:12,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:25:12,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:25:12,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:25:12,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:12,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:25:12,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:25:12,122 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:25:12,122 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:25:12,125 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:25:12,125 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:25:12,125 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:25:12,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:25:12,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:25:12,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:25:12,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:25:12,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:25:12,196 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:25:12,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-23 11:25:12,279 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bd93546/88ddfd7e75b542d6a199282e07a3de0a/FLAG310e2c265 [2018-11-23 11:25:12,773 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:25:12,773 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-23 11:25:12,779 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bd93546/88ddfd7e75b542d6a199282e07a3de0a/FLAG310e2c265 [2018-11-23 11:25:13,104 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bd93546/88ddfd7e75b542d6a199282e07a3de0a [2018-11-23 11:25:13,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:25:13,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:25:13,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:13,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:25:13,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:25:13,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714e11b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13, skipping insertion in model container [2018-11-23 11:25:13,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:25:13,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:25:13,419 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:13,433 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:25:13,463 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:13,487 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:25:13,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13 WrapperNode [2018-11-23 11:25:13,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:13,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:13,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:25:13,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:25:13,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:13,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:25:13,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:25:13,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:25:13,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... [2018-11-23 11:25:13,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:25:13,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:25:13,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:25:13,549 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:25:13,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-23 11:25:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-23 11:25:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:25:13,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:25:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:25:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:25:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:25:13,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:25:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:25:13,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:25:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:25:13,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:25:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:25:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:25:14,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:25:14,182 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:25:14,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:14 BoogieIcfgContainer [2018-11-23 11:25:14,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:25:14,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:25:14,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:25:14,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:25:14,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:13" (1/3) ... [2018-11-23 11:25:14,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18898d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:14, skipping insertion in model container [2018-11-23 11:25:14,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:13" (2/3) ... [2018-11-23 11:25:14,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18898d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:14, skipping insertion in model container [2018-11-23 11:25:14,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:14" (3/3) ... [2018-11-23 11:25:14,192 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-11-23 11:25:14,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:25:14,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:25:14,227 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:25:14,257 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:25:14,258 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:25:14,258 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:25:14,258 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:25:14,258 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:25:14,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:25:14,259 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:25:14,259 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:25:14,259 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:25:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 11:25:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:25:14,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:14,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:14,288 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:14,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash -103858931, now seen corresponding path program 1 times [2018-11-23 11:25:14,300 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:14,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:14,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:14,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 11:25:14,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {29#true} is VALID [2018-11-23 11:25:14,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 11:25:14,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2018-11-23 11:25:14,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2018-11-23 11:25:14,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {29#true} is VALID [2018-11-23 11:25:14,553 INFO L256 TraceCheckUtils]: 6: Hoare triple {29#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {29#true} is VALID [2018-11-23 11:25:14,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {29#true} is VALID [2018-11-23 11:25:14,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 11:25:14,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume ~bvult32(~j~0, ~SIZE~0);#res := 1bv32; {30#false} is VALID [2018-11-23 11:25:14,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume true; {30#false} is VALID [2018-11-23 11:25:14,555 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {30#false} {29#true} #51#return; {30#false} is VALID [2018-11-23 11:25:14,555 INFO L256 TraceCheckUtils]: 12: Hoare triple {30#false} call __VERIFIER_assert(#t~ret4); {30#false} is VALID [2018-11-23 11:25:14,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 11:25:14,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 11:25:14,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 11:25:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:14,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:14,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:14,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:25:14,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:25:14,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:14,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:25:14,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:14,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:25:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:25:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:14,759 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 11:25:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,969 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 11:25:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:25:14,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:25:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 11:25:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 11:25:14,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 11:25:15,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:15,185 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:25:15,185 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:25:15,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:25:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:25:15,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:15,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:15,263 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:15,263 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:15,267 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:25:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:25:15,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:15,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:15,269 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:15,269 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:15,273 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:25:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:25:15,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:15,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:15,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:15,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:25:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 11:25:15,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-11-23 11:25:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:15,279 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 11:25:15,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:25:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:25:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:25:15,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:15,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:15,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:15,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash 62585844, now seen corresponding path program 1 times [2018-11-23 11:25:15,286 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:15,286 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:15,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:15,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2018-11-23 11:25:15,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {196#true} is VALID [2018-11-23 11:25:15,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2018-11-23 11:25:15,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #47#return; {196#true} is VALID [2018-11-23 11:25:15,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2018-11-23 11:25:15,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {196#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {196#true} is VALID [2018-11-23 11:25:15,514 INFO L256 TraceCheckUtils]: 6: Hoare triple {196#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {196#true} is VALID [2018-11-23 11:25:15,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {196#true} is VALID [2018-11-23 11:25:15,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {196#true} #t~short1 := ~bvult32(~j~0, ~n); {196#true} is VALID [2018-11-23 11:25:15,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#true} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {196#true} is VALID [2018-11-23 11:25:15,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#true} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {196#true} is VALID [2018-11-23 11:25:15,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {196#true} assume ~bvult32(~j~0, ~SIZE~0);#res := 1bv32; {234#(= (bvadd |linear_search_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:15,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {234#(= (bvadd |linear_search_#res| (_ bv4294967295 32)) (_ bv0 32))} assume true; {234#(= (bvadd |linear_search_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:15,552 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {234#(= (bvadd |linear_search_#res| (_ bv4294967295 32)) (_ bv0 32))} {196#true} #51#return; {241#(= (bvadd |main_#t~ret4| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:15,555 INFO L256 TraceCheckUtils]: 14: Hoare triple {241#(= (bvadd |main_#t~ret4| (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert(#t~ret4); {245#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:15,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {245#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {249#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:15,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {249#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {197#false} is VALID [2018-11-23 11:25:15,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2018-11-23 11:25:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:15,561 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:15,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:15,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:25:15,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:25:15,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:15,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:25:15,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:15,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:25:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:25:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:15,618 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2018-11-23 11:25:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,302 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:25:16,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:25:16,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:25:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 11:25:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 11:25:16,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2018-11-23 11:25:16,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:16,403 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:25:16,403 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:25:16,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:25:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:25:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:25:16,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:16,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:16,416 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:16,416 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,418 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:25:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:25:16,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:16,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:16,421 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:16,421 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:25:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,423 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:25:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:25:16,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:16,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:16,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:16,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:25:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:25:16,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-11-23 11:25:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:16,426 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:25:16,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:25:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:25:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:25:16,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:16,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:16,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:16,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 950089525, now seen corresponding path program 1 times [2018-11-23 11:25:16,429 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:16,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:16,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:16,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2018-11-23 11:25:16,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {360#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {360#true} is VALID [2018-11-23 11:25:16,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2018-11-23 11:25:16,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #47#return; {360#true} is VALID [2018-11-23 11:25:16,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret5 := main(); {360#true} is VALID [2018-11-23 11:25:16,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {360#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {360#true} is VALID [2018-11-23 11:25:16,762 INFO L256 TraceCheckUtils]: 6: Hoare triple {360#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {360#true} is VALID [2018-11-23 11:25:16,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {386#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:16,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {390#(and (or (and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (not |linear_search_#t~short1|)) (and (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|)) (= linear_search_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:16,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {390#(and (or (and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (not |linear_search_#t~short1|)) (and (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|)) (= linear_search_~j~0 (_ bv0 32)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {394#(and (= linear_search_~j~0 (_ bv0 32)) (bvult linear_search_~j~0 |linear_search_#in~n|))} is VALID [2018-11-23 11:25:16,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {394#(and (= linear_search_~j~0 (_ bv0 32)) (bvult linear_search_~j~0 |linear_search_#in~n|))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {394#(and (= linear_search_~j~0 (_ bv0 32)) (bvult linear_search_~j~0 |linear_search_#in~n|))} is VALID [2018-11-23 11:25:16,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {394#(and (= linear_search_~j~0 (_ bv0 32)) (bvult linear_search_~j~0 |linear_search_#in~n|))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {401#(and (bvult (_ bv0 32) |linear_search_#in~n|) (not (bvult (_ bv0 32) ~SIZE~0)))} is VALID [2018-11-23 11:25:16,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {401#(and (bvult (_ bv0 32) |linear_search_#in~n|) (not (bvult (_ bv0 32) ~SIZE~0)))} assume true; {401#(and (bvult (_ bv0 32) |linear_search_#in~n|) (not (bvult (_ bv0 32) ~SIZE~0)))} is VALID [2018-11-23 11:25:16,776 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {401#(and (bvult (_ bv0 32) |linear_search_#in~n|) (not (bvult (_ bv0 32) ~SIZE~0)))} {360#true} #51#return; {361#false} is VALID [2018-11-23 11:25:16,776 INFO L256 TraceCheckUtils]: 14: Hoare triple {361#false} call __VERIFIER_assert(#t~ret4); {361#false} is VALID [2018-11-23 11:25:16,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2018-11-23 11:25:16,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {361#false} assume 0bv32 == ~cond; {361#false} is VALID [2018-11-23 11:25:16,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {361#false} assume !false; {361#false} is VALID [2018-11-23 11:25:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:16,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:16,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:16,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:25:16,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:25:16,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:16,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:25:16,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:16,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:25:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:25:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:16,889 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 11:25:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:17,575 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:25:17,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:25:17,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:25:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:25:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:25:17,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 11:25:17,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:17,646 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:25:17,646 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:25:17,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:25:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:25:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-23 11:25:17,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:17,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 22 states. [2018-11-23 11:25:17,659 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 22 states. [2018-11-23 11:25:17,659 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 22 states. [2018-11-23 11:25:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:17,663 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 11:25:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 11:25:17,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:17,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:17,664 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 26 states. [2018-11-23 11:25:17,664 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 26 states. [2018-11-23 11:25:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:17,667 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 11:25:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 11:25:17,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:17,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:17,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:17,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:25:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 11:25:17,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2018-11-23 11:25:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:17,670 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 11:25:17,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:25:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:25:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:25:17,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:17,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:17,672 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:17,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1630147895, now seen corresponding path program 1 times [2018-11-23 11:25:17,673 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:17,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:17,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:18,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 11:25:18,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {555#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {555#true} is VALID [2018-11-23 11:25:18,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 11:25:18,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} #47#return; {555#true} is VALID [2018-11-23 11:25:18,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {555#true} call #t~ret5 := main(); {555#true} is VALID [2018-11-23 11:25:18,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {575#(exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32))))} is VALID [2018-11-23 11:25:18,356 INFO L256 TraceCheckUtils]: 6: Hoare triple {575#(exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {575#(exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32))))} is VALID [2018-11-23 11:25:18,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {575#(exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {582#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:18,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {582#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {586#(or (and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (bvult (_ bv0 32) |linear_search_#in~n|) |linear_search_#t~short1|) (and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not |linear_search_#t~short1|) (not (bvult (_ bv0 32) |linear_search_#in~n|))))} is VALID [2018-11-23 11:25:18,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#(or (and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (bvult (_ bv0 32) |linear_search_#in~n|) |linear_search_#t~short1|) (and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not |linear_search_#t~short1|) (not (bvult (_ bv0 32) |linear_search_#in~n|))))} assume !#t~short1; {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:18,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:18,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:18,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} assume true; {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:18,368 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {590#(and (exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32)))) (not (bvult (_ bv0 32) |linear_search_#in~n|)))} {575#(exists ((|v_main_#t~nondet3_3| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_3| (_ bv8 32))))} #51#return; {556#false} is VALID [2018-11-23 11:25:18,368 INFO L256 TraceCheckUtils]: 14: Hoare triple {556#false} call __VERIFIER_assert(#t~ret4); {556#false} is VALID [2018-11-23 11:25:18,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2018-11-23 11:25:18,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {556#false} assume 0bv32 == ~cond; {556#false} is VALID [2018-11-23 11:25:18,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 11:25:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:18,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:18,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:18,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:25:18,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:25:18,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:18,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:25:18,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:18,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:25:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:25:18,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:18,404 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-23 11:25:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:19,034 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:25:19,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:25:19,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:25:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 11:25:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:25:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 11:25:19,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2018-11-23 11:25:19,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:19,116 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:25:19,116 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:25:19,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:25:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:25:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:25:19,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:19,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:19,152 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:19,152 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:19,154 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:25:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:25:19,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:19,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:19,155 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:19,155 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:25:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:19,157 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:25:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:25:19,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:19,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:19,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:19,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:25:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 11:25:19,160 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-11-23 11:25:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:19,160 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 11:25:19,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:25:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:25:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:25:19,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:19,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:19,162 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:19,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1249399128, now seen corresponding path program 1 times [2018-11-23 11:25:19,163 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:19,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:19,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:19,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {744#true} call ULTIMATE.init(); {744#true} is VALID [2018-11-23 11:25:19,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {744#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {744#true} is VALID [2018-11-23 11:25:19,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {744#true} assume true; {744#true} is VALID [2018-11-23 11:25:19,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {744#true} {744#true} #47#return; {744#true} is VALID [2018-11-23 11:25:19,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {744#true} call #t~ret5 := main(); {744#true} is VALID [2018-11-23 11:25:19,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {744#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {744#true} is VALID [2018-11-23 11:25:19,391 INFO L256 TraceCheckUtils]: 6: Hoare triple {744#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {744#true} is VALID [2018-11-23 11:25:19,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {744#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {770#(= linear_search_~n |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {770#(= linear_search_~n |linear_search_#in~n|)} #t~short1 := ~bvult32(~j~0, ~n); {770#(= linear_search_~n |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#(= linear_search_~n |linear_search_#in~n|)} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {770#(= linear_search_~n |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {770#(= linear_search_~n |linear_search_#in~n|)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {770#(= linear_search_~n |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {770#(= linear_search_~n |linear_search_#in~n|)} #t~short1 := ~bvult32(~j~0, ~n); {783#(or (and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (not |linear_search_#t~short1|)) (and (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|))} is VALID [2018-11-23 11:25:19,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {783#(or (and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (not |linear_search_#t~short1|)) (and (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {794#(exists ((linear_search_~j~0 (_ BitVec 32))) (and (not (bvult linear_search_~j~0 ~SIZE~0)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:19,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {794#(exists ((linear_search_~j~0 (_ BitVec 32))) (and (not (bvult linear_search_~j~0 ~SIZE~0)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} assume true; {794#(exists ((linear_search_~j~0 (_ BitVec 32))) (and (not (bvult linear_search_~j~0 ~SIZE~0)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:19,413 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {794#(exists ((linear_search_~j~0 (_ BitVec 32))) (and (not (bvult linear_search_~j~0 ~SIZE~0)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} {744#true} #51#return; {745#false} is VALID [2018-11-23 11:25:19,413 INFO L256 TraceCheckUtils]: 17: Hoare triple {745#false} call __VERIFIER_assert(#t~ret4); {745#false} is VALID [2018-11-23 11:25:19,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {745#false} ~cond := #in~cond; {745#false} is VALID [2018-11-23 11:25:19,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {745#false} assume 0bv32 == ~cond; {745#false} is VALID [2018-11-23 11:25:19,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {745#false} assume !false; {745#false} is VALID [2018-11-23 11:25:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:19,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:19,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {745#false} assume !false; {745#false} is VALID [2018-11-23 11:25:19,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {745#false} assume 0bv32 == ~cond; {745#false} is VALID [2018-11-23 11:25:19,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {745#false} ~cond := #in~cond; {745#false} is VALID [2018-11-23 11:25:19,632 INFO L256 TraceCheckUtils]: 17: Hoare triple {745#false} call __VERIFIER_assert(#t~ret4); {745#false} is VALID [2018-11-23 11:25:19,633 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {828#(not (= ~SIZE~0 |linear_search_#in~n|))} {744#true} #51#return; {745#false} is VALID [2018-11-23 11:25:19,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {828#(not (= ~SIZE~0 |linear_search_#in~n|))} assume true; {828#(not (= ~SIZE~0 |linear_search_#in~n|))} is VALID [2018-11-23 11:25:19,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {828#(not (= ~SIZE~0 |linear_search_#in~n|))} is VALID [2018-11-23 11:25:19,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {841#(or (not |linear_search_#t~short1|) (bvult linear_search_~j~0 |linear_search_#in~n|))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {787#(bvult linear_search_~j~0 |linear_search_#in~n|)} is VALID [2018-11-23 11:25:19,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} #t~short1 := ~bvult32(~j~0, ~n); {841#(or (not |linear_search_#t~short1|) (bvult linear_search_~j~0 |linear_search_#in~n|))} is VALID [2018-11-23 11:25:19,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:19,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:19,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} #t~short1 := ~bvult32(~j~0, ~n); {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:19,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {744#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {845#(forall ((linear_search_~j~0 (_ BitVec 32))) (or (not (bvult linear_search_~j~0 linear_search_~n)) (bvult linear_search_~j~0 |linear_search_#in~n|)))} is VALID [2018-11-23 11:25:19,652 INFO L256 TraceCheckUtils]: 6: Hoare triple {744#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {744#true} is VALID [2018-11-23 11:25:19,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {744#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {744#true} is VALID [2018-11-23 11:25:19,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {744#true} call #t~ret5 := main(); {744#true} is VALID [2018-11-23 11:25:19,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {744#true} {744#true} #47#return; {744#true} is VALID [2018-11-23 11:25:19,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {744#true} assume true; {744#true} is VALID [2018-11-23 11:25:19,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {744#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {744#true} is VALID [2018-11-23 11:25:19,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {744#true} call ULTIMATE.init(); {744#true} is VALID [2018-11-23 11:25:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:19,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:19,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:25:19,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 11:25:19,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:19,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:25:19,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:19,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:25:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:25:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:25:19,783 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2018-11-23 11:25:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:20,414 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 11:25:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:25:20,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 11:25:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:25:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:25:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:25:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:25:20,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 11:25:20,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:20,508 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:25:20,509 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:25:20,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:25:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 11:25:20,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:20,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 11:25:20,533 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 11:25:20,533 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 11:25:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:20,535 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:25:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:25:20,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:20,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:20,536 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 11:25:20,536 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 11:25:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:20,538 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:25:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:25:20,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:20,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:20,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:20,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:25:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 11:25:20,541 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-11-23 11:25:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:20,541 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 11:25:20,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:25:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:25:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:25:20,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:20,543 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:20,543 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:20,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash -569340758, now seen corresponding path program 1 times [2018-11-23 11:25:20,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:20,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:20,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:20,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:25:20,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:25:20,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:20,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:20,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:20,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:25:21,225 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:25:21,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-23 11:25:21,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1005#true} is VALID [2018-11-23 11:25:21,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-23 11:25:21,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #47#return; {1005#true} is VALID [2018-11-23 11:25:21,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2018-11-23 11:25:21,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {1025#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} is VALID [2018-11-23 11:25:21,871 INFO L256 TraceCheckUtils]: 6: Hoare triple {1025#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {1029#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} is VALID [2018-11-23 11:25:21,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {1029#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {1033#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:21,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {1033#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {1033#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:21,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {1033#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1040#(or (and (= linear_search_~n |linear_search_#in~n|) (not |linear_search_#t~short1|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) |linear_search_#t~short1| (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))))} is VALID [2018-11-23 11:25:22,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {1040#(or (and (= linear_search_~n |linear_search_#in~n|) (not |linear_search_#t~short1|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) |linear_search_#t~short1| (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1044#(and (= linear_search_~n |linear_search_#in~n|) (= (_ bv1 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:22,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {1044#(and (= linear_search_~n |linear_search_#in~n|) (= (_ bv1 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} #t~short1 := ~bvult32(~j~0, ~n); {1048#(or (and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult (_ bv1 32) |linear_search_#in~n|) |linear_search_#t~short1| (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))))} is VALID [2018-11-23 11:25:22,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {1048#(or (and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult (_ bv1 32) |linear_search_#in~n|) |linear_search_#t~short1| (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32))))))} assume !#t~short1; {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} is VALID [2018-11-23 11:25:22,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} is VALID [2018-11-23 11:25:22,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} is VALID [2018-11-23 11:25:22,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} assume true; {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} is VALID [2018-11-23 11:25:22,256 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1052#(and (not (bvult (_ bv1 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} {1025#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_4| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_4| (_ bv8 32)))))} #51#return; {1006#false} is VALID [2018-11-23 11:25:22,256 INFO L256 TraceCheckUtils]: 17: Hoare triple {1006#false} call __VERIFIER_assert(#t~ret4); {1006#false} is VALID [2018-11-23 11:25:22,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2018-11-23 11:25:22,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {1006#false} assume 0bv32 == ~cond; {1006#false} is VALID [2018-11-23 11:25:22,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-23 11:25:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:22,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:22,426 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-23 11:25:23,440 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:25:23,810 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:25:25,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-23 11:25:25,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {1006#false} assume 0bv32 == ~cond; {1006#false} is VALID [2018-11-23 11:25:25,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2018-11-23 11:25:25,890 INFO L256 TraceCheckUtils]: 17: Hoare triple {1006#false} call __VERIFIER_assert(#t~ret4); {1006#false} is VALID [2018-11-23 11:25:25,892 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} {1089#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv1 32) ~SIZE~0))} #51#return; {1006#false} is VALID [2018-11-23 11:25:25,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume true; {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:25,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:25,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:25,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {1106#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} assume !#t~short1; {1093#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:25,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {1110#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv1 32) ~SIZE~0))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))))} #t~short1 := ~bvult32(~j~0, ~n); {1106#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|))) (not (bvult (_ bv1 32) ~SIZE~0))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} is VALID [2018-11-23 11:25:25,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {1114#(or (not |linear_search_#t~short1|) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv1 32) ~SIZE~0)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1110#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv1 32) ~SIZE~0))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))))} is VALID [2018-11-23 11:25:25,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {1118#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (_ bv1 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1114#(or (not |linear_search_#t~short1|) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv1 32) ~SIZE~0)))))} is VALID [2018-11-23 11:25:25,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {1118#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (_ bv1 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))))} #t~short1 := ~bvult32(~j~0, ~n); {1118#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (_ bv1 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))))} is VALID [2018-11-23 11:25:25,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {1005#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {1118#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (_ bv1 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|)))))} is VALID [2018-11-23 11:25:25,927 INFO L256 TraceCheckUtils]: 6: Hoare triple {1089#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv1 32) ~SIZE~0))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {1005#true} is VALID [2018-11-23 11:25:25,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {1089#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv1 32) ~SIZE~0))} is VALID [2018-11-23 11:25:25,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2018-11-23 11:25:25,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #47#return; {1005#true} is VALID [2018-11-23 11:25:25,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-23 11:25:25,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1005#true} is VALID [2018-11-23 11:25:25,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-23 11:25:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:25,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:25,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:25:25,937 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:25:25,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:25,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:25:26,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:26,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:25:26,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:25:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:25:26,197 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 15 states. [2018-11-23 11:25:26,808 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:25:27,159 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:25:27,797 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-23 11:25:28,279 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-11-23 11:25:28,756 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-23 11:25:29,549 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:25:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:30,387 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:25:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:25:30,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:25:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:25:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2018-11-23 11:25:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:25:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2018-11-23 11:25:30,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2018-11-23 11:25:30,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:30,731 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:25:30,731 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:25:30,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:25:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:25:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-23 11:25:30,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:30,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2018-11-23 11:25:30,790 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2018-11-23 11:25:30,790 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2018-11-23 11:25:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:30,792 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:25:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:25:30,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:30,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:30,793 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2018-11-23 11:25:30,793 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2018-11-23 11:25:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:30,795 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:25:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:25:30,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:30,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:30,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:30,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:25:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 11:25:30,797 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-11-23 11:25:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:30,798 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 11:25:30,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:25:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:25:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:25:30,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:30,799 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:30,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:30,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1514734505, now seen corresponding path program 2 times [2018-11-23 11:25:30,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:30,800 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:30,827 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:25:30,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:25:30,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:30,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:31,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:25:31,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:25:31,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:31,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:31,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:31,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:25:31,650 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:25:31,889 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:25:32,596 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-11-23 11:25:33,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 11:25:33,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1325#true} is VALID [2018-11-23 11:25:33,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 11:25:33,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #47#return; {1325#true} is VALID [2018-11-23 11:25:33,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2018-11-23 11:25:33,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {1345#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} is VALID [2018-11-23 11:25:35,109 INFO L256 TraceCheckUtils]: 6: Hoare triple {1345#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {1349#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} is UNKNOWN [2018-11-23 11:25:35,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {1349#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {1353#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} is VALID [2018-11-23 11:25:35,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {1353#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {1353#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} is VALID [2018-11-23 11:25:35,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {1353#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1353#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} is VALID [2018-11-23 11:25:35,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {1353#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1363#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} is VALID [2018-11-23 11:25:35,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {1363#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {1367#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32))))) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= linear_search_~q |linear_search_#in~q|) |linear_search_#t~short1| (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32))))))} is VALID [2018-11-23 11:25:35,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {1367#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32))))) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= linear_search_~q |linear_search_#in~q|) |linear_search_#t~short1| (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1371#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) |linear_search_#t~short1|) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32))))))} is VALID [2018-11-23 11:25:35,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {1371#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) |linear_search_#t~short1|) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32))))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1375#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:35,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {1375#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} #t~short1 := ~bvult32(~j~0, ~n); {1379#(or (and (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))) (and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (not |linear_search_#t~short1|) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))))} is VALID [2018-11-23 11:25:35,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {1379#(or (and (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))) (and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (not |linear_search_#t~short1|) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))))} assume !#t~short1; {1383#(and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:35,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {1383#(and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1383#(and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:35,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {1383#(and (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (_ bv2 32) linear_search_~j~0) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {1390#(and (not (bvult (_ bv2 32) ~SIZE~0)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (not (bvult (_ bv2 32) |linear_search_#in~n|)) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv1 32) |linear_search_#in~n|))} is VALID [2018-11-23 11:25:35,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {1390#(and (not (bvult (_ bv2 32) ~SIZE~0)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (not (bvult (_ bv2 32) |linear_search_#in~n|)) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv1 32) |linear_search_#in~n|))} assume true; {1390#(and (not (bvult (_ bv2 32) ~SIZE~0)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (not (bvult (_ bv2 32) |linear_search_#in~n|)) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv1 32) |linear_search_#in~n|))} is VALID [2018-11-23 11:25:35,487 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1390#(and (not (bvult (_ bv2 32) ~SIZE~0)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((v_prenex_1 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_1 (_ bv8 32)))) (not (bvult (_ bv2 32) |linear_search_#in~n|)) (exists ((v_prenex_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_2) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv1 32) |linear_search_#in~n|))} {1345#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_6| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_6| (_ bv8 32)))))} #51#return; {1326#false} is VALID [2018-11-23 11:25:35,487 INFO L256 TraceCheckUtils]: 20: Hoare triple {1326#false} call __VERIFIER_assert(#t~ret4); {1326#false} is VALID [2018-11-23 11:25:35,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 11:25:35,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {1326#false} assume 0bv32 == ~cond; {1326#false} is VALID [2018-11-23 11:25:35,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 11:25:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:35,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:35,745 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-11-23 11:25:35,983 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-23 11:25:38,539 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:25:40,023 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:25:40,471 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-23 11:25:40,809 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:25:41,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 11:25:41,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {1326#false} assume 0bv32 == ~cond; {1326#false} is VALID [2018-11-23 11:25:41,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 11:25:41,803 INFO L256 TraceCheckUtils]: 20: Hoare triple {1326#false} call __VERIFIER_assert(#t~ret4); {1326#false} is VALID [2018-11-23 11:25:41,805 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1425#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} {1421#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv2 32) ~SIZE~0) (not (bvult (_ bv1 32) ~SIZE~0)))} #51#return; {1326#false} is VALID [2018-11-23 11:25:41,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {1425#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} assume true; {1425#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:25:41,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {1432#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {1425#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:25:41,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {1432#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1432#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:25:41,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1439#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))) |linear_search_#t~short1|)} assume !#t~short1; {1432#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:25:41,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {1443#(and (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {1439#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32)))))) |linear_search_#t~short1|)} is VALID [2018-11-23 11:25:41,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {1447#(or (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not |linear_search_#t~short1|))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1443#(and (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} is VALID [2018-11-23 11:25:41,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1447#(or (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not |linear_search_#t~short1|))} is VALID [2018-11-23 11:25:41,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {1455#(or (not (bvult linear_search_~j~0 linear_search_~n)) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))))))} #t~short1 := ~bvult32(~j~0, ~n); {1451#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} is VALID [2018-11-23 11:25:42,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {1459#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv1 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1455#(or (not (bvult linear_search_~j~0 linear_search_~n)) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv1 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))))))} is VALID [2018-11-23 11:25:42,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {1459#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv1 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1459#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv1 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))} is VALID [2018-11-23 11:25:42,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {1459#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv1 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {1459#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv1 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))} is VALID [2018-11-23 11:25:42,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {1325#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {1459#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv2 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv1 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))} is VALID [2018-11-23 11:25:42,506 INFO L256 TraceCheckUtils]: 6: Hoare triple {1421#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv2 32) ~SIZE~0) (not (bvult (_ bv1 32) ~SIZE~0)))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {1325#true} is VALID [2018-11-23 11:25:42,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {1421#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv2 32) ~SIZE~0) (not (bvult (_ bv1 32) ~SIZE~0)))} is VALID [2018-11-23 11:25:42,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2018-11-23 11:25:42,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #47#return; {1325#true} is VALID [2018-11-23 11:25:42,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 11:25:42,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1325#true} is VALID [2018-11-23 11:25:42,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 11:25:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:42,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:42,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 11:25:42,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-23 11:25:42,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:42,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:25:43,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:43,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:25:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:25:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:25:43,966 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 21 states. [2018-11-23 11:25:45,871 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-11-23 11:25:46,756 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-11-23 11:25:47,518 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-23 11:25:47,948 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-11-23 11:25:48,950 WARN L180 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-11-23 11:25:49,410 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:25:49,795 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:25:50,452 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:25:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:51,030 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 11:25:51,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:25:51,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-23 11:25:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:25:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2018-11-23 11:25:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:25:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2018-11-23 11:25:51,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2018-11-23 11:25:51,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:51,594 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:25:51,595 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:25:51,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:25:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:25:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-23 11:25:51,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:51,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-23 11:25:51,652 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-23 11:25:51,652 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-23 11:25:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:51,654 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 11:25:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:25:51,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:51,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:51,655 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-23 11:25:51,655 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-23 11:25:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:51,657 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 11:25:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:25:51,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:51,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:51,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:51,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:25:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 11:25:51,659 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2018-11-23 11:25:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:51,659 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 11:25:51,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:25:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:25:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:25:51,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:51,661 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:51,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:51,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 655675786, now seen corresponding path program 3 times [2018-11-23 11:25:51,661 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:51,688 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:25:51,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:25:51,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:51,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:51,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:25:51,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:25:51,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:51,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:51,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:25:51,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:25:52,497 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:25:53,014 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:25:53,717 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-11-23 11:25:54,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 11:25:54,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1676#true} is VALID [2018-11-23 11:25:54,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 11:25:54,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #47#return; {1676#true} is VALID [2018-11-23 11:25:54,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret5 := main(); {1676#true} is VALID [2018-11-23 11:25:54,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {1696#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} is VALID [2018-11-23 11:25:56,076 INFO L256 TraceCheckUtils]: 6: Hoare triple {1696#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {1700#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} is UNKNOWN [2018-11-23 11:25:56,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {1700#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {1704#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:56,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {1704#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {1704#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:56,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1704#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:56,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {1704#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1714#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:56,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {1714#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {1714#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:25:56,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {1714#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1721#(or (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) |linear_search_#t~short1|))} is VALID [2018-11-23 11:25:56,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {1721#(or (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) |linear_search_#t~short1|))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1725#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:56,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {1725#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} #t~short1 := ~bvult32(~j~0, ~n); {1729#(or (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))) (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))))} is VALID [2018-11-23 11:25:56,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {1729#(or (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))) (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1733#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult linear_search_~j~0 linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:25:56,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {1733#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult linear_search_~j~0 linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1737#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) linear_search_~n) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} is VALID [2018-11-23 11:25:56,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {1737#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) linear_search_~n) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} #t~short1 := ~bvult32(~j~0, ~n); {1741#(or (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|) (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not |linear_search_#t~short1|)))} is VALID [2018-11-23 11:25:56,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {1741#(or (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|) (and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not |linear_search_#t~short1|)))} assume !#t~short1; {1745#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} is VALID [2018-11-23 11:25:56,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {1745#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1745#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} is VALID [2018-11-23 11:25:56,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {1745#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {1752#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult (_ bv3 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv3 32) ~SIZE~0)))} is VALID [2018-11-23 11:25:56,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {1752#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult (_ bv3 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv3 32) ~SIZE~0)))} assume true; {1752#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult (_ bv3 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv3 32) ~SIZE~0)))} is VALID [2018-11-23 11:25:56,167 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1752#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (bvult (_ bv2 32) |linear_search_#in~n|) (not (bvult (_ bv3 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv3 32) ~SIZE~0)))} {1696#(and (exists ((|v_main_#t~nondet3_8| (_ BitVec 32))) (= (bvadd (bvudiv |v_main_#t~nondet3_8| (_ bv8 32)) (_ bv1 32)) ~SIZE~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} #51#return; {1677#false} is VALID [2018-11-23 11:25:56,167 INFO L256 TraceCheckUtils]: 23: Hoare triple {1677#false} call __VERIFIER_assert(#t~ret4); {1677#false} is VALID [2018-11-23 11:25:56,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2018-11-23 11:25:56,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {1677#false} assume 0bv32 == ~cond; {1677#false} is VALID [2018-11-23 11:25:56,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 11:25:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:56,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:56,484 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-23 11:25:56,708 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-23 11:26:01,686 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:26:02,594 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:26:03,145 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:26:03,536 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:26:03,885 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:26:04,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 11:26:04,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {1677#false} assume 0bv32 == ~cond; {1677#false} is VALID [2018-11-23 11:26:04,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2018-11-23 11:26:04,239 INFO L256 TraceCheckUtils]: 23: Hoare triple {1677#false} call __VERIFIER_assert(#t~ret4); {1677#false} is VALID [2018-11-23 11:26:04,241 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1787#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} {1783#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv2 32) ~SIZE~0)))} #51#return; {1677#false} is VALID [2018-11-23 11:26:04,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {1787#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} assume true; {1787#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {1794#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {1787#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {1794#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1794#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {1801#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1| (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} assume !#t~short1; {1794#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {1805#(and (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0))))} #t~short1 := ~bvult32(~j~0, ~n); {1801#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1| (and (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv3 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1805#(and (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {1813#(or (not |linear_search_#t~short1|) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv3 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1809#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv3 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))))} is VALID [2018-11-23 11:26:04,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {1817#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv3 32) ~SIZE~0))))} #t~short1 := ~bvult32(~j~0, ~n); {1813#(or (not |linear_search_#t~short1|) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv3 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))))} is VALID [2018-11-23 11:26:04,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {1821#(or (not |linear_search_#t~short1|) (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1817#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv3 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:04,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {1825#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1821#(or (not |linear_search_#t~short1|) (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))))} is VALID [2018-11-23 11:26:04,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {1825#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {1825#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:05,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {1832#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1825#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv2 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:05,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {1832#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {1832#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)))} is VALID [2018-11-23 11:26:05,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {1832#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)))} #t~short1 := ~bvult32(~j~0, ~n); {1832#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)))} is VALID [2018-11-23 11:26:05,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {1676#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {1832#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv2 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv3 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv4 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)))} is VALID [2018-11-23 11:26:05,375 INFO L256 TraceCheckUtils]: 6: Hoare triple {1783#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv2 32) ~SIZE~0)))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {1676#true} is VALID [2018-11-23 11:26:05,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {1783#(or (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-23 11:26:05,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret5 := main(); {1676#true} is VALID [2018-11-23 11:26:05,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #47#return; {1676#true} is VALID [2018-11-23 11:26:05,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 11:26:05,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1676#true} is VALID [2018-11-23 11:26:05,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 11:26:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:05,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:05,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 11:26:05,386 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2018-11-23 11:26:05,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:05,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:26:06,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:06,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:26:06,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:26:06,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:26:06,794 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2018-11-23 11:26:08,804 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 11:26:10,163 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-11-23 11:26:10,737 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-23 11:26:11,539 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-23 11:26:12,134 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:26:13,241 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:26:14,279 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:26:15,093 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:26:15,436 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:26:15,920 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:26:18,784 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-11-23 11:26:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:19,780 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-23 11:26:19,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:26:19,780 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2018-11-23 11:26:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:26:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-11-23 11:26:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:26:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-11-23 11:26:19,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 63 transitions. [2018-11-23 11:26:20,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:20,830 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:26:20,830 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:26:20,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:26:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:26:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 11:26:21,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:21,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 11:26:21,014 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 11:26:21,015 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 11:26:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:21,018 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 11:26:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 11:26:21,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:21,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:21,019 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 11:26:21,019 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 11:26:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:21,021 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 11:26:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 11:26:21,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:21,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:21,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:21,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:26:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 11:26:21,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 27 [2018-11-23 11:26:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:21,024 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 11:26:21,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:26:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 11:26:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:26:21,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:21,025 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:21,025 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:21,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1383986313, now seen corresponding path program 4 times [2018-11-23 11:26:21,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:21,048 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:26:21,116 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:26:21,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:21,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:21,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:26:21,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:26:21,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:21,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:21,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:21,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:26:21,802 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:26:22,238 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:26:22,861 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-11-23 11:26:23,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 11:26:23,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2099#true} is VALID [2018-11-23 11:26:23,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 11:26:23,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #47#return; {2099#true} is VALID [2018-11-23 11:26:23,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret5 := main(); {2099#true} is VALID [2018-11-23 11:26:23,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {2119#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,087 INFO L256 TraceCheckUtils]: 6: Hoare triple {2119#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {2123#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is UNKNOWN [2018-11-23 11:26:25,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {2127#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {2127#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {2127#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {2127#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2127#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {2127#(and (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2137#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {2137#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {2137#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {2137#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2137#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {2137#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2147#(and (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {2147#(and (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {2147#(and (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:25,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {2147#(and (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2154#(or (and (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) |linear_search_#t~short1| (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))))} is VALID [2018-11-23 11:26:25,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {2154#(or (and (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) |linear_search_#t~short1| (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2158#(and (= linear_search_~n |linear_search_#in~n|) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {2158#(and (= linear_search_~n |linear_search_#in~n|) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {2162#(or (and (= linear_search_~n |linear_search_#in~n|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))) (and (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) |linear_search_#t~short1| (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))))} is VALID [2018-11-23 11:26:25,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {2162#(or (and (= linear_search_~n |linear_search_#in~n|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))) (and (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) |linear_search_#t~short1| (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2166#(and (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {2166#(and (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd (bvmul (_ bv4 32) linear_search_~j~0) |linear_search_#in~a.offset| (_ bv4294967292 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2170#(and (bvult (_ bv3 32) linear_search_~n) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {2170#(and (bvult (_ bv3 32) linear_search_~n) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {2174#(or (and (bvult (_ bv4 32) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) |linear_search_#t~short1| (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))) (and (bvult (_ bv3 32) |linear_search_#in~n|) (not |linear_search_#t~short1|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))))} is VALID [2018-11-23 11:26:25,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {2174#(or (and (bvult (_ bv4 32) |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) |linear_search_#t~short1| (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))) (and (bvult (_ bv3 32) |linear_search_#in~n|) (not |linear_search_#t~short1|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32))))))} assume !#t~short1; {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} assume true; {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} is VALID [2018-11-23 11:26:25,158 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2178#(and (bvult (_ bv3 32) |linear_search_#in~n|) (not (bvult (_ bv4 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} {2119#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_10| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_10| (_ bv8 32)))))} #51#return; {2100#false} is VALID [2018-11-23 11:26:25,158 INFO L256 TraceCheckUtils]: 26: Hoare triple {2100#false} call __VERIFIER_assert(#t~ret4); {2100#false} is VALID [2018-11-23 11:26:25,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 11:26:25,159 INFO L273 TraceCheckUtils]: 28: Hoare triple {2100#false} assume 0bv32 == ~cond; {2100#false} is VALID [2018-11-23 11:26:25,159 INFO L273 TraceCheckUtils]: 29: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 11:26:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:25,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:25,503 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-23 11:26:30,369 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:26:30,743 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:26:31,081 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:26:31,459 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:26:33,520 INFO L273 TraceCheckUtils]: 29: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 11:26:33,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {2100#false} assume 0bv32 == ~cond; {2100#false} is VALID [2018-11-23 11:26:33,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 11:26:33,521 INFO L256 TraceCheckUtils]: 26: Hoare triple {2100#false} call __VERIFIER_assert(#t~ret4); {2100#false} is VALID [2018-11-23 11:26:33,523 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} {2215#(or (bvult (_ bv4 32) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #51#return; {2100#false} is VALID [2018-11-23 11:26:33,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume true; {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:26:33,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:26:33,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:26:33,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {2232#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} assume !#t~short1; {2219#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:26:33,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {2236#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {2232#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (bvult (_ bv3 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} is VALID [2018-11-23 11:26:33,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {2240#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2236#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} is VALID [2018-11-23 11:26:33,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {2244#(or (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))) (not |linear_search_#t~short1|))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2240#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:26:33,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {2248#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} #t~short1 := ~bvult32(~j~0, ~n); {2244#(or (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))) (not |linear_search_#t~short1|))} is VALID [2018-11-23 11:26:33,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {2252#(or (not |linear_search_#t~short1|) (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2248#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:33,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {2256#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2252#(or (not |linear_search_#t~short1|) (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))))} is VALID [2018-11-23 11:26:33,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {2256#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {2256#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:34,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {2263#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2256#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv4 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:34,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {2263#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2263#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)))} is VALID [2018-11-23 11:26:34,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {2263#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {2263#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)))} is VALID [2018-11-23 11:26:35,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {2273#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2263#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv4 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)))} is VALID [2018-11-23 11:26:35,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {2273#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2273#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:35,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {2273#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} #t~short1 := ~bvult32(~j~0, ~n); {2273#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:35,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {2099#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {2273#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv3 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv4 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:35,239 INFO L256 TraceCheckUtils]: 6: Hoare triple {2215#(or (bvult (_ bv4 32) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {2099#true} is VALID [2018-11-23 11:26:35,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {2215#(or (bvult (_ bv4 32) ~SIZE~0) (not (bvult (_ bv3 32) ~SIZE~0)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:26:35,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret5 := main(); {2099#true} is VALID [2018-11-23 11:26:35,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #47#return; {2099#true} is VALID [2018-11-23 11:26:35,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 11:26:35,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2099#true} is VALID [2018-11-23 11:26:35,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 11:26:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:35,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:35,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 11:26:35,254 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-11-23 11:26:35,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:35,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:26:37,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:37,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:26:37,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:26:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:26:37,624 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 25 states. [2018-11-23 11:26:39,014 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:26:40,817 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-11-23 11:26:42,343 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-11-23 11:26:42,878 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-23 11:26:44,178 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-11-23 11:26:45,050 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:26:45,816 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:26:46,454 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:26:46,979 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:26:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:48,199 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-23 11:26:48,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:26:48,199 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-11-23 11:26:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:26:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 69 transitions. [2018-11-23 11:26:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:26:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 69 transitions. [2018-11-23 11:26:48,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 69 transitions. [2018-11-23 11:26:48,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:48,679 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:26:48,679 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:26:48,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:26:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:26:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-23 11:26:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:48,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2018-11-23 11:26:48,782 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2018-11-23 11:26:48,782 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2018-11-23 11:26:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:48,784 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 11:26:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:26:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:48,786 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2018-11-23 11:26:48,786 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2018-11-23 11:26:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:48,787 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 11:26:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:26:48,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:48,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:48,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:48,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:26:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 11:26:48,790 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2018-11-23 11:26:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:48,790 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 11:26:48,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:26:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 11:26:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:26:48,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:48,791 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:48,791 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:48,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 239726186, now seen corresponding path program 5 times [2018-11-23 11:26:48,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:48,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:48,817 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:26:48,941 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:26:48,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:48,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:48,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:26:49,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:26:49,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:49,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:49,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:49,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:26:49,816 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:26:50,218 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:26:50,921 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-11-23 11:26:51,598 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-23 11:26:51,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {2555#true} call ULTIMATE.init(); {2555#true} is VALID [2018-11-23 11:26:51,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {2555#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2555#true} is VALID [2018-11-23 11:26:51,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {2555#true} assume true; {2555#true} is VALID [2018-11-23 11:26:51,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2555#true} {2555#true} #47#return; {2555#true} is VALID [2018-11-23 11:26:51,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {2555#true} call #t~ret5 := main(); {2555#true} is VALID [2018-11-23 11:26:51,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {2555#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {2575#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,858 INFO L256 TraceCheckUtils]: 6: Hoare triple {2575#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {2579#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {2579#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {2583#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {2583#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {2583#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {2583#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2583#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {2583#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2593#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {2593#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {2593#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {2593#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2593#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {2593#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2603#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {2603#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {2603#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:26:51,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {2603#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2610#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1|))} is VALID [2018-11-23 11:26:51,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {2610#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32))))) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= (_ bv2 32) linear_search_~j~0) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1|))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2614#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {2614#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {2618#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1|) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32))))))} is VALID [2018-11-23 11:26:51,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {2618#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1|) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2622#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {2622#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (= (_ bv3 32) linear_search_~j~0) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2626#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult (_ bv3 32) linear_search_~n) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:51,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {2626#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult (_ bv3 32) linear_search_~n) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {2630#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult (_ bv3 32) linear_search_~n) (= linear_search_~n |linear_search_#in~n|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32))) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1| (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:26:51,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {2630#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (bvult (_ bv3 32) linear_search_~n) (= linear_search_~n |linear_search_#in~n|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32))) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1| (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2634#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:51,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {2634#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) (= (bvadd linear_search_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2638#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (bvult (_ bv4 32) linear_search_~n) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {2638#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (= linear_search_~n |linear_search_#in~n|) (bvult (_ bv4 32) linear_search_~n) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {2642#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (bvult (_ bv5 32) |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1|) (and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32))))))} is VALID [2018-11-23 11:26:51,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {2642#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (bvult (_ bv5 32) |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))) |linear_search_#t~short1|) (and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32))))))} assume !#t~short1; {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} assume true; {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} is VALID [2018-11-23 11:26:51,943 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2646#(and (bvult (_ bv4 32) |linear_search_#in~n|) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))))) (not (bvult (_ bv5 32) |linear_search_#in~n|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} {2575#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))) (exists ((|v_main_#t~nondet3_12| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_12| (_ bv8 32)))))} #51#return; {2556#false} is VALID [2018-11-23 11:26:51,943 INFO L256 TraceCheckUtils]: 29: Hoare triple {2556#false} call __VERIFIER_assert(#t~ret4); {2556#false} is VALID [2018-11-23 11:26:51,944 INFO L273 TraceCheckUtils]: 30: Hoare triple {2556#false} ~cond := #in~cond; {2556#false} is VALID [2018-11-23 11:26:51,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {2556#false} assume 0bv32 == ~cond; {2556#false} is VALID [2018-11-23 11:26:51,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {2556#false} assume !false; {2556#false} is VALID [2018-11-23 11:26:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:51,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:52,331 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-11-23 11:26:54,835 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:26:55,129 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:26:55,685 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:26:56,208 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:26:56,661 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:26:57,232 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:26:57,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {2556#false} assume !false; {2556#false} is VALID [2018-11-23 11:26:57,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {2556#false} assume 0bv32 == ~cond; {2556#false} is VALID [2018-11-23 11:26:57,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {2556#false} ~cond := #in~cond; {2556#false} is VALID [2018-11-23 11:26:57,818 INFO L256 TraceCheckUtils]: 29: Hoare triple {2556#false} call __VERIFIER_assert(#t~ret4); {2556#false} is VALID [2018-11-23 11:26:57,820 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} {2683#(or (bvult (_ bv5 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #51#return; {2556#false} is VALID [2018-11-23 11:26:57,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} assume true; {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:57,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:57,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:57,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {2700#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))) |linear_search_#t~short1|)} assume !#t~short1; {2687#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:57,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {2704#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {2700#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (and (bvult (_ bv4 32) ~SIZE~0) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv5 32) ~SIZE~0))) |linear_search_#t~short1|)} is VALID [2018-11-23 11:26:57,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {2708#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2704#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} is VALID [2018-11-23 11:26:57,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {2712#(or (not |linear_search_#t~short1|) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2708#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:26:57,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {2716#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))))} #t~short1 := ~bvult32(~j~0, ~n); {2712#(or (not |linear_search_#t~short1|) (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))))} is VALID [2018-11-23 11:26:57,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {2720#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2716#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))))} is VALID [2018-11-23 11:26:57,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {2724#(or (not |linear_search_#t~short1|) (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2720#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:57,910 INFO L273 TraceCheckUtils]: 17: Hoare triple {2728#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {2724#(or (not |linear_search_#t~short1|) (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))))} is VALID [2018-11-23 11:26:57,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {2732#(or (and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))) (not |linear_search_#t~short1|))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2728#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:57,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {2736#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2732#(or (and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n)))) (not |linear_search_#t~short1|))} is VALID [2018-11-23 11:26:57,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {2736#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {2736#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:58,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {2743#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2736#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (_ bv5 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0)))) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:26:58,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {2743#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2743#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:26:58,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {2743#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} #t~short1 := ~bvult32(~j~0, ~n); {2743#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:27:00,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {2753#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2743#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:27:00,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {2753#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {2753#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} is VALID [2018-11-23 11:27:00,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {2753#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {2753#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} is VALID [2018-11-23 11:27:00,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {2555#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {2753#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (= (bvadd (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv4 32) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (_ bv5 32) ~SIZE~0)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} is VALID [2018-11-23 11:27:00,140 INFO L256 TraceCheckUtils]: 6: Hoare triple {2683#(or (bvult (_ bv5 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {2555#true} is VALID [2018-11-23 11:27:00,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {2555#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {2683#(or (bvult (_ bv5 32) ~SIZE~0) (not (bvult (_ bv4 32) ~SIZE~0)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:27:00,143 INFO L256 TraceCheckUtils]: 4: Hoare triple {2555#true} call #t~ret5 := main(); {2555#true} is VALID [2018-11-23 11:27:00,143 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2555#true} {2555#true} #47#return; {2555#true} is VALID [2018-11-23 11:27:00,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {2555#true} assume true; {2555#true} is VALID [2018-11-23 11:27:00,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {2555#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2555#true} is VALID [2018-11-23 11:27:00,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {2555#true} call ULTIMATE.init(); {2555#true} is VALID [2018-11-23 11:27:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:00,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:00,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-11-23 11:27:00,155 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2018-11-23 11:27:00,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:00,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:27:02,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:02,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:27:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:27:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:27:02,881 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 31 states. [2018-11-23 11:27:06,670 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-11-23 11:27:09,168 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-23 11:27:09,765 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-23 11:27:10,319 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-11-23 11:27:11,419 WARN L180 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-11-23 11:27:12,851 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-11-23 11:27:14,209 WARN L180 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-23 11:27:15,472 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:27:16,217 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:27:17,263 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:27:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:18,251 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-11-23 11:27:18,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:27:18,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2018-11-23 11:27:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:27:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2018-11-23 11:27:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:27:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2018-11-23 11:27:18,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2018-11-23 11:27:18,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:18,946 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:27:18,946 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:27:18,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=310, Invalid=1582, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:27:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:27:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-23 11:27:19,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:19,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 37 states. [2018-11-23 11:27:19,097 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 37 states. [2018-11-23 11:27:19,097 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 37 states. [2018-11-23 11:27:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:19,100 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 11:27:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 11:27:19,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:19,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:19,101 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 47 states. [2018-11-23 11:27:19,101 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 47 states. [2018-11-23 11:27:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:19,102 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 11:27:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 11:27:19,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:19,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:19,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:19,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:27:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 11:27:19,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2018-11-23 11:27:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:19,105 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 11:27:19,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:27:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 11:27:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:27:19,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:19,106 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:19,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:19,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1957870953, now seen corresponding path program 6 times [2018-11-23 11:27:19,106 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:19,127 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 11:27:19,420 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:27:19,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:19,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:19,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:27:19,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:27:19,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:27:19,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:27:19,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:27:19,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:27:20,425 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:27:20,677 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:27:21,479 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:27:21,932 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:27:22,777 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-11-23 11:27:23,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3061#true} is VALID [2018-11-23 11:27:23,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {3061#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3061#true} is VALID [2018-11-23 11:27:23,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2018-11-23 11:27:23,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #47#return; {3061#true} is VALID [2018-11-23 11:27:23,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret5 := main(); {3061#true} is VALID [2018-11-23 11:27:23,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {3061#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {3081#(and (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} is VALID [2018-11-23 11:27:25,297 INFO L256 TraceCheckUtils]: 6: Hoare triple {3081#(and (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {3085#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))))} is UNKNOWN [2018-11-23 11:27:25,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {3085#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {3089#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {3089#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3089#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {3089#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3089#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {3089#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3099#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {3099#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3099#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {3099#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3099#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {3099#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3109#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {3109#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3109#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {3109#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3109#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {3109#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3119#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:27:25,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {3119#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3123#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) |linear_search_#t~short1| (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)))} is VALID [2018-11-23 11:27:25,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {3123#(or (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) |linear_search_#t~short1| (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= linear_search_~q |linear_search_#in~q|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3127#(or (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:27:25,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {3127#(or (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|) (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_16| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3131#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} is VALID [2018-11-23 11:27:25,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} #t~short1 := ~bvult32(~j~0, ~n); {3131#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} is VALID [2018-11-23 11:27:25,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {3131#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3131#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} is VALID [2018-11-23 11:27:25,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {3131#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3141#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:25,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {3141#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {3145#(or (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|)) (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|))} is VALID [2018-11-23 11:27:25,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {3145#(or (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|)) (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3149#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n))} is VALID [2018-11-23 11:27:25,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {3149#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3153#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:25,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {3153#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {3157#(or (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (not |linear_search_#t~short1|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|)) (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|))} is VALID [2018-11-23 11:27:25,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {3157#(or (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (not |linear_search_#t~short1|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|)) (and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult linear_search_~j~0 |linear_search_#in~n|) |linear_search_#t~short1|))} assume !#t~short1; {3161#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|))} is VALID [2018-11-23 11:27:25,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {3161#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {3161#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|))} is VALID [2018-11-23 11:27:25,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {3161#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult linear_search_~j~0 |linear_search_#in~n|)) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) |linear_search_#in~n|))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {3168#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (not (bvult (_ bv6 32) ~SIZE~0)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv6 32) |linear_search_#in~n|)) (bvult (_ bv5 32) |linear_search_#in~n|))} is VALID [2018-11-23 11:27:25,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {3168#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (not (bvult (_ bv6 32) ~SIZE~0)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv6 32) |linear_search_#in~n|)) (bvult (_ bv5 32) |linear_search_#in~n|))} assume true; {3168#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (not (bvult (_ bv6 32) ~SIZE~0)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv6 32) |linear_search_#in~n|)) (bvult (_ bv5 32) |linear_search_#in~n|))} is VALID [2018-11-23 11:27:25,488 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3168#(and (exists ((v_prenex_4 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_4 (_ bv8 32)))) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (not (bvult (_ bv6 32) ~SIZE~0)) (exists ((v_prenex_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_3) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not (bvult (_ bv6 32) |linear_search_#in~n|)) (bvult (_ bv5 32) |linear_search_#in~n|))} {3081#(and (exists ((|v_main_#t~nondet3_14| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_14| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} #51#return; {3062#false} is VALID [2018-11-23 11:27:25,489 INFO L256 TraceCheckUtils]: 32: Hoare triple {3062#false} call __VERIFIER_assert(#t~ret4); {3062#false} is VALID [2018-11-23 11:27:25,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2018-11-23 11:27:25,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {3062#false} assume 0bv32 == ~cond; {3062#false} is VALID [2018-11-23 11:27:25,489 INFO L273 TraceCheckUtils]: 35: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2018-11-23 11:27:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:25,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:25,921 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-23 11:27:26,154 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-23 11:27:31,118 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:27:31,606 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:27:31,880 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 11:27:32,525 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:27:32,990 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:27:33,678 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:27:34,183 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:27:34,666 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:27:35,210 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:27:35,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2018-11-23 11:27:35,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {3062#false} assume 0bv32 == ~cond; {3062#false} is VALID [2018-11-23 11:27:35,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2018-11-23 11:27:35,667 INFO L256 TraceCheckUtils]: 32: Hoare triple {3062#false} call __VERIFIER_assert(#t~ret4); {3062#false} is VALID [2018-11-23 11:27:35,669 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3203#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} {3199#(or (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (not (bvult (_ bv5 32) ~SIZE~0)) (bvult (_ bv6 32) ~SIZE~0))} #51#return; {3062#false} is VALID [2018-11-23 11:27:35,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {3203#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume true; {3203#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:27:35,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {3210#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {3203#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:27:35,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {3210#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {3210#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:27:35,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {3217#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} assume !#t~short1; {3210#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:27:35,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {3221#(and (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {3217#(or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} is VALID [2018-11-23 11:27:35,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {3225#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3221#(and (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (bvult linear_search_~j~0 ~SIZE~0) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} is VALID [2018-11-23 11:27:35,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {3229#(or (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not |linear_search_#t~short1|))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3225#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))))} is VALID [2018-11-23 11:27:35,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {3233#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3229#(or (and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not |linear_search_#t~short1|))} is VALID [2018-11-23 11:27:35,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {3237#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3233#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv1 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))))} is VALID [2018-11-23 11:27:35,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {3237#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3237#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:27:35,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {3237#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3237#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:27:35,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {3247#(or (not |linear_search_#t~short1|) (and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3237#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) ~SIZE~0) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:27:35,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {3251#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not |linear_search_#t~short1|) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not |linear_search_#t~short1|) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not |linear_search_#t~short1|) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3247#(or (not |linear_search_#t~short1|) (and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0))))} is VALID [2018-11-23 11:27:35,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {3255#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} #t~short1 := ~bvult32(~j~0, ~n); {3251#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not |linear_search_#t~short1|) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not |linear_search_#t~short1|) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not |linear_search_#t~short1|) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} is VALID [2018-11-23 11:27:36,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {3259#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3255#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) ~SIZE~0) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} is VALID [2018-11-23 11:27:36,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {3259#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3259#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:27:36,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {3259#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3259#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:27:38,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {3269#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3259#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:27:38,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {3269#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3269#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} is VALID [2018-11-23 11:27:38,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {3269#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {3269#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} is VALID [2018-11-23 11:27:39,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {3279#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3269#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv6 32) ~SIZE~0)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)))} is VALID [2018-11-23 11:27:39,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {3279#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3279#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)))} is VALID [2018-11-23 11:27:39,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {3279#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)))} #t~short1 := ~bvult32(~j~0, ~n); {3279#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)))} is VALID [2018-11-23 11:27:39,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {3061#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {3279#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (not (bvult (_ bv6 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) ~SIZE~0)))} is VALID [2018-11-23 11:27:39,960 INFO L256 TraceCheckUtils]: 6: Hoare triple {3199#(or (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (not (bvult (_ bv5 32) ~SIZE~0)) (bvult (_ bv6 32) ~SIZE~0))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {3061#true} is VALID [2018-11-23 11:27:39,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {3061#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {3199#(or (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (not (bvult (_ bv5 32) ~SIZE~0)) (bvult (_ bv6 32) ~SIZE~0))} is VALID [2018-11-23 11:27:39,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret5 := main(); {3061#true} is VALID [2018-11-23 11:27:39,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #47#return; {3061#true} is VALID [2018-11-23 11:27:39,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2018-11-23 11:27:39,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {3061#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3061#true} is VALID [2018-11-23 11:27:39,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3061#true} is VALID [2018-11-23 11:27:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:39,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:39,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-11-23 11:27:39,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2018-11-23 11:27:39,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:39,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:27:44,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 62 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:44,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:27:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:27:44,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:27:44,890 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 33 states. [2018-11-23 11:27:49,577 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-11-23 11:27:52,289 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-11-23 11:27:53,000 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-11-23 11:27:53,618 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-23 11:27:53,983 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-11-23 11:27:54,661 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:27:55,799 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:27:56,962 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:27:58,276 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:27:59,114 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:27:59,837 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:28:00,262 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:28:00,743 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:28:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:00,860 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 11:28:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:28:00,860 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2018-11-23 11:28:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:28:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 69 transitions. [2018-11-23 11:28:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:28:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 69 transitions. [2018-11-23 11:28:00,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 69 transitions. [2018-11-23 11:28:01,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:01,881 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:28:01,882 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:28:01,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=349, Invalid=1721, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:28:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:28:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-11-23 11:28:02,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:02,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 40 states. [2018-11-23 11:28:02,205 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 40 states. [2018-11-23 11:28:02,205 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 40 states. [2018-11-23 11:28:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:02,206 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 11:28:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 11:28:02,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:02,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:02,206 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 50 states. [2018-11-23 11:28:02,207 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 50 states. [2018-11-23 11:28:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:02,208 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 11:28:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 11:28:02,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:02,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:02,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:02,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:28:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 11:28:02,210 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2018-11-23 11:28:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:02,210 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 11:28:02,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:28:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:28:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:28:02,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:02,211 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:02,211 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:02,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1907221322, now seen corresponding path program 7 times [2018-11-23 11:28:02,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:02,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:02,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:28:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:02,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:02,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:28:02,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:28:02,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:28:02,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:28:02,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:28:02,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:28:03,319 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:28:03,563 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:28:04,522 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:28:05,277 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:28:05,687 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-11-23 11:28:05,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {3590#true} call ULTIMATE.init(); {3590#true} is VALID [2018-11-23 11:28:05,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {3590#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3590#true} is VALID [2018-11-23 11:28:05,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-23 11:28:05,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3590#true} {3590#true} #47#return; {3590#true} is VALID [2018-11-23 11:28:05,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {3590#true} call #t~ret5 := main(); {3590#true} is VALID [2018-11-23 11:28:05,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {3590#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {3610#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} is VALID [2018-11-23 11:28:07,938 INFO L256 TraceCheckUtils]: 6: Hoare triple {3610#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {3614#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))))} is UNKNOWN [2018-11-23 11:28:07,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {3614#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {3618#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {3618#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3618#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {3618#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3618#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {3618#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~j~0 (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3628#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {3628#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3628#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {3628#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3628#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {3628#(and (= (bvadd linear_search_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3638#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {3638#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3638#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {3638#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3638#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {3638#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= (bvadd linear_search_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3648#(and (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} is VALID [2018-11-23 11:28:07,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {3648#(and (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base))} #t~short1 := ~bvult32(~j~0, ~n); {3652#(or (and (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= linear_search_~q |linear_search_#in~q|) |linear_search_#t~short1| (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)) (and (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)))} is VALID [2018-11-23 11:28:08,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {3652#(or (and (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) (= linear_search_~q |linear_search_#in~q|) |linear_search_#t~short1| (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)) (and (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= linear_search_~q |linear_search_#in~q|) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|) (= linear_search_~a.offset |linear_search_#in~a.offset|) (= |linear_search_#in~a.base| linear_search_~a.base)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3656#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|) (and (exists ((v_prenex_7 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_7) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((v_prenex_8 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_8 (_ bv8 32)))) (bvult linear_search_~j~0 linear_search_~n) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)))} is VALID [2018-11-23 11:28:08,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {3656#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|) (and (exists ((v_prenex_7 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_7) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= (bvadd linear_search_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (= linear_search_~n |linear_search_#in~n|) (exists ((v_prenex_8 (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv v_prenex_8 (_ bv8 32)))) (bvult linear_search_~j~0 linear_search_~n) (not |linear_search_#t~short1|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0))) |linear_search_#in~q|)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3660#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} is VALID [2018-11-23 11:28:08,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {3660#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} #t~short1 := ~bvult32(~j~0, ~n); {3660#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} is VALID [2018-11-23 11:28:08,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {3660#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3660#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} is VALID [2018-11-23 11:28:08,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {3660#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4294967292 32))) |linear_search_#in~q|)) (= (_ bv4 32) linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3670#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:28:08,121 INFO L273 TraceCheckUtils]: 23: Hoare triple {3670#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {3674#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|)))} is VALID [2018-11-23 11:28:08,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {3674#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n) |linear_search_#t~short1|) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv3 32) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvult linear_search_~j~0 linear_search_~n)) (not |linear_search_#t~short1|)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3678#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n))} is VALID [2018-11-23 11:28:08,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {3678#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (bvult linear_search_~j~0 linear_search_~n))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3682#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:28:08,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {3682#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:28:08,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3682#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:28:08,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#(and (bvult (bvadd linear_search_~j~0 (_ bv4294967295 32)) linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3692#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv5 32) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:28:08,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {3692#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (bvult (_ bv5 32) linear_search_~n) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (= linear_search_~n |linear_search_#in~n|) (= (bvadd linear_search_~j~0 (_ bv4294967289 32)) (_ bv0 32)))} #t~short1 := ~bvult32(~j~0, ~n); {3696#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv7 32) |linear_search_#in~n|) |linear_search_#t~short1|) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not |linear_search_#t~short1|) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|))))} is VALID [2018-11-23 11:28:08,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {3696#(or (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv7 32) |linear_search_#in~n|) |linear_search_#t~short1|) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (not |linear_search_#t~short1|) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|))))} assume !#t~short1; {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:28:08,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:28:08,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:28:08,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} assume true; {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} is VALID [2018-11-23 11:28:08,150 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3700#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))) |linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32)))) (_ bv4294967293 32)) (_ bv0 32))) (bvult (_ bv5 32) |linear_search_#in~n|) (not (bvult (_ bv7 32) |linear_search_#in~n|)))} {3610#(and (exists ((|v_main_#t~nondet3_16| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_16| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} #51#return; {3591#false} is VALID [2018-11-23 11:28:08,150 INFO L256 TraceCheckUtils]: 35: Hoare triple {3591#false} call __VERIFIER_assert(#t~ret4); {3591#false} is VALID [2018-11-23 11:28:08,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {3591#false} ~cond := #in~cond; {3591#false} is VALID [2018-11-23 11:28:08,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {3591#false} assume 0bv32 == ~cond; {3591#false} is VALID [2018-11-23 11:28:08,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {3591#false} assume !false; {3591#false} is VALID [2018-11-23 11:28:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:08,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:08,623 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-23 11:28:12,542 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:28:12,923 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:28:13,364 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:28:13,820 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:28:14,265 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:28:14,753 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:28:16,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {3591#false} assume !false; {3591#false} is VALID [2018-11-23 11:28:16,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {3591#false} assume 0bv32 == ~cond; {3591#false} is VALID [2018-11-23 11:28:16,832 INFO L273 TraceCheckUtils]: 36: Hoare triple {3591#false} ~cond := #in~cond; {3591#false} is VALID [2018-11-23 11:28:16,832 INFO L256 TraceCheckUtils]: 35: Hoare triple {3591#false} call __VERIFIER_assert(#t~ret4); {3591#false} is VALID [2018-11-23 11:28:16,842 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} {3737#(or (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (bvult (_ bv7 32) ~SIZE~0) (not (bvult (_ bv5 32) ~SIZE~0)))} #51#return; {3591#false} is VALID [2018-11-23 11:28:16,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume true; {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:28:16,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !~bvult32(~j~0, ~SIZE~0);#res := 0bv32; {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:28:16,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:28:16,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {3754#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} assume !#t~short1; {3741#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)))} is VALID [2018-11-23 11:28:16,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {3758#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} #t~short1 := ~bvult32(~j~0, ~n); {3754#(or (not (= ~SIZE~0 |linear_search_#in~n|)) (and (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32)))))) (not (= (_ bv3 32) |linear_search_#in~q|)) |linear_search_#t~short1|)} is VALID [2018-11-23 11:28:16,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {3762#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3758#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult linear_search_~j~0 linear_search_~n)))} is VALID [2018-11-23 11:28:16,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {3762#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3762#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|))))} is VALID [2018-11-23 11:28:16,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {3762#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|))))} #t~short1 := ~bvult32(~j~0, ~n); {3762#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|))))} is VALID [2018-11-23 11:28:16,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3762#(and (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|))))} is VALID [2018-11-23 11:28:16,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {3776#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not |linear_search_#t~short1|))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3772#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|))))} is VALID [2018-11-23 11:28:16,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {3780#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3776#(or (and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)))) (not |linear_search_#t~short1|))} is VALID [2018-11-23 11:28:16,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {3784#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3780#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult linear_search_~j~0 linear_search_~n))))} is VALID [2018-11-23 11:28:16,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {3784#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3784#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:16,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {3784#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3784#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:17,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {3794#(or (and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (not |linear_search_#t~short1|))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3784#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:17,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {3798#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3794#(or (and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n)) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (not |linear_search_#t~short1|))} is VALID [2018-11-23 11:28:17,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {3802#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} #t~short1 := ~bvult32(~j~0, ~n); {3798#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not |linear_search_#t~short1|) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} is VALID [2018-11-23 11:28:18,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {3806#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3802#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n) (not (bvult linear_search_~j~0 linear_search_~n)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0))))))} is VALID [2018-11-23 11:28:18,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {3806#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3806#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:18,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {3806#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3806#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:19,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {3816#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3806#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv4 32))) linear_search_~q) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv1 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:19,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {3816#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3816#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:19,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {3816#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))))} #t~short1 := ~bvult32(~j~0, ~n); {3816#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:21,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {3826#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3816#(and (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))) (or (not (bvult (bvadd linear_search_~j~0 (_ bv2 32)) linear_search_~n)) (not (= ~SIZE~0 |linear_search_#in~n|)) (= linear_search_~q (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv8 32)))) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (bvult (bvadd linear_search_~j~0 (_ bv6 32)) linear_search_~n) (not (bvult (bvadd linear_search_~j~0 (_ bv4 32)) linear_search_~n))))} is VALID [2018-11-23 11:28:21,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {3826#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)))} assume #t~short1;call #t~mem0 := read~intINTTYPE4(~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);#t~short1 := #t~mem0 != ~q; {3826#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)))} is VALID [2018-11-23 11:28:21,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {3826#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)))} #t~short1 := ~bvult32(~j~0, ~n); {3826#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)))} is VALID [2018-11-23 11:28:21,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {3590#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0bv32; {3826#(and (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (= (_ bv3 32) (select (select |#memory_int| |linear_search_#in~a.base|) (bvadd |linear_search_#in~a.offset| (_ bv12 32))))) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (bvult (_ bv5 32) ~SIZE~0) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)) (or (not (= ~SIZE~0 |linear_search_#in~n|)) (not (bvult (bvadd linear_search_~j~0 (_ bv5 32)) linear_search_~n)) (bvult (bvadd linear_search_~j~0 (_ bv7 32)) linear_search_~n) (not (bvult (_ bv7 32) ~SIZE~0)) (not (= (_ bv3 32) |linear_search_#in~q|)) (not (bvult (bvadd linear_search_~j~0 (_ bv3 32)) linear_search_~n)) (= (select (select |#memory_int| linear_search_~a.base) (bvadd linear_search_~a.offset (bvmul (_ bv4 32) linear_search_~j~0) (_ bv12 32))) linear_search_~q)))} is VALID [2018-11-23 11:28:21,357 INFO L256 TraceCheckUtils]: 6: Hoare triple {3737#(or (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (bvult (_ bv7 32) ~SIZE~0) (not (bvult (_ bv5 32) ~SIZE~0)))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, ~SIZE~0, 3bv32); {3590#true} is VALID [2018-11-23 11:28:21,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {3590#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {3737#(or (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (bvult (_ bv7 32) ~SIZE~0) (not (bvult (_ bv5 32) ~SIZE~0)))} is VALID [2018-11-23 11:28:21,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {3590#true} call #t~ret5 := main(); {3590#true} is VALID [2018-11-23 11:28:21,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3590#true} {3590#true} #47#return; {3590#true} is VALID [2018-11-23 11:28:21,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-23 11:28:21,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {3590#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3590#true} is VALID [2018-11-23 11:28:21,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {3590#true} call ULTIMATE.init(); {3590#true} is VALID [2018-11-23 11:28:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:21,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:21,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-11-23 11:28:21,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-11-23 11:28:21,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:21,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:28:26,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:26,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:28:26,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:28:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:28:26,194 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 33 states. [2018-11-23 11:28:30,702 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-11-23 11:28:32,916 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-11-23 11:28:34,027 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-11-23 11:28:34,781 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-23 11:28:35,449 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-23 11:28:36,323 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-23 11:28:37,600 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-23 11:28:39,835 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:28:41,059 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:28:42,138 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:28:42,665 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:28:43,049 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:28:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:44,182 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-23 11:28:44,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:28:44,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-11-23 11:28:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:28:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 84 transitions. [2018-11-23 11:28:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:28:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 84 transitions. [2018-11-23 11:28:44,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 84 transitions. [2018-11-23 11:28:44,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:44,856 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:28:44,856 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:28:44,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=316, Invalid=1846, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:28:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:28:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2018-11-23 11:28:45,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:45,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 43 states. [2018-11-23 11:28:45,597 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 43 states. [2018-11-23 11:28:45,597 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 43 states. [2018-11-23 11:28:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:45,598 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 11:28:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:28:45,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:45,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:45,599 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 56 states. [2018-11-23 11:28:45,599 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 56 states. [2018-11-23 11:28:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:45,601 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 11:28:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:28:45,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:45,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:45,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:45,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:28:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 11:28:45,603 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2018-11-23 11:28:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:45,603 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 11:28:45,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:28:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 11:28:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:28:45,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:45,604 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:45,605 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:45,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1202019913, now seen corresponding path program 8 times [2018-11-23 11:28:45,605 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:45,605 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:45,627 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:28:45,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:28:45,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:28:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:45,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:45,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 11:28:45,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:28:45,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:28:45,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:28:45,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:28:45,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:28:46,811 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:28:47,519 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:28:48,412 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:28:48,839 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-11-23 11:28:49,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4182#true} is VALID [2018-11-23 11:28:49,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {4182#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4182#true} is VALID [2018-11-23 11:28:49,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2018-11-23 11:28:49,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #47#return; {4182#true} is VALID [2018-11-23 11:28:49,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret5 := main(); {4182#true} is VALID [2018-11-23 11:28:49,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {4182#true} ~SIZE~0 := ~bvadd32(1bv32, ~bvudiv32(#t~nondet3, 8bv32));havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call write~intINTTYPE4(3bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvudiv32(~SIZE~0, 2bv32))), 4bv32); {4202#(and (exists ((|v_main_#t~nondet3_18| (_ BitVec 32))) (= (bvadd ~SIZE~0 (_ bv4294967295 32)) (bvudiv |v_main_#t~nondet3_18| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) (bvudiv ~SIZE~0 (_ bv2 32))) |main_~#a~0.offset|))))} is VALID