./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:06:04,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:06:04,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:06:04,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:06:04,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:06:04,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:06:04,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:06:04,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:06:04,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:06:04,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:06:04,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:06:04,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:06:04,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:06:04,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:06:04,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:06:04,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:06:04,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:06:04,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:06:04,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:06:04,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:06:04,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:06:04,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:06:04,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:06:04,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:06:04,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:06:04,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:06:04,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:06:04,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:06:04,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:06:04,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:06:04,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:06:04,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:06:04,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:06:04,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:06:04,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:06:04,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:06:04,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:06:04,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:06:04,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:06:04,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:06:04,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:06:04,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:06:04,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:06:04,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:06:04,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:06:04,314 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:06:04,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:06:04,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:06:04,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:06:04,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:06:04,316 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:06:04,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:06:04,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:06:04,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:06:04,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:06:04,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:06:04,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:06:04,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:06:04,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:06:04,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:06:04,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:06:04,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:06:04,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:06:04,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:06:04,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:06:04,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:06:04,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:06:04,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:06:04,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:06:04,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 [2022-02-20 17:06:04,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:06:04,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:06:04,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:06:04,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:06:04,538 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:06:04,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-02-20 17:06:04,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429283310/8ab176c44e484a55ae78a18e21d3f7f0/FLAGad3d7cb7b [2022-02-20 17:06:04,981 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:06:04,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-02-20 17:06:04,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429283310/8ab176c44e484a55ae78a18e21d3f7f0/FLAGad3d7cb7b [2022-02-20 17:06:05,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429283310/8ab176c44e484a55ae78a18e21d3f7f0 [2022-02-20 17:06:05,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:06:05,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:06:05,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:06:05,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:06:05,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:06:05,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19bf3b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05, skipping insertion in model container [2022-02-20 17:06:05,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:06:05,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:06:05,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-02-20 17:06:05,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:06:05,256 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:06:05,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-02-20 17:06:05,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:06:05,329 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:06:05,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05 WrapperNode [2022-02-20 17:06:05,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:06:05,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:06:05,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:06:05,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:06:05,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,407 INFO L137 Inliner]: procedures = 36, calls = 627, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 496 [2022-02-20 17:06:05,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:06:05,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:06:05,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:06:05,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:06:05,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:06:05,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:06:05,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:06:05,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:06:05,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (1/1) ... [2022-02-20 17:06:05,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:06:05,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:05,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:06:05,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:06:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:06:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 17:06:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 17:06:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 17:06:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure smp_send_req [2022-02-20 17:06:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 17:06:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 17:06:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:06:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 17:06:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:06:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:06:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:06:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:06:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 17:06:05,645 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:06:05,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:06:06,093 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:06:06,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:06:06,099 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:06:06,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:06:06 BoogieIcfgContainer [2022-02-20 17:06:06,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:06:06,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:06:06,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:06:06,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:06:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:06:05" (1/3) ... [2022-02-20 17:06:06,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@937c91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:06:06, skipping insertion in model container [2022-02-20 17:06:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:06:05" (2/3) ... [2022-02-20 17:06:06,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@937c91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:06:06, skipping insertion in model container [2022-02-20 17:06:06,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:06:06" (3/3) ... [2022-02-20 17:06:06,106 INFO L111 eAbstractionObserver]: Analyzing ICFG discover_list.c [2022-02-20 17:06:06,109 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:06:06,109 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:06:06,149 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:06:06,157 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:06:06,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:06:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 64 states have internal predecessors, (97), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:06:06,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:06,183 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:06,183 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:06,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash 611198103, now seen corresponding path program 1 times [2022-02-20 17:06:06,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:06,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741856919] [2022-02-20 17:06:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:06,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {78#true} is VALID [2022-02-20 17:06:06,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {78#true} is VALID [2022-02-20 17:06:06,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78#true} is VALID [2022-02-20 17:06:06,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78#true} {79#false} #232#return; {79#false} is VALID [2022-02-20 17:06:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 17:06:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:06,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {78#true} is VALID [2022-02-20 17:06:06,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {78#true} is VALID [2022-02-20 17:06:06,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78#true} is VALID [2022-02-20 17:06:06,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78#true} {79#false} #234#return; {79#false} is VALID [2022-02-20 17:06:06,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {78#true} is VALID [2022-02-20 17:06:06,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {78#true} is VALID [2022-02-20 17:06:06,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {78#true} is VALID [2022-02-20 17:06:06,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {78#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {80#(= |ULTIMATE.start_do_discover_list_#t~mem152#1| (select (select |#memory_int| |ULTIMATE.start_do_discover_list_~op#1.base|) (+ |ULTIMATE.start_do_discover_list_~op#1.offset| 8)))} is VALID [2022-02-20 17:06:06,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {80#(= |ULTIMATE.start_do_discover_list_#t~mem152#1| (select (select |#memory_int| |ULTIMATE.start_do_discover_list_~op#1.base|) (+ |ULTIMATE.start_do_discover_list_~op#1.offset| 8)))} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {81#(= (select (select |#memory_int| |ULTIMATE.start_do_discover_list_~op#1.base|) (+ |ULTIMATE.start_do_discover_list_~op#1.offset| 8)) 0)} is VALID [2022-02-20 17:06:06,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#(= (select (select |#memory_int| |ULTIMATE.start_do_discover_list_~op#1.base|) (+ |ULTIMATE.start_do_discover_list_~op#1.offset| 8)) 0)} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {82#(= |ULTIMATE.start_do_discover_list_#t~mem153#1| 0)} is VALID [2022-02-20 17:06:06,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {82#(= |ULTIMATE.start_do_discover_list_#t~mem153#1| 0)} assume 1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40;havoc do_discover_list_#t~mem153#1;do_discover_list_~mnum_desc~0#1 := 40; {79#false} is VALID [2022-02-20 17:06:06,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {79#false} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {79#false} is VALID [2022-02-20 17:06:06,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {79#false} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {79#false} is VALID [2022-02-20 17:06:06,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {79#false} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {79#false} is VALID [2022-02-20 17:06:06,499 INFO L272 TraceCheckUtils]: 10: Hoare triple {79#false} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {91#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:06,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {78#true} is VALID [2022-02-20 17:06:06,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {78#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {78#true} is VALID [2022-02-20 17:06:06,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {78#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78#true} is VALID [2022-02-20 17:06:06,499 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {78#true} {79#false} #232#return; {79#false} is VALID [2022-02-20 17:06:06,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {79#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {79#false} is VALID [2022-02-20 17:06:06,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {79#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {79#false} is VALID [2022-02-20 17:06:06,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {79#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {79#false} is VALID [2022-02-20 17:06:06,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {79#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {79#false} is VALID [2022-02-20 17:06:06,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {79#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {79#false} is VALID [2022-02-20 17:06:06,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {79#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {79#false} is VALID [2022-02-20 17:06:06,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {79#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {79#false} is VALID [2022-02-20 17:06:06,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {79#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {79#false} is VALID [2022-02-20 17:06:06,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {79#false} assume do_discover_list_#t~short172#1; {79#false} is VALID [2022-02-20 17:06:06,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {79#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {79#false} is VALID [2022-02-20 17:06:06,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {79#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {79#false} is VALID [2022-02-20 17:06:06,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {79#false} assume !(dStrHex_~len#1 <= 0); {79#false} is VALID [2022-02-20 17:06:06,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {79#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {91#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:06,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {91#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {78#true} is VALID [2022-02-20 17:06:06,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {78#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {78#true} is VALID [2022-02-20 17:06:06,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {78#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78#true} is VALID [2022-02-20 17:06:06,503 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {78#true} {79#false} #234#return; {79#false} is VALID [2022-02-20 17:06:06,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {79#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {79#false} is VALID [2022-02-20 17:06:06,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {79#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {79#false} is VALID [2022-02-20 17:06:06,503 INFO L272 TraceCheckUtils]: 34: Hoare triple {79#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {79#false} is VALID [2022-02-20 17:06:06,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {79#false} ~cond := #in~cond; {79#false} is VALID [2022-02-20 17:06:06,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {79#false} assume 0 == ~cond; {79#false} is VALID [2022-02-20 17:06:06,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {79#false} assume !false; {79#false} is VALID [2022-02-20 17:06:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:06:06,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:06,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741856919] [2022-02-20 17:06:06,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741856919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:06:06,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:06:06,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:06:06,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206416549] [2022-02-20 17:06:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:06:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-02-20 17:06:06,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:06:06,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:06:06,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:06,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:06:06,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:06:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:06:06,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:06:06,569 INFO L87 Difference]: Start difference. First operand has 75 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 64 states have internal predecessors, (97), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:06:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:07,187 INFO L93 Difference]: Finished difference Result 149 states and 231 transitions. [2022-02-20 17:06:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:06:07,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-02-20 17:06:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:06:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:06:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2022-02-20 17:06:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:06:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2022-02-20 17:06:07,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 231 transitions. [2022-02-20 17:06:07,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:07,434 INFO L225 Difference]: With dead ends: 149 [2022-02-20 17:06:07,437 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 17:06:07,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:06:07,445 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 9 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:06:07,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 365 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:06:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 17:06:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2022-02-20 17:06:07,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:06:07,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:07,481 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:07,482 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:07,494 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2022-02-20 17:06:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2022-02-20 17:06:07,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:07,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:07,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 68 states. [2022-02-20 17:06:07,497 INFO L87 Difference]: Start difference. First operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 68 states. [2022-02-20 17:06:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:07,507 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2022-02-20 17:06:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2022-02-20 17:06:07,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:07,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:07,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:06:07,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:06:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-02-20 17:06:07,519 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 38 [2022-02-20 17:06:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:06:07,519 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-02-20 17:06:07,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:06:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-02-20 17:06:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:06:07,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:07,523 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:07,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:06:07,523 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:07,524 INFO L85 PathProgramCache]: Analyzing trace with hash 885957717, now seen corresponding path program 1 times [2022-02-20 17:06:07,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:07,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715362106] [2022-02-20 17:06:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:07,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {505#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:07,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:07,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:07,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} {494#true} #232#return; {495#false} is VALID [2022-02-20 17:06:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 17:06:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:07,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {494#true} is VALID [2022-02-20 17:06:07,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {494#true} is VALID [2022-02-20 17:06:07,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {494#true} is VALID [2022-02-20 17:06:07,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {494#true} {495#false} #234#return; {495#false} is VALID [2022-02-20 17:06:07,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {494#true} is VALID [2022-02-20 17:06:07,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {494#true} is VALID [2022-02-20 17:06:07,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {494#true} is VALID [2022-02-20 17:06:07,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {494#true} is VALID [2022-02-20 17:06:07,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {494#true} is VALID [2022-02-20 17:06:07,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {494#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {494#true} is VALID [2022-02-20 17:06:07,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {494#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {494#true} is VALID [2022-02-20 17:06:07,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {494#true} is VALID [2022-02-20 17:06:07,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {494#true} is VALID [2022-02-20 17:06:07,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {494#true} is VALID [2022-02-20 17:06:07,768 INFO L272 TraceCheckUtils]: 10: Hoare triple {494#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {504#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:07,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {505#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:07,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {505#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:07,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:07,770 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {506#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} {494#true} #232#return; {495#false} is VALID [2022-02-20 17:06:07,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {495#false} is VALID [2022-02-20 17:06:07,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {495#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {495#false} is VALID [2022-02-20 17:06:07,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {495#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {495#false} is VALID [2022-02-20 17:06:07,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {495#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {495#false} is VALID [2022-02-20 17:06:07,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {495#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {495#false} is VALID [2022-02-20 17:06:07,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {495#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {495#false} is VALID [2022-02-20 17:06:07,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {495#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {495#false} is VALID [2022-02-20 17:06:07,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {495#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {495#false} is VALID [2022-02-20 17:06:07,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {495#false} assume do_discover_list_#t~short172#1; {495#false} is VALID [2022-02-20 17:06:07,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {495#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {495#false} is VALID [2022-02-20 17:06:07,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {495#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {495#false} is VALID [2022-02-20 17:06:07,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {495#false} assume !(dStrHex_~len#1 <= 0); {495#false} is VALID [2022-02-20 17:06:07,773 INFO L272 TraceCheckUtils]: 27: Hoare triple {495#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {504#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:07,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {504#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {494#true} is VALID [2022-02-20 17:06:07,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {494#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {494#true} is VALID [2022-02-20 17:06:07,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {494#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {494#true} is VALID [2022-02-20 17:06:07,773 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {494#true} {495#false} #234#return; {495#false} is VALID [2022-02-20 17:06:07,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {495#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {495#false} is VALID [2022-02-20 17:06:07,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {495#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {495#false} is VALID [2022-02-20 17:06:07,774 INFO L272 TraceCheckUtils]: 34: Hoare triple {495#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {495#false} is VALID [2022-02-20 17:06:07,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {495#false} ~cond := #in~cond; {495#false} is VALID [2022-02-20 17:06:07,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {495#false} assume 0 == ~cond; {495#false} is VALID [2022-02-20 17:06:07,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {495#false} assume !false; {495#false} is VALID [2022-02-20 17:06:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:06:07,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:07,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715362106] [2022-02-20 17:06:07,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715362106] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:06:07,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034406803] [2022-02-20 17:06:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:07,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:07,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:06:07,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:06:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:06:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:08,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {494#true} is VALID [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {494#true} is VALID [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {494#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {494#true} is VALID [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {494#true} is VALID [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {494#true} is VALID [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {494#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {494#true} is VALID [2022-02-20 17:06:08,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {494#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {494#true} is VALID [2022-02-20 17:06:08,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {494#true} is VALID [2022-02-20 17:06:08,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {494#true} is VALID [2022-02-20 17:06:08,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {494#true} is VALID [2022-02-20 17:06:08,420 INFO L272 TraceCheckUtils]: 10: Hoare triple {494#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {494#true} is VALID [2022-02-20 17:06:08,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {494#true} #t~loopctr188 := 0; {505#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:08,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {505#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {546#(< 0 (+ (div (- (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967296) 1))} is VALID [2022-02-20 17:06:08,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#(< 0 (+ (div (- (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967296) 1))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {546#(< 0 (+ (div (- (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967296) 1))} is VALID [2022-02-20 17:06:08,423 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {546#(< 0 (+ (div (- (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967296) 1))} {494#true} #232#return; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {495#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {495#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {495#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {495#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {495#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {495#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {495#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {495#false} is VALID [2022-02-20 17:06:08,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {495#false} assume do_discover_list_#t~short172#1; {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {495#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {495#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {495#false} assume !(dStrHex_~len#1 <= 0); {495#false} is VALID [2022-02-20 17:06:08,424 INFO L272 TraceCheckUtils]: 27: Hoare triple {495#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {495#false} #t~loopctr188 := 0; {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {495#false} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {495#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {495#false} is VALID [2022-02-20 17:06:08,424 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {495#false} {495#false} #234#return; {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {495#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {495#false} is VALID [2022-02-20 17:06:08,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {495#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {495#false} is VALID [2022-02-20 17:06:08,424 INFO L272 TraceCheckUtils]: 34: Hoare triple {495#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {495#false} is VALID [2022-02-20 17:06:08,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {495#false} ~cond := #in~cond; {495#false} is VALID [2022-02-20 17:06:08,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {495#false} assume 0 == ~cond; {495#false} is VALID [2022-02-20 17:06:08,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {495#false} assume !false; {495#false} is VALID [2022-02-20 17:06:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:06:08,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:06:08,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034406803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:06:08,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:06:08,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-02-20 17:06:08,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181951980] [2022-02-20 17:06:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:06:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-02-20 17:06:08,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:06:08,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:06:08,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:08,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:06:08,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:06:08,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:06:08,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:06:08,466 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:06:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:08,660 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2022-02-20 17:06:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:06:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-02-20 17:06:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:06:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:06:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-02-20 17:06:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:06:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-02-20 17:06:08,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2022-02-20 17:06:08,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:08,787 INFO L225 Difference]: With dead ends: 118 [2022-02-20 17:06:08,787 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 17:06:08,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:06:08,789 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:06:08,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:06:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 17:06:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-20 17:06:08,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:06:08,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:08,800 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:08,800 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:08,803 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-02-20 17:06:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-02-20 17:06:08,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:08,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:08,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-02-20 17:06:08,807 INFO L87 Difference]: Start difference. First operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-02-20 17:06:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:08,813 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-02-20 17:06:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-02-20 17:06:08,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:08,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:08,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:06:08,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:06:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-02-20 17:06:08,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 38 [2022-02-20 17:06:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:06:08,818 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-02-20 17:06:08,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:06:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-02-20 17:06:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:06:08,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:08,821 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:08,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:06:09,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:09,036 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash 430601657, now seen corresponding path program 1 times [2022-02-20 17:06:09,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:09,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093034488] [2022-02-20 17:06:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:09,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {991#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:09,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {993#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (<= |#Ultimate.C_memset_#t~loopctr188| 1) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))))} is VALID [2022-02-20 17:06:09,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {993#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (<= |#Ultimate.C_memset_#t~loopctr188| 1) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:09,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:09,287 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {979#true} #232#return; {980#false} is VALID [2022-02-20 17:06:09,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:06:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:09,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {991#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {979#true} is VALID [2022-02-20 17:06:09,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {979#true} is VALID [2022-02-20 17:06:09,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {979#true} is VALID [2022-02-20 17:06:09,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {979#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {979#true} is VALID [2022-02-20 17:06:09,301 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {979#true} {980#false} #234#return; {980#false} is VALID [2022-02-20 17:06:09,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {979#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {979#true} is VALID [2022-02-20 17:06:09,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {979#true} is VALID [2022-02-20 17:06:09,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {979#true} is VALID [2022-02-20 17:06:09,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {979#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:09,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {979#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {979#true} is VALID [2022-02-20 17:06:09,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:09,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {979#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {979#true} is VALID [2022-02-20 17:06:09,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {979#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:09,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {979#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {979#true} is VALID [2022-02-20 17:06:09,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {979#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {979#true} is VALID [2022-02-20 17:06:09,304 INFO L272 TraceCheckUtils]: 10: Hoare triple {979#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {991#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:09,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {991#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:09,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {993#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (<= |#Ultimate.C_memset_#t~loopctr188| 1) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))))} is VALID [2022-02-20 17:06:09,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {993#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (<= |#Ultimate.C_memset_#t~loopctr188| 1) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:09,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:09,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {994#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {979#true} #232#return; {980#false} is VALID [2022-02-20 17:06:09,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {980#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {980#false} is VALID [2022-02-20 17:06:09,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {980#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {980#false} is VALID [2022-02-20 17:06:09,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {980#false} is VALID [2022-02-20 17:06:09,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {980#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {980#false} is VALID [2022-02-20 17:06:09,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {980#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {980#false} is VALID [2022-02-20 17:06:09,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {980#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {980#false} is VALID [2022-02-20 17:06:09,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {980#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {980#false} is VALID [2022-02-20 17:06:09,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {980#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {980#false} is VALID [2022-02-20 17:06:09,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {980#false} assume do_discover_list_#t~short172#1; {980#false} is VALID [2022-02-20 17:06:09,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {980#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {980#false} is VALID [2022-02-20 17:06:09,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {980#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {980#false} is VALID [2022-02-20 17:06:09,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {980#false} assume !(dStrHex_~len#1 <= 0); {980#false} is VALID [2022-02-20 17:06:09,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {980#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {991#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:09,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {991#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {979#true} is VALID [2022-02-20 17:06:09,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {979#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {979#true} is VALID [2022-02-20 17:06:09,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {979#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {979#true} is VALID [2022-02-20 17:06:09,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {979#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {979#true} is VALID [2022-02-20 17:06:09,321 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {979#true} {980#false} #234#return; {980#false} is VALID [2022-02-20 17:06:09,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {980#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {980#false} is VALID [2022-02-20 17:06:09,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {980#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {980#false} is VALID [2022-02-20 17:06:09,321 INFO L272 TraceCheckUtils]: 36: Hoare triple {980#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {980#false} is VALID [2022-02-20 17:06:09,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {980#false} ~cond := #in~cond; {980#false} is VALID [2022-02-20 17:06:09,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {980#false} assume 0 == ~cond; {980#false} is VALID [2022-02-20 17:06:09,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {980#false} assume !false; {980#false} is VALID [2022-02-20 17:06:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:06:09,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:09,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093034488] [2022-02-20 17:06:09,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093034488] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:06:09,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354536069] [2022-02-20 17:06:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:09,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:09,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:06:09,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:06:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:09,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:06:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:09,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:06:10,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {979#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {979#true} is VALID [2022-02-20 17:06:10,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {979#true} is VALID [2022-02-20 17:06:10,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {979#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {979#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {979#true} is VALID [2022-02-20 17:06:10,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {979#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {979#true} is VALID [2022-02-20 17:06:10,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {979#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {979#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {979#true} is VALID [2022-02-20 17:06:10,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {979#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {979#true} is VALID [2022-02-20 17:06:10,068 INFO L272 TraceCheckUtils]: 10: Hoare triple {979#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {979#true} is VALID [2022-02-20 17:06:10,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {979#true} #t~loopctr188 := 0; {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:10,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {979#true} is VALID [2022-02-20 17:06:10,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {979#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {979#true} is VALID [2022-02-20 17:06:10,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {979#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {979#true} is VALID [2022-02-20 17:06:10,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {979#true} {979#true} #232#return; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#true} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#true} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {979#true} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {979#true} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {979#true} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {979#true} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {979#true} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {979#true} is VALID [2022-02-20 17:06:10,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {979#true} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {979#true} is VALID [2022-02-20 17:06:10,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {979#true} assume do_discover_list_#t~short172#1; {979#true} is VALID [2022-02-20 17:06:10,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {979#true} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {979#true} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {979#true} is VALID [2022-02-20 17:06:10,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {979#true} assume !(dStrHex_~len#1 <= 0); {979#true} is VALID [2022-02-20 17:06:10,073 INFO L272 TraceCheckUtils]: 28: Hoare triple {979#true} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {979#true} is VALID [2022-02-20 17:06:10,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {979#true} #t~loopctr188 := 0; {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:10,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {992#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1088#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:10,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {1088#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1092#(< (div (+ (- 4294967297) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967297) 4294967296) 1))} is VALID [2022-02-20 17:06:10,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {1092#(< (div (+ (- 4294967297) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967297) 4294967296) 1))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1092#(< (div (+ (- 4294967297) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967297) 4294967296) 1))} is VALID [2022-02-20 17:06:10,080 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1092#(< (div (+ (- 4294967297) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4294967297) 4294967296) 1))} {979#true} #234#return; {980#false} is VALID [2022-02-20 17:06:10,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {980#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {980#false} is VALID [2022-02-20 17:06:10,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {980#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {980#false} is VALID [2022-02-20 17:06:10,080 INFO L272 TraceCheckUtils]: 36: Hoare triple {980#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {980#false} is VALID [2022-02-20 17:06:10,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {980#false} ~cond := #in~cond; {980#false} is VALID [2022-02-20 17:06:10,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {980#false} assume 0 == ~cond; {980#false} is VALID [2022-02-20 17:06:10,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {980#false} assume !false; {980#false} is VALID [2022-02-20 17:06:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:06:10,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:06:10,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {980#false} assume !false; {980#false} is VALID [2022-02-20 17:06:10,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {980#false} assume 0 == ~cond; {980#false} is VALID [2022-02-20 17:06:10,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {980#false} ~cond := #in~cond; {980#false} is VALID [2022-02-20 17:06:10,266 INFO L272 TraceCheckUtils]: 36: Hoare triple {980#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {980#false} is VALID [2022-02-20 17:06:10,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {980#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {980#false} is VALID [2022-02-20 17:06:10,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {980#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {980#false} is VALID [2022-02-20 17:06:10,268 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1138#(not (= |#Ultimate.C_memset_#amount| 80))} {979#true} #234#return; {980#false} is VALID [2022-02-20 17:06:10,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {1138#(not (= |#Ultimate.C_memset_#amount| 80))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1138#(not (= |#Ultimate.C_memset_#amount| 80))} is VALID [2022-02-20 17:06:10,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {1145#(or (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1138#(not (= |#Ultimate.C_memset_#amount| 80))} is VALID [2022-02-20 17:06:10,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {1149#(or (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (not (= |#Ultimate.C_memset_#amount| 80)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1145#(or (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} is VALID [2022-02-20 17:06:10,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {979#true} #t~loopctr188 := 0; {1149#(or (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (not (= |#Ultimate.C_memset_#amount| 80)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:10,270 INFO L272 TraceCheckUtils]: 28: Hoare triple {979#true} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {979#true} is VALID [2022-02-20 17:06:10,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {979#true} assume !(dStrHex_~len#1 <= 0); {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {979#true} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {979#true} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {979#true} assume do_discover_list_#t~short172#1; {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {979#true} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {979#true} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {979#true} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {979#true} is VALID [2022-02-20 17:06:10,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {979#true} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {979#true} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {979#true} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#true} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#true} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {979#true} is VALID [2022-02-20 17:06:10,272 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {979#true} {979#true} #232#return; {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {979#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {979#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {979#true} is VALID [2022-02-20 17:06:10,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {979#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {979#true} #t~loopctr188 := 0; {979#true} is VALID [2022-02-20 17:06:10,273 INFO L272 TraceCheckUtils]: 10: Hoare triple {979#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {979#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {979#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {979#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {979#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {979#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {979#true} is VALID [2022-02-20 17:06:10,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {979#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {979#true} is VALID [2022-02-20 17:06:10,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {979#true} is VALID [2022-02-20 17:06:10,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {979#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {979#true} is VALID [2022-02-20 17:06:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:06:10,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354536069] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:06:10,275 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:06:10,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-20 17:06:10,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665238690] [2022-02-20 17:06:10,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:06:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-20 17:06:10,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:06:10,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:10,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:10,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:06:10,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:06:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:06:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:06:10,327 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:10,871 INFO L93 Difference]: Finished difference Result 128 states and 175 transitions. [2022-02-20 17:06:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:06:10,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-20 17:06:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:06:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-02-20 17:06:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-02-20 17:06:10,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 172 transitions. [2022-02-20 17:06:11,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:11,003 INFO L225 Difference]: With dead ends: 128 [2022-02-20 17:06:11,003 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 17:06:11,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:06:11,004 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:06:11,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 315 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:06:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 17:06:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 17:06:11,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:06:11,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:11,015 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:11,016 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:11,018 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-02-20 17:06:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-02-20 17:06:11,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:11,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:11,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 74 states. [2022-02-20 17:06:11,019 INFO L87 Difference]: Start difference. First operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 74 states. [2022-02-20 17:06:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:11,021 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-02-20 17:06:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-02-20 17:06:11,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:11,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:11,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:06:11,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:06:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-02-20 17:06:11,023 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 40 [2022-02-20 17:06:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:06:11,024 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-02-20 17:06:11,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-02-20 17:06:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 17:06:11,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:11,025 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:11,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:06:11,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:06:11,242 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1917005995, now seen corresponding path program 2 times [2022-02-20 17:06:11,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:11,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487572124] [2022-02-20 17:06:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:11,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {1672#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {1673#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:11,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1673#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1674#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:11,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1674#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1675#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 2)) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} is VALID [2022-02-20 17:06:11,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {1675#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 2)) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:11,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:11,385 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {1656#true} #232#return; {1657#false} is VALID [2022-02-20 17:06:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 17:06:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:11,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1672#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {1656#true} is VALID [2022-02-20 17:06:11,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1656#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1656#true} is VALID [2022-02-20 17:06:11,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1656#true} is VALID [2022-02-20 17:06:11,396 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1656#true} {1657#false} #234#return; {1657#false} is VALID [2022-02-20 17:06:11,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {1656#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {1656#true} is VALID [2022-02-20 17:06:11,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {1656#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {1656#true} is VALID [2022-02-20 17:06:11,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {1656#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {1656#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {1656#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1656#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {1656#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {1656#true} is VALID [2022-02-20 17:06:11,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {1656#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {1656#true} is VALID [2022-02-20 17:06:11,398 INFO L272 TraceCheckUtils]: 10: Hoare triple {1656#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {1672#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:11,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {1672#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {1673#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:11,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {1673#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1674#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:11,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {1674#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1675#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 2)) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} is VALID [2022-02-20 17:06:11,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {1675#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 2)) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:11,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:11,402 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1676#(or (<= |#Ultimate.C_memset_#amount| 2) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {1656#true} #232#return; {1657#false} is VALID [2022-02-20 17:06:11,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {1657#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {1657#false} is VALID [2022-02-20 17:06:11,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {1657#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {1657#false} is VALID [2022-02-20 17:06:11,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {1657#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {1657#false} is VALID [2022-02-20 17:06:11,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {1657#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {1657#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {1657#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {1657#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {1657#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {1657#false} assume do_discover_list_#t~short172#1; {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {1657#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {1657#false} is VALID [2022-02-20 17:06:11,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {1657#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {1657#false} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {1657#false} assume !(dStrHex_~len#1 <= 0); {1657#false} is VALID [2022-02-20 17:06:11,404 INFO L272 TraceCheckUtils]: 29: Hoare triple {1657#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {1672#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {1672#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {1656#true} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:11,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {1656#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1656#true} is VALID [2022-02-20 17:06:11,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {1656#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1656#true} is VALID [2022-02-20 17:06:11,405 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1656#true} {1657#false} #234#return; {1657#false} is VALID [2022-02-20 17:06:11,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {1657#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {1657#false} is VALID [2022-02-20 17:06:11,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {1657#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {1657#false} is VALID [2022-02-20 17:06:11,405 INFO L272 TraceCheckUtils]: 40: Hoare triple {1657#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {1657#false} is VALID [2022-02-20 17:06:11,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {1657#false} ~cond := #in~cond; {1657#false} is VALID [2022-02-20 17:06:11,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {1657#false} assume 0 == ~cond; {1657#false} is VALID [2022-02-20 17:06:11,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {1657#false} assume !false; {1657#false} is VALID [2022-02-20 17:06:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:06:11,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:11,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487572124] [2022-02-20 17:06:11,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487572124] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:06:11,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762126524] [2022-02-20 17:06:11,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:06:11,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:11,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:11,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:06:11,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:06:11,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:06:11,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:06:11,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:06:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:11,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:06:12,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {1656#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1656#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1656#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {1656#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {1656#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1656#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1656#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1656#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {1656#true} is VALID [2022-02-20 17:06:12,310 INFO L272 TraceCheckUtils]: 10: Hoare triple {1656#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {1656#true} is VALID [2022-02-20 17:06:12,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {1656#true} #t~loopctr188 := 0; {1673#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:12,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1673#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1674#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:12,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {1674#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1719#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:12,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {1719#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1723#(and (< 0 (+ (div (+ 2 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296) 1)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:12,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#(and (< 0 (+ (div (+ 2 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296) 1)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1723#(and (< 0 (+ (div (+ 2 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296) 1)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:12,319 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1723#(and (< 0 (+ (div (+ 2 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296) 1)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} {1656#true} #232#return; {1657#false} is VALID [2022-02-20 17:06:12,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {1657#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {1657#false} is VALID [2022-02-20 17:06:12,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {1657#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {1657#false} is VALID [2022-02-20 17:06:12,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {1657#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {1657#false} is VALID [2022-02-20 17:06:12,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1657#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {1657#false} is VALID [2022-02-20 17:06:12,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1657#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {1657#false} is VALID [2022-02-20 17:06:12,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {1657#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {1657#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {1657#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {1657#false} assume do_discover_list_#t~short172#1; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {1657#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {1657#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {1657#false} assume !(dStrHex_~len#1 <= 0); {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L272 TraceCheckUtils]: 29: Hoare triple {1657#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {1657#false} #t~loopctr188 := 0; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {1657#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {1657#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {1657#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {1657#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {1657#false} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {1657#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1657#false} {1657#false} #234#return; {1657#false} is VALID [2022-02-20 17:06:12,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {1657#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {1657#false} is VALID [2022-02-20 17:06:12,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {1657#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {1657#false} is VALID [2022-02-20 17:06:12,321 INFO L272 TraceCheckUtils]: 40: Hoare triple {1657#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {1657#false} is VALID [2022-02-20 17:06:12,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {1657#false} ~cond := #in~cond; {1657#false} is VALID [2022-02-20 17:06:12,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {1657#false} assume 0 == ~cond; {1657#false} is VALID [2022-02-20 17:06:12,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {1657#false} assume !false; {1657#false} is VALID [2022-02-20 17:06:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:06:12,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {1657#false} assume !false; {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {1657#false} assume 0 == ~cond; {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {1657#false} ~cond := #in~cond; {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L272 TraceCheckUtils]: 40: Hoare triple {1657#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {1657#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {1657#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1656#true} {1657#false} #234#return; {1657#false} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {1656#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1656#true} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {1656#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1656#true} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:12,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {1656#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1656#true} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {1656#true} #t~loopctr188 := 0; {1656#true} is VALID [2022-02-20 17:06:12,734 INFO L272 TraceCheckUtils]: 29: Hoare triple {1657#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {1656#true} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {1657#false} assume !(dStrHex_~len#1 <= 0); {1657#false} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {1657#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {1657#false} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {1657#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {1657#false} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {1657#false} assume do_discover_list_#t~short172#1; {1657#false} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1657#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {1657#false} is VALID [2022-02-20 17:06:12,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {1657#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {1657#false} is VALID [2022-02-20 17:06:12,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {1657#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {1657#false} is VALID [2022-02-20 17:06:12,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {1657#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {1657#false} is VALID [2022-02-20 17:06:12,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {1657#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {1657#false} is VALID [2022-02-20 17:06:12,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {1657#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {1657#false} is VALID [2022-02-20 17:06:12,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {1657#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {1657#false} is VALID [2022-02-20 17:06:12,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {1657#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {1657#false} is VALID [2022-02-20 17:06:12,739 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1895#(not (= |#Ultimate.C_memset_#amount| 24))} {1656#true} #232#return; {1657#false} is VALID [2022-02-20 17:06:12,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {1895#(not (= |#Ultimate.C_memset_#amount| 24))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1895#(not (= |#Ultimate.C_memset_#amount| 24))} is VALID [2022-02-20 17:06:12,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {1902#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {1895#(not (= |#Ultimate.C_memset_#amount| 24))} is VALID [2022-02-20 17:06:12,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1906#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1902#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:12,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1910#(or (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {1906#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {1656#true} #t~loopctr188 := 0; {1910#(or (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:12,742 INFO L272 TraceCheckUtils]: 10: Hoare triple {1656#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1656#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1656#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {1656#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {1656#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {1656#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1656#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {1656#true} is VALID [2022-02-20 17:06:12,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1656#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {1656#true} is VALID [2022-02-20 17:06:12,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {1656#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {1656#true} is VALID [2022-02-20 17:06:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:06:12,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762126524] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:06:12,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:06:12,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-02-20 17:06:12,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997834498] [2022-02-20 17:06:12,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:06:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-02-20 17:06:12,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:06:12,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:12,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:12,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:06:12,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:06:12,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:06:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:06:12,790 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:13,462 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2022-02-20 17:06:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:06:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-02-20 17:06:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:06:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 173 transitions. [2022-02-20 17:06:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 173 transitions. [2022-02-20 17:06:13,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 173 transitions. [2022-02-20 17:06:13,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:13,597 INFO L225 Difference]: With dead ends: 139 [2022-02-20 17:06:13,597 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:06:13,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:06:13,598 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:06:13,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 321 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:06:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:06:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 17:06:13,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:06:13,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:13,616 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:13,616 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:13,618 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-02-20 17:06:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-02-20 17:06:13,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:13,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:13,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 78 states. [2022-02-20 17:06:13,619 INFO L87 Difference]: Start difference. First operand has 78 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 78 states. [2022-02-20 17:06:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:13,621 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-02-20 17:06:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-02-20 17:06:13,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:13,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:13,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:06:13,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:06:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2022-02-20 17:06:13,623 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 44 [2022-02-20 17:06:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:06:13,623 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2022-02-20 17:06:13,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-02-20 17:06:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 17:06:13,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:13,624 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:13,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:06:13,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:13,846 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2100454571, now seen corresponding path program 3 times [2022-02-20 17:06:13,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:13,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591917640] [2022-02-20 17:06:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:14,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {2421#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {2422#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:14,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {2422#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2423#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:14,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {2423#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2424#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:14,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {2424#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2425#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:14,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {2425#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2426#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:14,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2426#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2427#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:14,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {2427#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2428#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 6)))} is VALID [2022-02-20 17:06:14,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 6)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:14,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:14,072 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {2401#true} #232#return; {2402#false} is VALID [2022-02-20 17:06:14,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 17:06:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:14,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {2421#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {2401#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {2401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2401#true} {2402#false} #234#return; {2402#false} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {2401#true} is VALID [2022-02-20 17:06:14,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:14,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {2401#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {2401#true} is VALID [2022-02-20 17:06:14,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {2401#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:14,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {2401#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {2401#true} is VALID [2022-02-20 17:06:14,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {2401#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:14,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {2401#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {2401#true} is VALID [2022-02-20 17:06:14,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2401#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {2401#true} is VALID [2022-02-20 17:06:14,083 INFO L272 TraceCheckUtils]: 10: Hoare triple {2401#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {2421#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:14,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {2421#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {2422#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:14,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {2422#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2423#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:14,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {2423#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2424#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:14,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {2424#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2425#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:14,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {2425#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2426#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:14,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {2426#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2427#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:14,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {2427#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2428#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 6)))} is VALID [2022-02-20 17:06:14,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {2428#(and (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr188| 6)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:14,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:14,089 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2429#(or (<= |#Ultimate.C_memset_#amount| 6) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {2401#true} #232#return; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {2402#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {2402#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {2402#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {2402#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {2402#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {2402#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {2402#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {2402#false} assume do_discover_list_#t~short172#1; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {2402#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {2402#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {2402#false} assume !(dStrHex_~len#1 <= 0); {2402#false} is VALID [2022-02-20 17:06:14,090 INFO L272 TraceCheckUtils]: 33: Hoare triple {2402#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {2421#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {2421#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {2401#true} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {2401#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2401#true} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {2401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2401#true} is VALID [2022-02-20 17:06:14,091 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2401#true} {2402#false} #234#return; {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {2402#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {2402#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L272 TraceCheckUtils]: 44: Hoare triple {2402#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {2402#false} ~cond := #in~cond; {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {2402#false} assume 0 == ~cond; {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {2402#false} assume !false; {2402#false} is VALID [2022-02-20 17:06:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:06:14,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:14,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591917640] [2022-02-20 17:06:14,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591917640] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:06:14,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178526152] [2022-02-20 17:06:14,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:06:14,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:14,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:06:14,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:06:15,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 17:06:15,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:06:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:06:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:15,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {2401#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2401#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {2401#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {2401#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {2401#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {2401#true} is VALID [2022-02-20 17:06:15,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {2401#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L272 TraceCheckUtils]: 10: Hoare triple {2401#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {2401#true} #t~loopctr188 := 0; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {2401#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {2401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2401#true} {2401#true} #232#return; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {2401#true} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {2401#true} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {2401#true} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {2401#true} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {2401#true} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {2401#true} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {2401#true} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {2401#true} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {2401#true} assume do_discover_list_#t~short172#1; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {2401#true} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {2401#true} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {2401#true} assume !(dStrHex_~len#1 <= 0); {2401#true} is VALID [2022-02-20 17:06:15,376 INFO L272 TraceCheckUtils]: 33: Hoare triple {2401#true} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {2401#true} is VALID [2022-02-20 17:06:15,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {2401#true} #t~loopctr188 := 0; {2422#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:15,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {2422#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2538#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:15,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {2538#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2542#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:15,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {2542#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2546#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3))} is VALID [2022-02-20 17:06:15,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {2546#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2550#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:15,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {2550#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2554#(< 0 (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4) 4294967296) 1))} is VALID [2022-02-20 17:06:15,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {2554#(< 0 (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4) 4294967296) 1))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2554#(< 0 (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4) 4294967296) 1))} is VALID [2022-02-20 17:06:15,387 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2554#(< 0 (+ (div (+ (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296)) 4) 4294967296) 1))} {2401#true} #234#return; {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {2402#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {2402#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L272 TraceCheckUtils]: 44: Hoare triple {2402#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {2402#false} ~cond := #in~cond; {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {2402#false} assume 0 == ~cond; {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {2402#false} assume !false; {2402#false} is VALID [2022-02-20 17:06:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 17:06:15,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:06:15,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {2402#false} assume !false; {2402#false} is VALID [2022-02-20 17:06:15,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {2402#false} assume 0 == ~cond; {2402#false} is VALID [2022-02-20 17:06:15,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {2402#false} ~cond := #in~cond; {2402#false} is VALID [2022-02-20 17:06:15,629 INFO L272 TraceCheckUtils]: 44: Hoare triple {2402#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {2402#false} is VALID [2022-02-20 17:06:15,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {2402#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {2402#false} is VALID [2022-02-20 17:06:15,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {2402#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {2402#false} is VALID [2022-02-20 17:06:15,630 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2600#(not (= |#Ultimate.C_memset_#amount| 80))} {2401#true} #234#return; {2402#false} is VALID [2022-02-20 17:06:15,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {2600#(not (= |#Ultimate.C_memset_#amount| 80))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2600#(not (= |#Ultimate.C_memset_#amount| 80))} is VALID [2022-02-20 17:06:15,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {2607#(or (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2600#(not (= |#Ultimate.C_memset_#amount| 80))} is VALID [2022-02-20 17:06:15,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {2611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2607#(or (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} is VALID [2022-02-20 17:06:15,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {2615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2611#(or (not (= |#Ultimate.C_memset_#amount| 80)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:15,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {2619#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2615#(or (not (= |#Ultimate.C_memset_#amount| 80)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:15,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {2623#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2619#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} is VALID [2022-02-20 17:06:15,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {2401#true} #t~loopctr188 := 0; {2623#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 80)))} is VALID [2022-02-20 17:06:15,634 INFO L272 TraceCheckUtils]: 33: Hoare triple {2401#true} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {2401#true} assume !(dStrHex_~len#1 <= 0); {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {2401#true} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {2401#true} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {2401#true} assume do_discover_list_#t~short172#1; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {2401#true} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {2401#true} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {2401#true} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {2401#true} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {2401#true} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {2401#true} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {2401#true} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2401#true} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2401#true} {2401#true} #232#return; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {2401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {2401#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {2401#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {2401#true} #t~loopctr188 := 0; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L272 TraceCheckUtils]: 10: Hoare triple {2401#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {2401#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {2401#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {2401#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {2401#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {2401#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {2401#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {2401#true} is VALID [2022-02-20 17:06:15,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {2401#true} is VALID [2022-02-20 17:06:15,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {2401#true} is VALID [2022-02-20 17:06:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 17:06:15,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178526152] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:06:15,637 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:06:15,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-02-20 17:06:15,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358641687] [2022-02-20 17:06:15,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:06:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-02-20 17:06:15,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:06:15,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:15,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:15,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 17:06:15,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:06:15,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 17:06:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:06:15,694 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:17,154 INFO L93 Difference]: Finished difference Result 152 states and 204 transitions. [2022-02-20 17:06:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 17:06:17,155 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-02-20 17:06:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:06:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 196 transitions. [2022-02-20 17:06:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 196 transitions. [2022-02-20 17:06:17,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 196 transitions. [2022-02-20 17:06:17,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:17,307 INFO L225 Difference]: With dead ends: 152 [2022-02-20 17:06:17,307 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 17:06:17,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=393, Invalid=1013, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 17:06:17,308 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 52 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:06:17,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 763 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:06:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 17:06:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-20 17:06:17,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:06:17,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:17,342 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:17,342 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:17,344 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2022-02-20 17:06:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-02-20 17:06:17,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:17,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:17,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 87 states. [2022-02-20 17:06:17,346 INFO L87 Difference]: Start difference. First operand has 87 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 87 states. [2022-02-20 17:06:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:17,347 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2022-02-20 17:06:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-02-20 17:06:17,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:17,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:17,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:06:17,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:06:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-02-20 17:06:17,350 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 48 [2022-02-20 17:06:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:06:17,350 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-02-20 17:06:17,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-02-20 17:06:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 17:06:17,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:17,351 INFO L514 BasicCegarLoop]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:17,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:06:17,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:17,560 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1661068933, now seen corresponding path program 4 times [2022-02-20 17:06:17,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:17,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977848467] [2022-02-20 17:06:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:17,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:17,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {3286#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {3287#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:17,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {3287#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3288#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:17,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {3288#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3289#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:17,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {3289#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3290#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:17,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {3290#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3291#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:17,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {3291#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3292#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:17,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {3292#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3293#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} is VALID [2022-02-20 17:06:17,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {3293#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3294#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 7) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} is VALID [2022-02-20 17:06:17,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {3294#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 7) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:17,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:17,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {3257#true} #232#return; {3258#false} is VALID [2022-02-20 17:06:17,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 17:06:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:17,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {3286#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {3257#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {3257#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3257#true} {3258#false} #234#return; {3258#false} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {3257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {3257#true} is VALID [2022-02-20 17:06:17,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {3257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {3257#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {3257#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {3257#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {3257#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {3257#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {3257#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {3257#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {3257#true} is VALID [2022-02-20 17:06:17,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {3257#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {3257#true} is VALID [2022-02-20 17:06:17,911 INFO L272 TraceCheckUtils]: 10: Hoare triple {3257#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {3286#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:17,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {3286#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {3287#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:17,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3287#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3288#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:17,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3288#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3289#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:17,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3290#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:17,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {3290#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3291#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:17,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {3291#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3292#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:17,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3293#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} is VALID [2022-02-20 17:06:17,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {3293#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3294#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 7) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} is VALID [2022-02-20 17:06:17,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {3294#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 7) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:17,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:17,918 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#(or (<= |#Ultimate.C_memset_#amount| 7) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {3257#true} #232#return; {3258#false} is VALID [2022-02-20 17:06:17,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {3258#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {3258#false} is VALID [2022-02-20 17:06:17,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {3258#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {3258#false} is VALID [2022-02-20 17:06:17,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {3258#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {3258#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {3258#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {3258#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {3258#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {3258#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {3258#false} assume do_discover_list_#t~short172#1; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {3258#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {3258#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {3258#false} is VALID [2022-02-20 17:06:17,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {3258#false} assume !(dStrHex_~len#1 <= 0); {3258#false} is VALID [2022-02-20 17:06:17,920 INFO L272 TraceCheckUtils]: 34: Hoare triple {3258#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {3286#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {3286#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {3257#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3257#true} is VALID [2022-02-20 17:06:17,921 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3257#true} {3258#false} #234#return; {3258#false} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {3258#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {3258#false} is VALID [2022-02-20 17:06:17,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {3258#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {3258#false} is VALID [2022-02-20 17:06:17,922 INFO L272 TraceCheckUtils]: 53: Hoare triple {3258#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {3258#false} is VALID [2022-02-20 17:06:17,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {3258#false} ~cond := #in~cond; {3258#false} is VALID [2022-02-20 17:06:17,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {3258#false} assume 0 == ~cond; {3258#false} is VALID [2022-02-20 17:06:17,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {3258#false} assume !false; {3258#false} is VALID [2022-02-20 17:06:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-20 17:06:17,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:17,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977848467] [2022-02-20 17:06:17,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977848467] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:06:17,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586317319] [2022-02-20 17:06:17,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:06:17,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:17,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:06:17,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:06:18,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:06:18,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:06:18,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:06:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:18,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:06:19,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {3257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {3257#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {3257#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {3257#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {3257#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {3257#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {3257#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:19,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {3257#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {3257#true} is VALID [2022-02-20 17:06:19,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {3257#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {3257#true} is VALID [2022-02-20 17:06:19,419 INFO L272 TraceCheckUtils]: 10: Hoare triple {3257#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {3257#true} is VALID [2022-02-20 17:06:19,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {3257#true} #t~loopctr188 := 0; {3287#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:19,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {3287#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3335#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:19,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3339#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:19,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {3339#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3343#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3))} is VALID [2022-02-20 17:06:19,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {3343#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3347#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:19,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {3347#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3351#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:19,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {3351#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3355#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} is VALID [2022-02-20 17:06:19,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {3355#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3359#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (<= |#Ultimate.C_memset_#t~loopctr188| 7) (<= 7 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:19,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (<= |#Ultimate.C_memset_#t~loopctr188| 7) (<= 7 |#Ultimate.C_memset_#t~loopctr188|))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3363#(and (< 0 (div (+ 4294967303 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296)) (< (div (+ (- 4294967303) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) 2))} is VALID [2022-02-20 17:06:19,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {3363#(and (< 0 (div (+ 4294967303 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296)) (< (div (+ (- 4294967303) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) 2))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3363#(and (< 0 (div (+ 4294967303 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296)) (< (div (+ (- 4294967303) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) 2))} is VALID [2022-02-20 17:06:19,452 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3363#(and (< 0 (div (+ 4294967303 (* (- 1) (mod |#Ultimate.C_memset_#amount| 4294967296))) 4294967296)) (< (div (+ (- 4294967303) (mod |#Ultimate.C_memset_#amount| 4294967296)) (- 4294967296)) 2))} {3257#true} #232#return; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {3258#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {3258#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {3258#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {3258#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {3258#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {3258#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {3258#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {3258#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {3258#false} is VALID [2022-02-20 17:06:19,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {3258#false} assume do_discover_list_#t~short172#1; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {3258#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {3258#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {3258#false} assume !(dStrHex_~len#1 <= 0); {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L272 TraceCheckUtils]: 34: Hoare triple {3258#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {3258#false} #t~loopctr188 := 0; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {3258#false} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {3258#false} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {3258#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3258#false} {3258#false} #234#return; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {3258#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {3258#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L272 TraceCheckUtils]: 53: Hoare triple {3258#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {3258#false} ~cond := #in~cond; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {3258#false} assume 0 == ~cond; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {3258#false} assume !false; {3258#false} is VALID [2022-02-20 17:06:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-02-20 17:06:19,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:06:20,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {3258#false} assume !false; {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {3258#false} assume 0 == ~cond; {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {3258#false} ~cond := #in~cond; {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L272 TraceCheckUtils]: 53: Hoare triple {3258#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {3258#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {3258#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3257#true} {3258#false} #234#return; {3258#false} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {3257#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {3257#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3257#true} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {3257#true} #t~loopctr188 := 0; {3257#true} is VALID [2022-02-20 17:06:20,022 INFO L272 TraceCheckUtils]: 34: Hoare triple {3258#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {3257#true} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {3258#false} assume !(dStrHex_~len#1 <= 0); {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {3258#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {3258#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {3258#false} assume do_discover_list_#t~short172#1; {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {3258#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {3258#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {3258#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {3258#false} is VALID [2022-02-20 17:06:20,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {3258#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {3258#false} is VALID [2022-02-20 17:06:20,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {3258#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {3258#false} is VALID [2022-02-20 17:06:20,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {3258#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {3258#false} is VALID [2022-02-20 17:06:20,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {3258#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {3258#false} is VALID [2022-02-20 17:06:20,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {3258#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {3258#false} is VALID [2022-02-20 17:06:20,024 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3583#(not (= |#Ultimate.C_memset_#amount| 24))} {3257#true} #232#return; {3258#false} is VALID [2022-02-20 17:06:20,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {3583#(not (= |#Ultimate.C_memset_#amount| 24))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3583#(not (= |#Ultimate.C_memset_#amount| 24))} is VALID [2022-02-20 17:06:20,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {3590#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {3583#(not (= |#Ultimate.C_memset_#amount| 24))} is VALID [2022-02-20 17:06:20,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {3594#(or (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3590#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:20,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {3598#(or (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3594#(or (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:20,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {3602#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3598#(or (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:20,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {3606#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3602#(or (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-20 17:06:20,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {3610#(or (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 5) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3606#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-20 17:06:20,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {3614#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 6) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 5) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3610#(or (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (not (= |#Ultimate.C_memset_#amount| 24)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 5) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 17:06:20,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {3618#(or (< (mod (+ 7 |#Ultimate.C_memset_#t~loopctr188|) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 6) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {3614#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 6) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 5) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-20 17:06:20,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {3257#true} #t~loopctr188 := 0; {3618#(or (< (mod (+ 7 |#Ultimate.C_memset_#t~loopctr188|) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= |#Ultimate.C_memset_#amount| 24)) (not (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 6) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-20 17:06:20,032 INFO L272 TraceCheckUtils]: 10: Hoare triple {3257#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {3257#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {3257#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {3257#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {3257#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {3257#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {3257#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {3257#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {3257#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {3257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {3257#true} is VALID [2022-02-20 17:06:20,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {3257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {3257#true} is VALID [2022-02-20 17:06:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-20 17:06:20,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586317319] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:06:20,033 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:06:20,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-02-20 17:06:20,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99996682] [2022-02-20 17:06:20,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:06:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 17:06:20,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:06:20,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:20,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:20,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-20 17:06:20,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:06:20,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-20 17:06:20,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2022-02-20 17:06:20,093 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:26,076 INFO L93 Difference]: Finished difference Result 163 states and 211 transitions. [2022-02-20 17:06:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 17:06:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 17:06:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:06:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 192 transitions. [2022-02-20 17:06:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 192 transitions. [2022-02-20 17:06:26,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 192 transitions. [2022-02-20 17:06:26,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:06:26,422 INFO L225 Difference]: With dead ends: 163 [2022-02-20 17:06:26,422 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 17:06:26,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=679, Invalid=1577, Unknown=0, NotChecked=0, Total=2256 [2022-02-20 17:06:26,425 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 65 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:06:26,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 726 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:06:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 17:06:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 17:06:26,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:06:26,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:26,493 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:26,493 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:26,495 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-02-20 17:06:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-02-20 17:06:26,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:26,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:26,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-02-20 17:06:26,496 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-02-20 17:06:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:06:26,497 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-02-20 17:06:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-02-20 17:06:26,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:06:26,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:06:26,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:06:26,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:06:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:06:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-02-20 17:06:26,501 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 57 [2022-02-20 17:06:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:06:26,502 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-02-20 17:06:26,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:06:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-02-20 17:06:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 17:06:26,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:06:26,503 INFO L514 BasicCegarLoop]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:06:26,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:06:26,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:26,721 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:06:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:06:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1004739755, now seen corresponding path program 5 times [2022-02-20 17:06:26,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:06:26,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95099203] [2022-02-20 17:06:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:06:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:06:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 17:06:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:27,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {4291#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {4292#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:27,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {4292#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4293#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {4293#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4294#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:27,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {4294#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4295#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {4295#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4296#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {4296#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4297#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:27,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {4297#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4298#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} is VALID [2022-02-20 17:06:27,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {4298#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4299#(and (<= |#Ultimate.C_memset_#t~loopctr188| 7) (<= 7 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {4299#(and (<= |#Ultimate.C_memset_#t~loopctr188| 7) (<= 7 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4300#(and (<= 8 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 8))} is VALID [2022-02-20 17:06:27,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {4300#(and (<= 8 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 8))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4301#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {4301#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4302#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 10) (<= 10 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {4302#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 10) (<= 10 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4303#(and (<= |#Ultimate.C_memset_#t~loopctr188| 11) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 11 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {4303#(and (<= |#Ultimate.C_memset_#t~loopctr188| 11) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 11 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4304#(and (<= |#Ultimate.C_memset_#t~loopctr188| 12) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 12 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {4304#(and (<= |#Ultimate.C_memset_#t~loopctr188| 12) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 12 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4305#(and (<= 13 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 13))} is VALID [2022-02-20 17:06:27,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#(and (<= 13 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 13))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4306#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 14 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 14))} is VALID [2022-02-20 17:06:27,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {4306#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 14 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 14))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4307#(and (<= |#Ultimate.C_memset_#t~loopctr188| 15) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 15 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {4307#(and (<= |#Ultimate.C_memset_#t~loopctr188| 15) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 15 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4308#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 16) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} is VALID [2022-02-20 17:06:27,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {4308#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 16) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,284 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {4253#true} #232#return; {4254#false} is VALID [2022-02-20 17:06:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 17:06:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:06:27,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {4291#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {4253#true} is VALID [2022-02-20 17:06:27,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {4253#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {4253#true} is VALID [2022-02-20 17:06:27,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {4253#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4253#true} is VALID [2022-02-20 17:06:27,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4253#true} {4254#false} #234#return; {4254#false} is VALID [2022-02-20 17:06:27,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {4253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(37, 4, 0, 1);call write~init~int(46, 4, 1, 1);call write~init~int(50, 4, 2, 1);call write~init~int(120, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(19, 5);call #Ultimate.allocInit(19, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(46, 7, 1, 1);call write~init~int(50, 7, 2, 1);call write~init~int(120, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(19, 9);call #Ultimate.allocInit(5, 10);call write~init~int(37, 10, 0, 1);call write~init~int(46, 10, 1, 1);call write~init~int(50, 10, 2, 1);call write~init~int(120, 10, 3, 1);call write~init~int(0, 10, 4, 1);call #Ultimate.allocInit(19, 11);~__tmpTR__int_1~0 := 0;~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset := 12, 0;call #Ultimate.allocInit(384, 12);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 4 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 8 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(1, ~#smp_def_rrlen_arr~0.base, 12 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 16 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(14, ~#smp_def_rrlen_arr~0.base, 20 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 24 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 28 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 32 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 36 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 40 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 44 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(4, ~#smp_def_rrlen_arr~0.base, 48 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 52 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 56 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(5, ~#smp_def_rrlen_arr~0.base, 60 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 64 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 68 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 72 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 76 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 80 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(7, ~#smp_def_rrlen_arr~0.base, 84 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 88 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 92 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(16, ~#smp_def_rrlen_arr~0.base, 96 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 100 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(12, ~#smp_def_rrlen_arr~0.base, 104 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(17, ~#smp_def_rrlen_arr~0.base, 108 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 112 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(6, ~#smp_def_rrlen_arr~0.base, 116 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(18, ~#smp_def_rrlen_arr~0.base, 120 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 124 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(13, ~#smp_def_rrlen_arr~0.base, 128 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(19, ~#smp_def_rrlen_arr~0.base, 132 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(2, ~#smp_def_rrlen_arr~0.base, 136 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 140 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(20, ~#smp_def_rrlen_arr~0.base, 144 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 148 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 152 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(32, ~#smp_def_rrlen_arr~0.base, 156 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 160 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 164 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(33, ~#smp_def_rrlen_arr~0.base, 168 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 172 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 176 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(34, ~#smp_def_rrlen_arr~0.base, 180 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 184 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 188 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(128, ~#smp_def_rrlen_arr~0.base, 192 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(3, ~#smp_def_rrlen_arr~0.base, 196 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 200 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(129, ~#smp_def_rrlen_arr~0.base, 204 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 208 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 212 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(130, ~#smp_def_rrlen_arr~0.base, 216 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 220 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 224 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(131, ~#smp_def_rrlen_arr~0.base, 228 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 232 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-3, ~#smp_def_rrlen_arr~0.base, 236 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(133, ~#smp_def_rrlen_arr~0.base, 240 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 244 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 248 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(134, ~#smp_def_rrlen_arr~0.base, 252 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 256 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 260 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(135, ~#smp_def_rrlen_arr~0.base, 264 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 268 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 272 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(136, ~#smp_def_rrlen_arr~0.base, 276 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 280 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 284 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(137, ~#smp_def_rrlen_arr~0.base, 288 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 292 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 296 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(138, ~#smp_def_rrlen_arr~0.base, 300 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 304 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 308 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(139, ~#smp_def_rrlen_arr~0.base, 312 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 316 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 320 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(144, ~#smp_def_rrlen_arr~0.base, 324 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 328 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 332 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(145, ~#smp_def_rrlen_arr~0.base, 336 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 340 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 344 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(146, ~#smp_def_rrlen_arr~0.base, 348 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(9, ~#smp_def_rrlen_arr~0.base, 352 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 356 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(147, ~#smp_def_rrlen_arr~0.base, 360 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-2, ~#smp_def_rrlen_arr~0.base, 364 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(0, ~#smp_def_rrlen_arr~0.base, 368 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 372 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 376 + ~#smp_def_rrlen_arr~0.offset, 4);call write~init~int(-1, ~#smp_def_rrlen_arr~0.base, 380 + ~#smp_def_rrlen_arr~0.offset, 4); {4253#true} is VALID [2022-02-20 17:06:27,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {4253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset, main_#t~nondet185#1, main_#t~ret186#1, main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_~#opts~0#1.base, main_~#opts~0#1.offset, main_~resp~0#1.base, main_~resp~0#1.offset, main_~ret~0#1;call main_~#tobj~0#1.base, main_~#tobj~0#1.offset := #Ultimate.allocOnStack(280);call main_~#opts~0#1.base, main_~#opts~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~resp~0#1.base, main_~resp~0#1.offset;call main_#t~malloc184#1.base, main_#t~malloc184#1.offset := #Ultimate.allocOnHeap(1);main_~resp~0#1.base, main_~resp~0#1.offset := main_#t~malloc184#1.base, main_#t~malloc184#1.offset;havoc main_#t~malloc184#1.base, main_#t~malloc184#1.offset;assume -2147483648 <= main_#t~nondet185#1 && main_#t~nondet185#1 <= 2147483647;assume { :begin_inline_do_discover_list } true;do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset, do_discover_list_#in~sphy_id#1, do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset, do_discover_list_#in~max_resp_len#1, do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset := main_~#tobj~0#1.base, main_~#tobj~0#1.offset, main_#t~nondet185#1, main_~resp~0#1.base, main_~resp~0#1.offset, 4, main_~#opts~0#1.base, main_~#opts~0#1.offset;havoc do_discover_list_#res#1;havoc do_discover_list_#t~ite150#1, do_discover_list_#t~mem151#1, do_discover_list_#t~mem152#1, do_discover_list_#t~mem153#1, do_discover_list_#t~mem154#1, do_discover_list_#t~mem155#1, do_discover_list_#t~mem156#1, do_discover_list_#t~mem157#1, do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset, do_discover_list_#t~mem159#1, do_discover_list_#t~ret160#1, do_discover_list_#t~mem161#1, do_discover_list_#t~mem162#1, do_discover_list_#t~mem163#1, do_discover_list_#t~short164#1, do_discover_list_#t~mem165#1, do_discover_list_#t~mem166#1, do_discover_list_#t~short167#1, do_discover_list_#t~mem168#1, do_discover_list_#t~ret169#1, do_discover_list_#t~mem170#1, do_discover_list_#t~mem171#1, do_discover_list_#t~short172#1, do_discover_list_#t~mem173#1, do_discover_list_#t~mem174#1, do_discover_list_#t~mem175#1, do_discover_list_#t~mem176#1, do_discover_list_#t~mem177#1, do_discover_list_#t~mem178#1, do_discover_list_#t~mem179#1, do_discover_list_#t~mem180#1, do_discover_list_#t~mem181#1, do_discover_list_#t~mem182#1, do_discover_list_#t~mem183#1, do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~sphy_id#1, do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~max_resp_len#1, do_discover_list_~op#1.base, do_discover_list_~op#1.offset, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_~len~2#1, do_discover_list_~res~2#1, do_discover_list_~dword_resp_len~0#1, do_discover_list_~mnum_desc~0#1;do_discover_list_~top#1.base, do_discover_list_~top#1.offset := do_discover_list_#in~top#1.base, do_discover_list_#in~top#1.offset;do_discover_list_~sphy_id#1 := do_discover_list_#in~sphy_id#1;do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset := do_discover_list_#in~resp#1.base, do_discover_list_#in~resp#1.offset;do_discover_list_~max_resp_len#1 := do_discover_list_#in~max_resp_len#1;do_discover_list_~op#1.base, do_discover_list_~op#1.offset := do_discover_list_#in~op#1.base, do_discover_list_#in~op#1.offset;call do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset := #Ultimate.allocOnStack(32);call write~init~int(64, do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(32, do_discover_list_~#smp_req~0#1.base, 1 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(6, do_discover_list_~#smp_req~0#1.base, 3 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 4 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 5 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 6 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 7 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 12 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 13 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 14 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 15 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 16 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 17 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 18 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 19 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 20 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 21 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 22 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 23 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 24 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 25 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 26 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 27 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 28 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 29 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 30 + do_discover_list_~#smp_req~0#1.offset, 1);call write~init~int(0, do_discover_list_~#smp_req~0#1.base, 31 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset := #Ultimate.allocOnStack(24);havoc do_discover_list_~len~2#1;havoc do_discover_list_~res~2#1;havoc do_discover_list_~dword_resp_len~0#1;havoc do_discover_list_~mnum_desc~0#1;do_discover_list_~dword_resp_len~0#1 := (if do_discover_list_~max_resp_len#1 - 8 < 0 && 0 != (do_discover_list_~max_resp_len#1 - 8) % 4 then 1 + (do_discover_list_~max_resp_len#1 - 8) / 4 else (do_discover_list_~max_resp_len#1 - 8) / 4); {4253#true} is VALID [2022-02-20 17:06:27,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4253#true} assume do_discover_list_~dword_resp_len~0#1 < 256;do_discover_list_#t~ite150#1 := do_discover_list_~dword_resp_len~0#1; {4253#true} is VALID [2022-02-20 17:06:27,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {4253#true} call write~int(do_discover_list_#t~ite150#1, do_discover_list_~#smp_req~0#1.base, 2 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~ite150#1;call write~int(do_discover_list_~sphy_id#1, do_discover_list_~#smp_req~0#1.base, 8 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem151#1 := read~int(do_discover_list_~op#1.base, 28 + do_discover_list_~op#1.offset, 4);do_discover_list_~mnum_desc~0#1 := do_discover_list_#t~mem151#1;havoc do_discover_list_#t~mem151#1;call do_discover_list_#t~mem152#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {4253#true} is VALID [2022-02-20 17:06:27,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {4253#true} assume 0 == do_discover_list_#t~mem152#1 && do_discover_list_~mnum_desc~0#1 > 8;havoc do_discover_list_#t~mem152#1;do_discover_list_~mnum_desc~0#1 := 8; {4253#true} is VALID [2022-02-20 17:06:27,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {4253#true} call do_discover_list_#t~mem153#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4); {4253#true} is VALID [2022-02-20 17:06:27,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {4253#true} assume !(1 == do_discover_list_#t~mem153#1 && do_discover_list_~mnum_desc~0#1 > 40);havoc do_discover_list_#t~mem153#1; {4253#true} is VALID [2022-02-20 17:06:27,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {4253#true} call write~int(do_discover_list_~mnum_desc~0#1, do_discover_list_~#smp_req~0#1.base, 9 + do_discover_list_~#smp_req~0#1.offset, 1);call do_discover_list_#t~mem154#1 := read~int(do_discover_list_~op#1.base, 16 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem154#1 then 0 else (if 1 == do_discover_list_#t~mem154#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem154#1, 15))), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem154#1;call do_discover_list_#t~mem155#1 := read~int(do_discover_list_~op#1.base, 24 + do_discover_list_~op#1.offset, 4); {4253#true} is VALID [2022-02-20 17:06:27,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {4253#true} assume 0 != do_discover_list_#t~mem155#1;havoc do_discover_list_#t~mem155#1;call do_discover_list_#t~mem156#1 := read~int(do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);call write~int(~bitwiseOr(do_discover_list_#t~mem156#1 % 256, 128), do_discover_list_~#smp_req~0#1.base, 10 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem156#1; {4253#true} is VALID [2022-02-20 17:06:27,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {4253#true} call do_discover_list_#t~mem157#1 := read~int(do_discover_list_~op#1.base, 8 + do_discover_list_~op#1.offset, 4);call write~int((if 0 == do_discover_list_#t~mem157#1 then 0 else (if 1 == do_discover_list_#t~mem157#1 then 1 else ~bitwiseAnd(do_discover_list_#t~mem157#1, 15))), do_discover_list_~#smp_req~0#1.base, 11 + do_discover_list_~#smp_req~0#1.offset, 1);havoc do_discover_list_#t~mem157#1; {4253#true} is VALID [2022-02-20 17:06:27,309 INFO L272 TraceCheckUtils]: 10: Hoare triple {4253#true} call do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset := #Ultimate.C_memset(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, 0, 24); {4291#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:27,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {4291#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {4292#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} is VALID [2022-02-20 17:06:27,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {4292#(and (<= 0 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 0))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4293#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {4293#(and (<= |#Ultimate.C_memset_#t~loopctr188| 1) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 1 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4294#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} is VALID [2022-02-20 17:06:27,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {4294#(and (<= 2 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 2))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4295#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {4295#(and (<= 3 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 3) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4296#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {4296#(and (<= |#Ultimate.C_memset_#t~loopctr188| 4) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 4 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4297#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} is VALID [2022-02-20 17:06:27,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {4297#(and (<= 5 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 5))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4298#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} is VALID [2022-02-20 17:06:27,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {4298#(and (<= 6 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 6))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4299#(and (<= |#Ultimate.C_memset_#t~loopctr188| 7) (<= 7 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {4299#(and (<= |#Ultimate.C_memset_#t~loopctr188| 7) (<= 7 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4300#(and (<= 8 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 8))} is VALID [2022-02-20 17:06:27,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {4300#(and (<= 8 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 8))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4301#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {4301#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4302#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 10) (<= 10 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {4302#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 10) (<= 10 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4303#(and (<= |#Ultimate.C_memset_#t~loopctr188| 11) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 11 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {4303#(and (<= |#Ultimate.C_memset_#t~loopctr188| 11) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 11 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4304#(and (<= |#Ultimate.C_memset_#t~loopctr188| 12) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 12 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {4304#(and (<= |#Ultimate.C_memset_#t~loopctr188| 12) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 12 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4305#(and (<= 13 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 13))} is VALID [2022-02-20 17:06:27,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#(and (<= 13 |#Ultimate.C_memset_#t~loopctr188|) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr188| 13))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4306#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 14 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 14))} is VALID [2022-02-20 17:06:27,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {4306#(and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 14 |#Ultimate.C_memset_#t~loopctr188|) (<= |#Ultimate.C_memset_#t~loopctr188| 14))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4307#(and (<= |#Ultimate.C_memset_#t~loopctr188| 15) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 15 |#Ultimate.C_memset_#t~loopctr188|))} is VALID [2022-02-20 17:06:27,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {4307#(and (<= |#Ultimate.C_memset_#t~loopctr188| 15) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= 15 |#Ultimate.C_memset_#t~loopctr188|))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4308#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 16) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} is VALID [2022-02-20 17:06:27,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {4308#(and (or (<= |#Ultimate.C_memset_#t~loopctr188| 16) (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)))) (or (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr188| 4294967296)) (and (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr188| 4294967296) 1) 0)) (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 17:06:27,322 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4309#(or (<= |#Ultimate.C_memset_#amount| 16) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {4253#true} #232#return; {4254#false} is VALID [2022-02-20 17:06:27,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {4254#false} havoc do_discover_list_#t~memset~res158#1.base, do_discover_list_#t~memset~res158#1.offset;call do_discover_list_#t~mem159#1 := read~int(do_discover_list_~op#1.base, 56 + do_discover_list_~op#1.offset, 4);call do_discover_list_#t~ret160#1 := smp_send_req(do_discover_list_~top#1.base, do_discover_list_~top#1.offset, do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset, do_discover_list_#t~mem159#1);assume -2147483648 <= do_discover_list_#t~ret160#1 && do_discover_list_#t~ret160#1 <= 2147483647;do_discover_list_~res~2#1 := do_discover_list_#t~ret160#1;havoc do_discover_list_#t~mem159#1;havoc do_discover_list_#t~ret160#1; {4254#false} is VALID [2022-02-20 17:06:27,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {4254#false} assume !(0 != do_discover_list_~res~2#1);call do_discover_list_#t~mem161#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 20 + do_discover_list_~#smp_rr~0#1.offset, 4); {4254#false} is VALID [2022-02-20 17:06:27,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {4254#false} assume !(0 != do_discover_list_#t~mem161#1);havoc do_discover_list_#t~mem161#1;call do_discover_list_#t~mem162#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem162#1 >= 0; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {4254#false} assume do_discover_list_#t~short164#1;call do_discover_list_#t~mem163#1 := read~int(do_discover_list_~#smp_rr~0#1.base, 16 + do_discover_list_~#smp_rr~0#1.offset, 4);do_discover_list_#t~short164#1 := do_discover_list_#t~mem163#1 < 4; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {4254#false} assume !do_discover_list_#t~short164#1;havoc do_discover_list_#t~mem162#1;havoc do_discover_list_#t~mem163#1;havoc do_discover_list_#t~short164#1;call do_discover_list_#t~mem165#1 := read~int(do_discover_list_~resp#1.base, 3 + do_discover_list_~resp#1.offset, 1);do_discover_list_~len~2#1 := do_discover_list_#t~mem165#1 % 256;havoc do_discover_list_#t~mem165#1;do_discover_list_#t~short167#1 := 0 == do_discover_list_~len~2#1; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {4254#false} assume do_discover_list_#t~short167#1;call do_discover_list_#t~mem166#1 := read~int(do_discover_list_~resp#1.base, 2 + do_discover_list_~resp#1.offset, 1);do_discover_list_#t~short167#1 := 0 == do_discover_list_#t~mem166#1 % 256; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {4254#false} assume !do_discover_list_#t~short167#1;havoc do_discover_list_#t~mem166#1;havoc do_discover_list_#t~short167#1; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {4254#false} do_discover_list_~len~2#1 := 4 + 4 * do_discover_list_~len~2#1;call do_discover_list_#t~mem170#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4);do_discover_list_#t~short172#1 := 0 != do_discover_list_#t~mem170#1; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {4254#false} assume do_discover_list_#t~short172#1; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {4254#false} assume do_discover_list_#t~short172#1;havoc do_discover_list_#t~mem170#1;havoc do_discover_list_#t~mem171#1;havoc do_discover_list_#t~short172#1;call do_discover_list_#t~mem173#1 := read~int(do_discover_list_~op#1.base, 20 + do_discover_list_~op#1.offset, 4); {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {4254#false} assume 0 != do_discover_list_#t~mem173#1;havoc do_discover_list_#t~mem173#1;assume { :begin_inline_dStrHex } true;dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset, dStrHex_#in~len#1, dStrHex_#in~no_ascii#1 := do_discover_list_~resp#1.base, do_discover_list_~resp#1.offset, do_discover_list_~len~2#1, 1;havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset, dStrHex_#t~nondet9#1, dStrHex_#t~post11#1.base, dStrHex_#t~post11#1.offset, dStrHex_#t~mem12#1, dStrHex_#t~post13#1, dStrHex_#t~nondet14#1, dStrHex_#t~post15#1, dStrHex_#t~memset~res16#1.base, dStrHex_#t~memset~res16#1.offset, dStrHex_#t~nondet17#1, dStrHex_#t~post10#1, dStrHex_~str#1.base, dStrHex_~str#1.offset, dStrHex_~len#1, dStrHex_~no_ascii#1, dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset, dStrHex_~c~0#1, dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, dStrHex_~a~0#1, dStrHex_~bpstart~0#1, dStrHex_~cpstart~0#1, dStrHex_~cpos~0#1, dStrHex_~bpos~0#1, dStrHex_~i~0#1, dStrHex_~k~0#1;dStrHex_~str#1.base, dStrHex_~str#1.offset := dStrHex_#in~str#1.base, dStrHex_#in~str#1.offset;dStrHex_~len#1 := dStrHex_#in~len#1;dStrHex_~no_ascii#1 := dStrHex_#in~no_ascii#1;dStrHex_~p~0#1.base, dStrHex_~p~0#1.offset := dStrHex_~str#1.base, dStrHex_~str#1.offset;havoc dStrHex_~c~0#1;call dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset := #Ultimate.allocOnStack(82);dStrHex_~a~0#1 := 0;dStrHex_~bpstart~0#1 := 5;dStrHex_~cpstart~0#1 := 60;dStrHex_~cpos~0#1 := dStrHex_~cpstart~0#1;dStrHex_~bpos~0#1 := dStrHex_~bpstart~0#1;havoc dStrHex_~i~0#1;havoc dStrHex_~k~0#1; {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {4254#false} assume !(dStrHex_~len#1 <= 0); {4254#false} is VALID [2022-02-20 17:06:27,323 INFO L272 TraceCheckUtils]: 43: Hoare triple {4254#false} call dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset := #Ultimate.C_memset(dStrHex_~#buff~0#1.base, dStrHex_~#buff~0#1.offset, 32, 80); {4291#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {4291#(= |#memory_int| |old(#memory_int)|)} #t~loopctr188 := 0; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {4253#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#t~loopctr188 := 1 + #t~loopctr188; {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {4253#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {4253#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4253#true} is VALID [2022-02-20 17:06:27,325 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4253#true} {4254#false} #234#return; {4254#false} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 60: Hoare triple {4254#false} havoc dStrHex_#t~memset~res8#1.base, dStrHex_#t~memset~res8#1.offset;call write~int(0, dStrHex_~#buff~0#1.base, 80 + dStrHex_~#buff~0#1.offset, 1); {4254#false} is VALID [2022-02-20 17:06:27,325 INFO L290 TraceCheckUtils]: 61: Hoare triple {4254#false} assume !(dStrHex_~no_ascii#1 < 0);havoc dStrHex_#t~nondet9#1;dStrHex_~k~0#1 := dStrHex_#t~nondet9#1; {4254#false} is VALID [2022-02-20 17:06:27,325 INFO L272 TraceCheckUtils]: 62: Hoare triple {4254#false} call __VERIFIER_assert((if 1 + dStrHex_~k~0#1 >= 0 && 1 + dStrHex_~k~0#1 < 82 then 1 else 0)); {4254#false} is VALID [2022-02-20 17:06:27,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {4254#false} ~cond := #in~cond; {4254#false} is VALID [2022-02-20 17:06:27,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {4254#false} assume 0 == ~cond; {4254#false} is VALID [2022-02-20 17:06:27,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {4254#false} assume !false; {4254#false} is VALID [2022-02-20 17:06:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 359 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-20 17:06:27,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:06:27,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95099203] [2022-02-20 17:06:27,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95099203] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:06:27,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979441978] [2022-02-20 17:06:27,327 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:06:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:06:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:06:27,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:06:27,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process