./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 08f69d9d27fea4ba41de4dd6c325f6f1a70ecfdbb77928c35b5b3f93d75aa1b8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:35:10,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:35:10,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:35:10,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:35:10,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:35:10,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:35:10,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:35:10,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:35:10,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:35:10,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:35:10,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:35:10,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:35:10,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:35:10,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:35:10,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:35:10,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:35:10,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:35:10,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:35:10,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:35:10,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:35:10,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:35:10,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:35:10,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:35:10,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:35:10,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:35:10,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:35:10,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:35:10,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:35:10,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:35:10,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:35:10,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:35:10,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:35:10,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:35:10,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:35:10,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:35:10,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:35:10,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:35:10,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:35:10,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:35:10,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:35:10,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:35:10,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:35:10,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:35:10,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:35:10,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:35:10,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:35:10,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:35:10,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:35:10,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:35:10,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:35:10,530 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:35:10,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:35:10,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:35:10,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:35:10,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:35:10,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:35:10,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:35:10,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:35:10,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:35:10,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:35:10,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:35:10,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:35:10,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:35:10,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:35:10,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:35:10,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:35:10,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:35:10,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:35:10,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:35:10,534 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:35:10,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:35:10,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:35:10,534 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 08f69d9d27fea4ba41de4dd6c325f6f1a70ecfdbb77928c35b5b3f93d75aa1b8 [2022-02-20 22:35:10,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:35:10,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:35:10,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:35:10,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:35:10,789 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:35:10,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i [2022-02-20 22:35:10,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b77aa6e/2e2f2e078d204bdeb0132d58922757b3/FLAGd6a0fc0c7 [2022-02-20 22:35:11,444 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:35:11,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i [2022-02-20 22:35:11,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b77aa6e/2e2f2e078d204bdeb0132d58922757b3/FLAGd6a0fc0c7 [2022-02-20 22:35:11,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b77aa6e/2e2f2e078d204bdeb0132d58922757b3 [2022-02-20 22:35:11,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:35:11,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:35:11,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:35:11,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:35:11,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:35:11,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:35:11" (1/1) ... [2022-02-20 22:35:11,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de68198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:11, skipping insertion in model container [2022-02-20 22:35:11,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:35:11" (1/1) ... [2022-02-20 22:35:11,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:35:12,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:35:13,592 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i[250006,250019] [2022-02-20 22:35:13,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:35:13,699 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:35:13,980 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i[250006,250019] [2022-02-20 22:35:13,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:35:14,081 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:35:14,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14 WrapperNode [2022-02-20 22:35:14,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:35:14,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:35:14,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:35:14,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:35:14,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,392 INFO L137 Inliner]: procedures = 302, calls = 1935, calls flagged for inlining = 138, calls inlined = 135, statements flattened = 5119 [2022-02-20 22:35:14,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:35:14,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:35:14,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:35:14,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:35:14,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:35:14,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:35:14,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:35:14,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:35:14,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (1/1) ... [2022-02-20 22:35:14,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:35:14,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:35:14,681 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 22:35:14,703 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 22:35:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure finish_request [2022-02-20 22:35:14,708 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_request [2022-02-20 22:35:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure start_transfer [2022-02-20 22:35:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure start_transfer [2022-02-20 22:35:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_hub_status_data [2022-02-20 22:35:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_hub_status_data [2022-02-20 22:35:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-02-20 22:35:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-02-20 22:35:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_resume [2022-02-20 22:35:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_resume [2022-02-20 22:35:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:35:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:35:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:35:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:35:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:35:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:35:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure disable_controller [2022-02-20 22:35:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_controller [2022-02-20 22:35:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure pipe_stop [2022-02-20 22:35:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure pipe_stop [2022-02-20 22:35:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure free_usb_address [2022-02-20 22:35:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure free_usb_address [2022-02-20 22:35:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure pipe_irq_enable [2022-02-20 22:35:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure pipe_irq_enable [2022-02-20 22:35:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure disable_r8a66597_pipe_all [2022-02-20 22:35:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_r8a66597_pipe_all [2022-02-20 22:35:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-02-20 22:35:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-02-20 22:35:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure enable_controller [2022-02-20 22:35:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_controller [2022-02-20 22:35:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:35:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:35:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-02-20 22:35:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-02-20 22:35:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_root_hub_start_polling [2022-02-20 22:35:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_root_hub_start_polling [2022-02-20 22:35:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:35:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:35:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-02-20 22:35:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-02-20 22:35:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure pipe_irq_disable [2022-02-20 22:35:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure pipe_irq_disable [2022-02-20 22:35:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure pipe_toggle_set [2022-02-20 22:35:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure pipe_toggle_set [2022-02-20 22:35:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_urb_dequeue [2022-02-20 22:35:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_urb_dequeue [2022-02-20 22:35:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:35:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:35:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_type [2022-02-20 22:35:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_type [2022-02-20 22:35:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_hub_control [2022-02-20 22:35:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_hub_control [2022-02-20 22:35:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure set_pipe_reg_addr [2022-02-20 22:35:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure set_pipe_reg_addr [2022-02-20 22:35:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-02-20 22:35:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-02-20 22:35:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure get_urb_to_r8a66597_addr [2022-02-20 22:35:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure get_urb_to_r8a66597_addr [2022-02-20 22:35:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:35:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:35:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_urb_done [2022-02-20 22:35:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_urb_done [2022-02-20 22:35:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure check_next_phase [2022-02-20 22:35:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure check_next_phase [2022-02-20 22:35:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure get_intsts_reg [2022-02-20 22:35:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure get_intsts_reg [2022-02-20 22:35:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_2 [2022-02-20 22:35:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_2 [2022-02-20 22:35:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_mdfy [2022-02-20 22:35:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_mdfy [2022-02-20 22:35:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-02-20 22:35:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-02-20 22:35:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure set_devadd_reg [2022-02-20 22:35:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure set_devadd_reg [2022-02-20 22:35:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_urb_enqueue [2022-02-20 22:35:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_urb_enqueue [2022-02-20 22:35:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure get_syssts_reg [2022-02-20 22:35:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure get_syssts_reg [2022-02-20 22:35:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_3 [2022-02-20 22:35:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_3 [2022-02-20 22:35:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:35:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 22:35:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 22:35:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_start [2022-02-20 22:35:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_start [2022-02-20 22:35:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:35:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure pipe_start [2022-02-20 22:35:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure pipe_start [2022-02-20 22:35:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure check_transfer_finish [2022-02-20 22:35:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure check_transfer_finish [2022-02-20 22:35:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_remove [2022-02-20 22:35:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_remove [2022-02-20 22:35:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-02-20 22:35:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-02-20 22:35:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:35:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:35:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:35:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:35:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure enable_pipe_irq [2022-02-20 22:35:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_pipe_irq [2022-02-20 22:35:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-02-20 22:35:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-02-20 22:35:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:35:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-02-20 22:35:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-02-20 22:35:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-02-20 22:35:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-02-20 22:35:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:35:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_endpoint_disable [2022-02-20 22:35:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_endpoint_disable [2022-02-20 22:35:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure start_root_hub_sampling [2022-02-20 22:35:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure start_root_hub_sampling [2022-02-20 22:35:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_bus_resume [2022-02-20 22:35:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_bus_resume [2022-02-20 22:35:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-02-20 22:35:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-02-20 22:35:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 22:35:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 22:35:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure collect_usb_address_map [2022-02-20 22:35:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure collect_usb_address_map [2022-02-20 22:35:14,729 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_pipe_toggle [2022-02-20 22:35:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_pipe_toggle [2022-02-20 22:35:14,729 INFO L130 BoogieDeclarations]: Found specification of procedure get_syscfg_reg [2022-02-20 22:35:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure get_syscfg_reg [2022-02-20 22:35:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_write [2022-02-20 22:35:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_write [2022-02-20 22:35:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 22:35:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 22:35:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure get_toggle_pointer [2022-02-20 22:35:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure get_toggle_pointer [2022-02-20 22:35:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_hcd [2022-02-20 22:35:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_hcd [2022-02-20 22:35:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure get_parent_r8a66597_address [2022-02-20 22:35:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure get_parent_r8a66597_address [2022-02-20 22:35:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure clk_unprepare [2022-02-20 22:35:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure clk_unprepare [2022-02-20 22:35:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:35:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure packet_write [2022-02-20 22:35:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_write [2022-02-20 22:35:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-02-20 22:35:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-02-20 22:35:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-02-20 22:35:14,737 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-02-20 22:35:14,789 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure clk_put [2022-02-20 22:35:14,789 INFO L138 BoogieDeclarations]: Found implementation of procedure clk_put [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2022-02-20 22:35:14,789 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure get_port_number [2022-02-20 22:35:14,789 INFO L138 BoogieDeclarations]: Found implementation of procedure get_port_number [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:35:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure force_dequeue [2022-02-20 22:35:14,789 INFO L138 BoogieDeclarations]: Found implementation of procedure force_dequeue [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure get_intenb_reg [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure get_intenb_reg [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_to_hcd [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_to_hcd [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure disable_pipe_irq [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_pipe_irq [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure pipe_setting [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure pipe_setting [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_clock_enable [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_clock_enable [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure get_urb_to_r8a66597_dev [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure get_urb_to_r8a66597_dev [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure get_dvstctr_reg [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dvstctr_reg [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure packet_read [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_read [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure fifo_change_from_pipe [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fifo_change_from_pipe [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:35:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:35:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure get_urb_error [2022-02-20 22:35:14,791 INFO L138 BoogieDeclarations]: Found implementation of procedure get_urb_error [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure mbw_value [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure mbw_value [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure cfifo_change [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure cfifo_change [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_get_td [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_get_td [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hub_find_child [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hub_find_child [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_probe [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_probe [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure timer_pending [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_pending [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_port_power [2022-02-20 22:35:14,792 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_port_power [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:35:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-02-20 22:35:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-02-20 22:35:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure get_r8a66597_usb_speed [2022-02-20 22:35:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure get_r8a66597_usb_speed [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_read [2022-02-20 22:35:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_read [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 22:35:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure set_td_timer [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure set_td_timer [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_packet_write [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_packet_write [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_resume_root_hub [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_resume_root_hub [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_suspend [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_suspend [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_irq [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_irq [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_reg_wait [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_reg_wait [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_usb_disconnect [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_usb_disconnect [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_get_frame [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_get_frame [2022-02-20 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure r8a66597_bus_suspend [2022-02-20 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure r8a66597_bus_suspend [2022-02-20 22:35:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:35:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:35:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_r8a66597 [2022-02-20 22:35:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_r8a66597 [2022-02-20 22:35:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 22:35:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 22:35:15,359 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:35:15,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:35:16,159 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:35:19,592 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:35:19,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:35:19,606 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:35:19,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:35:19 BoogieIcfgContainer [2022-02-20 22:35:19,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:35:19,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:35:19,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:35:19,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:35:19,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:35:11" (1/3) ... [2022-02-20 22:35:19,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfa9d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:35:19, skipping insertion in model container [2022-02-20 22:35:19,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:35:14" (2/3) ... [2022-02-20 22:35:19,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfa9d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:35:19, skipping insertion in model container [2022-02-20 22:35:19,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:35:19" (3/3) ... [2022-02-20 22:35:19,614 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--usb--host--r8a66597-hcd.ko-entry_point.cil.out.i [2022-02-20 22:35:19,617 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:35:19,617 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:35:19,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:35:19,653 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 22:35:19,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:35:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 2281 states, 1546 states have (on average 1.3855109961190168) internal successors, (2142), 1633 states have internal predecessors, (2142), 619 states have call successors, (619), 115 states have call predecessors, (619), 114 states have return successors, (611), 589 states have call predecessors, (611), 611 states have call successors, (611) [2022-02-20 22:35:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-20 22:35:19,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:35:19,720 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:35:19,720 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:35:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:35:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1768488285, now seen corresponding path program 1 times [2022-02-20 22:35:19,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:35:19,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876344579] [2022-02-20 22:35:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:35:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:35:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:35:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:35:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {2284#true} is VALID [2022-02-20 22:35:20,108 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {2400#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:20,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,108 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {2284#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2284#true} is VALID [2022-02-20 22:35:20,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {2284#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2284#true} is VALID [2022-02-20 22:35:20,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2285#false} is VALID [2022-02-20 22:35:20,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,110 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2285#false} {2284#true} #6187#return; {2285#false} is VALID [2022-02-20 22:35:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:35:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:35:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {2284#true} is VALID [2022-02-20 22:35:20,138 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {2400#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:20,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,138 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {2284#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2284#true} is VALID [2022-02-20 22:35:20,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {2284#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2284#true} is VALID [2022-02-20 22:35:20,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2285#false} is VALID [2022-02-20 22:35:20,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,140 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2285#false} {2285#false} #6189#return; {2285#false} is VALID [2022-02-20 22:35:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:35:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:35:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {2284#true} is VALID [2022-02-20 22:35:20,167 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {2400#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:20,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,168 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2284#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2284#true} is VALID [2022-02-20 22:35:20,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {2284#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2284#true} is VALID [2022-02-20 22:35:20,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2285#false} is VALID [2022-02-20 22:35:20,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,169 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2285#false} {2285#false} #6191#return; {2285#false} is VALID [2022-02-20 22:35:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:35:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,195 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,196 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,196 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2284#true} {2285#false} #6193#return; {2285#false} is VALID [2022-02-20 22:35:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 22:35:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,214 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,214 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,215 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2284#true} {2285#false} #6195#return; {2285#false} is VALID [2022-02-20 22:35:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 22:35:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,232 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,233 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,234 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2284#true} {2285#false} #6197#return; {2285#false} is VALID [2022-02-20 22:35:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-02-20 22:35:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,250 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,251 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,251 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2284#true} {2285#false} #6199#return; {2285#false} is VALID [2022-02-20 22:35:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-02-20 22:35:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,268 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,269 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,269 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2284#true} {2285#false} #6201#return; {2285#false} is VALID [2022-02-20 22:35:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-20 22:35:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,286 INFO L272 TraceCheckUtils]: 1: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,287 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,287 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2284#true} {2285#false} #6203#return; {2285#false} is VALID [2022-02-20 22:35:20,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-02-20 22:35:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {2284#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 897 + ~hcd.offset; {2284#true} is VALID [2022-02-20 22:35:20,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2284#true} {2285#false} #5749#return; {2285#false} is VALID [2022-02-20 22:35:20,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-02-20 22:35:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {2440#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {2284#true} is VALID [2022-02-20 22:35:20,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2284#true} {2285#false} #5751#return; {2285#false} is VALID [2022-02-20 22:35:20,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-02-20 22:35:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:20,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {2284#true} ~r8a66597.base, ~r8a66597.offset := #in~r8a66597.base, #in~r8a66597.offset;~urb.base, ~urb.offset := #in~urb.base, #in~urb.offset;havoc ~tmp~23.base, ~tmp~23.offset;call #t~mem249 := read~int(~urb.base, 80 + ~urb.offset, 4); {2284#true} is VALID [2022-02-20 22:35:20,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume 0 == (if 0 == #t~mem249 / 256 then 0 else (if 1 == #t~mem249 / 256 then 1 else ~bitwiseAnd(#t~mem249 / 256, 127))) % 4294967296;havoc #t~mem249;#res.base, #res.offset := ~r8a66597.base, 92 + ~r8a66597.offset; {2284#true} is VALID [2022-02-20 22:35:20,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2285#false} #5753#return; {2285#false} is VALID [2022-02-20 22:35:20,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {2284#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(85, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(37, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(29, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(26, 10);call #Ultimate.allocInit(29, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(18, 13);call #Ultimate.allocInit(210, 14);call #Ultimate.allocInit(33, 15);call #Ultimate.allocInit(33, 16);call #Ultimate.allocInit(56, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(17, 19);call #Ultimate.allocInit(210, 20);call #Ultimate.allocInit(20, 21);call #Ultimate.allocInit(20, 22);call #Ultimate.allocInit(44, 23);call #Ultimate.allocInit(25, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(33, 27);call #Ultimate.allocInit(49, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(210, 31);call #Ultimate.allocInit(14, 32);call #Ultimate.allocInit(14, 33);call #Ultimate.allocInit(13, 34);call #Ultimate.allocInit(26, 35);call #Ultimate.allocInit(210, 36);call #Ultimate.allocInit(14, 37);call #Ultimate.allocInit(14, 38);call #Ultimate.allocInit(26, 39);call #Ultimate.allocInit(35, 40);call #Ultimate.allocInit(36, 41);call #Ultimate.allocInit(42, 42);call #Ultimate.allocInit(13, 43);call #Ultimate.allocInit(21, 44);call #Ultimate.allocInit(210, 45);call #Ultimate.allocInit(4, 46);call write~init~int(37, 46, 0, 1);call write~init~int(115, 46, 1, 1);call write~init~int(10, 46, 2, 1);call write~init~int(0, 46, 3, 1);call #Ultimate.allocInit(4, 47);call write~init~int(37, 47, 0, 1);call write~init~int(115, 47, 1, 1);call write~init~int(10, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(21, 48);call #Ultimate.allocInit(13, 49);call #Ultimate.allocInit(21, 50);call #Ultimate.allocInit(210, 51);call #Ultimate.allocInit(19, 52);call #Ultimate.allocInit(19, 53);call #Ultimate.allocInit(13, 54);call #Ultimate.allocInit(20, 55);call #Ultimate.allocInit(210, 56);call #Ultimate.allocInit(4, 57);call write~init~int(37, 57, 0, 1);call write~init~int(115, 57, 1, 1);call write~init~int(10, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(37, 58, 0, 1);call write~init~int(115, 58, 1, 1);call write~init~int(10, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(13, 60);call #Ultimate.allocInit(20, 61);call #Ultimate.allocInit(210, 62);call #Ultimate.allocInit(18, 63);call #Ultimate.allocInit(18, 64);call #Ultimate.allocInit(13, 65);call #Ultimate.allocInit(17, 66);call #Ultimate.allocInit(210, 67);call #Ultimate.allocInit(4, 68);call write~init~int(37, 68, 0, 1);call write~init~int(115, 68, 1, 1);call write~init~int(10, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(4, 69);call write~init~int(37, 69, 0, 1);call write~init~int(115, 69, 1, 1);call write~init~int(10, 69, 2, 1);call write~init~int(0, 69, 3, 1);call #Ultimate.allocInit(17, 70);call #Ultimate.allocInit(13, 71);call #Ultimate.allocInit(16, 72);call #Ultimate.allocInit(210, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(4, 75);call write~init~int(37, 75, 0, 1);call write~init~int(115, 75, 1, 1);call write~init~int(10, 75, 2, 1);call write~init~int(0, 75, 3, 1);call #Ultimate.allocInit(16, 76);call #Ultimate.allocInit(19, 77);call #Ultimate.allocInit(30, 78);call #Ultimate.allocInit(45, 79);call #Ultimate.allocInit(16, 80);call #Ultimate.allocInit(18, 81);call #Ultimate.allocInit(22, 82);call #Ultimate.allocInit(6, 83);call write~init~int(117, 83, 0, 1);call write~init~int(115, 83, 1, 1);call write~init~int(98, 83, 2, 1);call write~init~int(37, 83, 3, 1);call write~init~int(100, 83, 4, 1);call write~init~int(0, 83, 5, 1);call #Ultimate.allocInit(23, 84);call #Ultimate.allocInit(26, 85);call #Ultimate.allocInit(19, 86);~probed_4~0 := 0;~ldv_timer_1_3~0 := 0;~ldv_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_timer_list_3_1~0.base, ~ldv_timer_list_3_1~0.offset := 0, 0;~r8a66597_driver_group1~0.base, ~r8a66597_driver_group1~0.offset := 0, 0;~ldv_timer_list_3_2~0.base, ~ldv_timer_list_3_2~0.offset := 0, 0;~ldv_timer_2_2~0 := 0;~ldv_timer_3_3~0 := 0;~ldv_timer_2_3~0 := 0;~ldv_timer_1_0~0 := 0;~ldv_timer_list_3_3~0.base, ~ldv_timer_list_3_3~0.offset := 0, 0;~ldv_timer_3_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~r8a66597_hc_driver_group0~0.base, ~r8a66597_hc_driver_group0~0.offset := 0, 0;~ldv_timer_list_1_3~0.base, ~ldv_timer_list_1_3~0.offset := 0, 0;~ldv_timer_list_1_1~0.base, ~ldv_timer_list_1_1~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_timer_list_1_0~0.base, ~ldv_timer_list_1_0~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~r8a66597_dev_pm_ops_group1~0.base, ~r8a66597_dev_pm_ops_group1~0.offset := 0, 0;~ldv_timer_1_2~0 := 0;~ldv_timer_2_0~0 := 0;~ldv_timer_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_timer_list_1_2~0.base, ~ldv_timer_list_1_2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~r8a66597_hc_driver_group1~0.base, ~r8a66597_hc_driver_group1~0.offset := 0, 0;~ldv_timer_3_2~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_timer_3_0~0 := 0;~ldv_timer_list_3_0~0.base, ~ldv_timer_list_3_0~0.offset := 0, 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~#hcd_name~0.base, ~#hcd_name~0.offset := 87, 0;call #Ultimate.allocInit(13, 87);call write~init~int(114, ~#hcd_name~0.base, ~#hcd_name~0.offset, 1);call write~init~int(56, ~#hcd_name~0.base, 1 + ~#hcd_name~0.offset, 1);call write~init~int(97, ~#hcd_name~0.base, 2 + ~#hcd_name~0.offset, 1);call write~init~int(54, ~#hcd_name~0.base, 3 + ~#hcd_name~0.offset, 1);call write~init~int(54, ~#hcd_name~0.base, 4 + ~#hcd_name~0.offset, 1);call write~init~int(53, ~#hcd_name~0.base, 5 + ~#hcd_name~0.offset, 1);call write~init~int(57, ~#hcd_name~0.base, 6 + ~#hcd_name~0.offset, 1);call write~init~int(55, ~#hcd_name~0.base, 7 + ~#hcd_name~0.offset, 1);call write~init~int(95, ~#hcd_name~0.base, 8 + ~#hcd_name~0.offset, 1);call write~init~int(104, ~#hcd_name~0.base, 9 + ~#hcd_name~0.offset, 1);call write~init~int(99, ~#hcd_name~0.base, 10 + ~#hcd_name~0.offset, 1);call write~init~int(100, ~#hcd_name~0.base, 11 + ~#hcd_name~0.offset, 1);call write~init~int(0, ~#hcd_name~0.base, 12 + ~#hcd_name~0.offset, 1);~#r8a66597_hc_driver~0.base, ~#r8a66597_hc_driver~0.offset := 88, 0;call #Ultimate.allocInit(348, 88);call write~init~$Pointer$(~#hcd_name~0.base, ~#hcd_name~0.offset, ~#r8a66597_hc_driver~0.base, ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 8 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~int(3136, ~#r8a66597_hc_driver~0.base, 16 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_irq.base, #funAddr~r8a66597_irq.offset, ~#r8a66597_hc_driver~0.base, 24 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~int(32, ~#r8a66597_hc_driver~0.base, 32 + ~#r8a66597_hc_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 36 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_start.base, #funAddr~r8a66597_start.offset, ~#r8a66597_hc_driver~0.base, 44 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 52 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 60 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_stop.base, #funAddr~r8a66597_stop.offset, ~#r8a66597_hc_driver~0.base, 68 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 76 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_get_frame.base, #funAddr~r8a66597_get_frame.offset, ~#r8a66597_hc_driver~0.base, 84 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_urb_enqueue.base, #funAddr~r8a66597_urb_enqueue.offset, ~#r8a66597_hc_driver~0.base, 92 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_urb_dequeue.base, #funAddr~r8a66597_urb_dequeue.offset, ~#r8a66597_hc_driver~0.base, 100 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 108 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 116 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_endpoint_disable.base, #funAddr~r8a66597_endpoint_disable.offset, ~#r8a66597_hc_driver~0.base, 124 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 132 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_hub_status_data.base, #funAddr~r8a66597_hub_status_data.offset, ~#r8a66597_hc_driver~0.base, 140 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_hub_control.base, #funAddr~r8a66597_hub_control.offset, ~#r8a66597_hc_driver~0.base, 148 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_bus_suspend.base, #funAddr~r8a66597_bus_suspend.offset, ~#r8a66597_hc_driver~0.base, 156 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_bus_resume.base, #funAddr~r8a66597_bus_resume.offset, ~#r8a66597_hc_driver~0.base, 164 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 172 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 180 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 188 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 196 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 204 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 212 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 220 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 228 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 236 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 244 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 252 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 260 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 268 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 276 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 284 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 292 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 300 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 308 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 316 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 324 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 332 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 340 + ~#r8a66597_hc_driver~0.offset, 8);~#r8a66597_dev_pm_ops~0.base, ~#r8a66597_dev_pm_ops~0.offset := 89, 0;call #Ultimate.allocInit(184, 89);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 8 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_suspend.base, #funAddr~r8a66597_suspend.offset, ~#r8a66597_dev_pm_ops~0.base, 16 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_resume.base, #funAddr~r8a66597_resume.offset, ~#r8a66597_dev_pm_ops~0.base, 24 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 32 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 40 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_suspend.base, #funAddr~r8a66597_suspend.offset, ~#r8a66597_dev_pm_ops~0.base, 48 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_resume.base, #funAddr~r8a66597_resume.offset, ~#r8a66597_dev_pm_ops~0.base, 56 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 64 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 72 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 80 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 88 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 96 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 104 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 112 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 120 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 128 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 136 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 144 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 152 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 160 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 168 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 176 + ~#r8a66597_dev_pm_ops~0.offset, 8);~#r8a66597_driver~0.base, ~#r8a66597_driver~0.offset := 90, 0;call #Ultimate.allocInit(166, 90);call write~init~$Pointer$(#funAddr~r8a66597_probe.base, #funAddr~r8a66597_probe.offset, ~#r8a66597_driver~0.base, ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_remove.base, #funAddr~r8a66597_remove.offset, ~#r8a66597_driver~0.base, 8 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 16 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 24 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 32 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(~#hcd_name~0.base, ~#hcd_name~0.offset, ~#r8a66597_driver~0.base, 40 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 48 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 56 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 64 + ~#r8a66597_driver~0.offset, 8);call write~init~int(0, ~#r8a66597_driver~0.base, 72 + ~#r8a66597_driver~0.offset, 1);call write~init~int(0, ~#r8a66597_driver~0.base, 73 + ~#r8a66597_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 77 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 85 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 93 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 101 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 109 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 117 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 125 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 133 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(~#r8a66597_dev_pm_ops~0.base, ~#r8a66597_dev_pm_ops~0.offset, ~#r8a66597_driver~0.base, 141 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 149 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 157 + ~#r8a66597_driver~0.offset, 8);call write~init~int(0, ~#r8a66597_driver~0.base, 165 + ~#r8a66597_driver~0.offset, 1);~ldv_retval_14~0 := 0;~ldv_retval_2~0 := 0;~ldv_retval_12~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_11~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_15~0 := 0;~ldv_retval_16~0 := 0;~ldv_retval_13~0 := 0;~ldv_retval_10~0 := 0;~ldv_retval_9~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_8~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_7~0 := 0;~ldv_spin~0 := 0; {2284#true} is VALID [2022-02-20 22:35:20,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1030#1.base, main_#t~ret1030#1.offset, main_#t~ret1031#1.base, main_#t~ret1031#1.offset, main_#t~ret1032#1.base, main_#t~ret1032#1.offset, main_#t~ret1033#1.base, main_#t~ret1033#1.offset, main_#t~ret1034#1.base, main_#t~ret1034#1.offset, main_#t~ret1035#1.base, main_#t~ret1035#1.offset, main_#t~ret1036#1.base, main_#t~ret1036#1.offset, main_#t~ret1037#1.base, main_#t~ret1037#1.offset, main_#t~ret1038#1.base, main_#t~ret1038#1.offset, main_#t~nondet1039#1, main_#t~switch1040#1, main_#t~nondet1041#1, main_#t~switch1042#1, main_#t~ret1043#1, main_#t~mem1044#1, main_#t~ret1045#1, main_#t~mem1046#1, main_#t~ret1047#1, main_#t~ret1048#1, main_#t~ret1049#1, main_#t~ret1050#1, main_#t~ret1051#1, main_#t~ret1052#1, main_#t~ret1053#1, main_#t~ret1054#1, main_#t~ret1055#1, main_#t~mem1056#1, main_#t~ret1057#1, main_#t~mem1058#1, main_#t~ret1059#1, main_#t~mem1060#1, main_#t~mem1061#1, main_#t~mem1062#1, main_#t~mem1063#1, main_#t~ret1064#1, main_#t~mem1065#1, main_#t~mem1066#1, main_#t~mem1067#1, main_#t~mem1068#1, main_#t~ret1069#1, main_#t~ret1070#1, main_#t~ret1071#1, main_#t~nondet1072#1, main_#t~switch1073#1, main_#t~ret1074#1, main_#t~ret1075#1, main_#t~ret1076#1, main_#t~nondet1077#1, main_#t~switch1078#1, main_#t~ret1079#1, main_#t~nondet1080#1, main_#t~switch1081#1, main_#t~ret1082#1, main_#t~ret1083#1, main_#t~ret1084#1, main_#t~ret1085#1, main_#t~ret1086#1, main_#t~ret1087#1, main_#t~ret1088#1, main_#t~ret1089#1, main_#t~ret1090#1, main_#t~ret1091#1, main_#t~ret1092#1, main_#t~ret1093#1, main_#t~ret1094#1, main_#t~ret1095#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~88#1.base, main_~tmp~88#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~16#1, main_~tmp___3~12#1, main_~tmp___4~6#1, main_~tmp___5~2#1, main_~tmp___6~2#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~88#1.base, main_~tmp~88#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~tmp___2~16#1;havoc main_~tmp___3~12#1;havoc main_~tmp___4~6#1;havoc main_~tmp___5~2#1;havoc main_~tmp___6~2#1; {2284#true} is VALID [2022-02-20 22:35:20,314 INFO L272 TraceCheckUtils]: 2: Hoare triple {2284#true} call main_#t~ret1030#1.base, main_#t~ret1030#1.offset := ldv_init_zalloc(72); {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:35:20,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {2284#true} is VALID [2022-02-20 22:35:20,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {2284#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {2400#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:20,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,316 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {2284#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2284#true} is VALID [2022-02-20 22:35:20,316 INFO L272 TraceCheckUtils]: 9: Hoare triple {2284#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2284#true} is VALID [2022-02-20 22:35:20,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,317 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2285#false} is VALID [2022-02-20 22:35:20,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,318 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2285#false} {2284#true} #6187#return; {2285#false} is VALID [2022-02-20 22:35:20,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {2285#false} main_~tmp~88#1.base, main_~tmp~88#1.offset := main_#t~ret1030#1.base, main_#t~ret1030#1.offset;havoc main_#t~ret1030#1.base, main_#t~ret1030#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~88#1.base, main_~tmp~88#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {2285#false} call main_#t~ret1031#1.base, main_#t~ret1031#1.offset := ldv_init_zalloc(1); {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:35:20,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {2284#true} is VALID [2022-02-20 22:35:20,319 INFO L272 TraceCheckUtils]: 20: Hoare triple {2284#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {2400#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:20,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,320 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {2284#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2284#true} is VALID [2022-02-20 22:35:20,320 INFO L272 TraceCheckUtils]: 25: Hoare triple {2284#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2284#true} is VALID [2022-02-20 22:35:20,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,321 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {2285#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2285#false} is VALID [2022-02-20 22:35:20,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,321 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2285#false} {2285#false} #6189#return; {2285#false} is VALID [2022-02-20 22:35:20,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#false} main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset := main_#t~ret1031#1.base, main_#t~ret1031#1.offset;havoc main_#t~ret1031#1.base, main_#t~ret1031#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,322 INFO L272 TraceCheckUtils]: 34: Hoare triple {2285#false} call main_#t~ret1032#1.base, main_#t~ret1032#1.offset := ldv_init_zalloc(1); {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:35:20,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {2392#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {2284#true} is VALID [2022-02-20 22:35:20,323 INFO L272 TraceCheckUtils]: 36: Hoare triple {2284#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {2400#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:20,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {2400#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2284#true} is VALID [2022-02-20 22:35:20,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,323 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2284#true} {2284#true} #5587#return; {2284#true} is VALID [2022-02-20 22:35:20,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {2284#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {2284#true} is VALID [2022-02-20 22:35:20,324 INFO L272 TraceCheckUtils]: 41: Hoare triple {2284#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {2284#true} is VALID [2022-02-20 22:35:20,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {2284#true} ~cond := #in~cond; {2284#true} is VALID [2022-02-20 22:35:20,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {2284#true} assume 0 == ~cond;assume false; {2285#false} is VALID [2022-02-20 22:35:20,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,324 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2285#false} {2284#true} #5589#return; {2285#false} is VALID [2022-02-20 22:35:20,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {2285#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {2285#false} is VALID [2022-02-20 22:35:20,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {2285#false} assume true; {2285#false} is VALID [2022-02-20 22:35:20,325 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2285#false} {2285#false} #6191#return; {2285#false} is VALID [2022-02-20 22:35:20,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {2285#false} main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset := main_#t~ret1032#1.base, main_#t~ret1032#1.offset;havoc main_#t~ret1032#1.base, main_#t~ret1032#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset;assume { :begin_inline_ldv_initialize } true; {2285#false} is VALID [2022-02-20 22:35:20,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {2285#false} assume { :end_inline_ldv_initialize } true; {2285#false} is VALID [2022-02-20 22:35:20,325 INFO L272 TraceCheckUtils]: 51: Hoare triple {2285#false} call main_#t~ret1033#1.base, main_#t~ret1033#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 2); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,327 INFO L272 TraceCheckUtils]: 53: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,327 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,328 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2284#true} {2285#false} #6193#return; {2285#false} is VALID [2022-02-20 22:35:20,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {2285#false} havoc main_#t~ret1033#1.base, main_#t~ret1033#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,328 INFO L272 TraceCheckUtils]: 62: Hoare triple {2285#false} call main_#t~ret1034#1.base, main_#t~ret1034#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 2); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,329 INFO L272 TraceCheckUtils]: 64: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,330 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,330 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {2284#true} {2285#false} #6195#return; {2285#false} is VALID [2022-02-20 22:35:20,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {2285#false} havoc main_#t~ret1034#1.base, main_#t~ret1034#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,330 INFO L272 TraceCheckUtils]: 73: Hoare triple {2285#false} call main_#t~ret1035#1.base, main_#t~ret1035#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,332 INFO L272 TraceCheckUtils]: 75: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,332 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,333 INFO L290 TraceCheckUtils]: 81: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,333 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {2284#true} {2285#false} #6197#return; {2285#false} is VALID [2022-02-20 22:35:20,333 INFO L290 TraceCheckUtils]: 83: Hoare triple {2285#false} havoc main_#t~ret1035#1.base, main_#t~ret1035#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,333 INFO L272 TraceCheckUtils]: 84: Hoare triple {2285#false} call main_#t~ret1036#1.base, main_#t~ret1036#1.offset := ldv_memset(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,334 INFO L272 TraceCheckUtils]: 86: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,334 INFO L290 TraceCheckUtils]: 87: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,335 INFO L290 TraceCheckUtils]: 88: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,335 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,335 INFO L290 TraceCheckUtils]: 91: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,335 INFO L290 TraceCheckUtils]: 92: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,335 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {2284#true} {2285#false} #6199#return; {2285#false} is VALID [2022-02-20 22:35:20,335 INFO L290 TraceCheckUtils]: 94: Hoare triple {2285#false} havoc main_#t~ret1036#1.base, main_#t~ret1036#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,336 INFO L272 TraceCheckUtils]: 95: Hoare triple {2285#false} call main_#t~ret1037#1.base, main_#t~ret1037#1.offset := ldv_memset(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 2); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,336 INFO L290 TraceCheckUtils]: 96: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,337 INFO L272 TraceCheckUtils]: 97: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,337 INFO L290 TraceCheckUtils]: 99: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,337 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,337 INFO L290 TraceCheckUtils]: 102: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,338 INFO L290 TraceCheckUtils]: 103: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,338 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2284#true} {2285#false} #6201#return; {2285#false} is VALID [2022-02-20 22:35:20,338 INFO L290 TraceCheckUtils]: 105: Hoare triple {2285#false} havoc main_#t~ret1037#1.base, main_#t~ret1037#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,338 INFO L272 TraceCheckUtils]: 106: Hoare triple {2285#false} call main_#t~ret1038#1.base, main_#t~ret1038#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 2); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,338 INFO L290 TraceCheckUtils]: 107: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,339 INFO L272 TraceCheckUtils]: 108: Hoare triple {2284#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:20,339 INFO L290 TraceCheckUtils]: 109: Hoare triple {2415#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {2284#true} is VALID [2022-02-20 22:35:20,339 INFO L290 TraceCheckUtils]: 110: Hoare triple {2284#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {2284#true} is VALID [2022-02-20 22:35:20,340 INFO L290 TraceCheckUtils]: 111: Hoare triple {2284#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {2284#true} is VALID [2022-02-20 22:35:20,340 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {2284#true} {2284#true} #5655#return; {2284#true} is VALID [2022-02-20 22:35:20,340 INFO L290 TraceCheckUtils]: 113: Hoare triple {2284#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {2284#true} is VALID [2022-02-20 22:35:20,340 INFO L290 TraceCheckUtils]: 114: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,340 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {2284#true} {2285#false} #6203#return; {2285#false} is VALID [2022-02-20 22:35:20,340 INFO L290 TraceCheckUtils]: 116: Hoare triple {2285#false} havoc main_#t~ret1038#1.base, main_#t~ret1038#1.offset;~ldv_state_variable_6~0 := 0;~ldv_state_variable_4~0 := 0;assume { :begin_inline_timer_init_1 } true;~ldv_timer_1_0~0 := 0;~ldv_timer_1_1~0 := 0;~ldv_timer_1_2~0 := 0;~ldv_timer_1_3~0 := 0; {2285#false} is VALID [2022-02-20 22:35:20,340 INFO L290 TraceCheckUtils]: 117: Hoare triple {2285#false} assume { :end_inline_timer_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;assume { :begin_inline_timer_init_3 } true;~ldv_timer_3_0~0 := 0;~ldv_timer_3_1~0 := 0;~ldv_timer_3_2~0 := 0;~ldv_timer_3_3~0 := 0; {2285#false} is VALID [2022-02-20 22:35:20,341 INFO L290 TraceCheckUtils]: 118: Hoare triple {2285#false} assume { :end_inline_timer_init_3 } true;~ldv_state_variable_3~0 := 1;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {2285#false} is VALID [2022-02-20 22:35:20,341 INFO L290 TraceCheckUtils]: 119: Hoare triple {2285#false} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1;~ldv_state_variable_5~0 := 0; {2285#false} is VALID [2022-02-20 22:35:20,341 INFO L290 TraceCheckUtils]: 120: Hoare triple {2285#false} assume -2147483648 <= main_#t~nondet1039#1 && main_#t~nondet1039#1 <= 2147483647;main_~tmp___2~16#1 := main_#t~nondet1039#1;havoc main_#t~nondet1039#1;main_#t~switch1040#1 := 0 == main_~tmp___2~16#1; {2285#false} is VALID [2022-02-20 22:35:20,341 INFO L290 TraceCheckUtils]: 121: Hoare triple {2285#false} assume main_#t~switch1040#1; {2285#false} is VALID [2022-02-20 22:35:20,341 INFO L290 TraceCheckUtils]: 122: Hoare triple {2285#false} assume 0 != ~ldv_state_variable_6~0;assume -2147483648 <= main_#t~nondet1041#1 && main_#t~nondet1041#1 <= 2147483647;main_~tmp___3~12#1 := main_#t~nondet1041#1;havoc main_#t~nondet1041#1;main_#t~switch1042#1 := 0 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,341 INFO L290 TraceCheckUtils]: 123: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 1 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 124: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 2 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 125: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 3 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 126: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 4 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 127: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 5 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 128: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 6 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 129: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 7 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,342 INFO L290 TraceCheckUtils]: 130: Hoare triple {2285#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 8 == main_~tmp___3~12#1; {2285#false} is VALID [2022-02-20 22:35:20,343 INFO L290 TraceCheckUtils]: 131: Hoare triple {2285#false} assume main_#t~switch1042#1; {2285#false} is VALID [2022-02-20 22:35:20,343 INFO L290 TraceCheckUtils]: 132: Hoare triple {2285#false} assume 1 == ~ldv_state_variable_6~0;call main_#t~mem1056#1 := read~int(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 4); {2285#false} is VALID [2022-02-20 22:35:20,343 INFO L272 TraceCheckUtils]: 133: Hoare triple {2285#false} call main_#t~ret1057#1 := r8a66597_urb_enqueue(~r8a66597_hc_driver_group1~0.base, ~r8a66597_hc_driver_group1~0.offset, ~r8a66597_hc_driver_group0~0.base, ~r8a66597_hc_driver_group0~0.offset, main_#t~mem1056#1); {2285#false} is VALID [2022-02-20 22:35:20,343 INFO L290 TraceCheckUtils]: 134: Hoare triple {2285#false} ~hcd#1.base, ~hcd#1.offset := #in~hcd#1.base, #in~hcd#1.offset;~urb#1.base, ~urb#1.offset := #in~urb#1.base, #in~urb#1.offset;~mem_flags#1 := #in~mem_flags#1;havoc ~hep~0#1.base, ~hep~0#1.offset;havoc ~r8a66597~6#1.base, ~r8a66597~6#1.offset;havoc ~tmp~69#1.base, ~tmp~69#1.offset;havoc ~td~11#1.base, ~td~11#1.offset;havoc ~ret~2#1;havoc ~request~0#1;havoc ~flags~3#1;havoc ~tmp___0~39#1.base, ~tmp___0~39#1.offset;havoc ~tmp___1~19#1;havoc ~tmp___2~12#1;havoc ~tmp___3~9#1;havoc ~tmp___4~4#1;call #t~mem827#1.base, #t~mem827#1.offset := read~$Pointer$(~urb#1.base, 72 + ~urb#1.offset, 8);~hep~0#1.base, ~hep~0#1.offset := #t~mem827#1.base, #t~mem827#1.offset;havoc #t~mem827#1.base, #t~mem827#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,343 INFO L272 TraceCheckUtils]: 135: Hoare triple {2285#false} call #t~ret828#1.base, #t~ret828#1.offset := hcd_to_r8a66597(~hcd#1.base, ~hcd#1.offset); {2284#true} is VALID [2022-02-20 22:35:20,343 INFO L290 TraceCheckUtils]: 136: Hoare triple {2284#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 897 + ~hcd.offset; {2284#true} is VALID [2022-02-20 22:35:20,344 INFO L290 TraceCheckUtils]: 137: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,344 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {2284#true} {2285#false} #5749#return; {2285#false} is VALID [2022-02-20 22:35:20,344 INFO L290 TraceCheckUtils]: 139: Hoare triple {2285#false} ~tmp~69#1.base, ~tmp~69#1.offset := #t~ret828#1.base, #t~ret828#1.offset;havoc #t~ret828#1.base, #t~ret828#1.offset;~r8a66597~6#1.base, ~r8a66597~6#1.offset := ~tmp~69#1.base, ~tmp~69#1.offset;~td~11#1.base, ~td~11#1.offset := 0, 0;~request~0#1 := 0; {2285#false} is VALID [2022-02-20 22:35:20,344 INFO L272 TraceCheckUtils]: 140: Hoare triple {2285#false} call ldv_spin_lock(); {2440#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:35:20,344 INFO L290 TraceCheckUtils]: 141: Hoare triple {2440#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {2284#true} is VALID [2022-02-20 22:35:20,344 INFO L290 TraceCheckUtils]: 142: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,344 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {2284#true} {2285#false} #5751#return; {2285#false} is VALID [2022-02-20 22:35:20,345 INFO L272 TraceCheckUtils]: 144: Hoare triple {2285#false} call #t~ret829#1.base, #t~ret829#1.offset := get_urb_to_r8a66597_dev(~r8a66597~6#1.base, ~r8a66597~6#1.offset, ~urb#1.base, ~urb#1.offset); {2284#true} is VALID [2022-02-20 22:35:20,345 INFO L290 TraceCheckUtils]: 145: Hoare triple {2284#true} ~r8a66597.base, ~r8a66597.offset := #in~r8a66597.base, #in~r8a66597.offset;~urb.base, ~urb.offset := #in~urb.base, #in~urb.offset;havoc ~tmp~23.base, ~tmp~23.offset;call #t~mem249 := read~int(~urb.base, 80 + ~urb.offset, 4); {2284#true} is VALID [2022-02-20 22:35:20,345 INFO L290 TraceCheckUtils]: 146: Hoare triple {2284#true} assume 0 == (if 0 == #t~mem249 / 256 then 0 else (if 1 == #t~mem249 / 256 then 1 else ~bitwiseAnd(#t~mem249 / 256, 127))) % 4294967296;havoc #t~mem249;#res.base, #res.offset := ~r8a66597.base, 92 + ~r8a66597.offset; {2284#true} is VALID [2022-02-20 22:35:20,345 INFO L290 TraceCheckUtils]: 147: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-02-20 22:35:20,345 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {2284#true} {2285#false} #5753#return; {2285#false} is VALID [2022-02-20 22:35:20,345 INFO L290 TraceCheckUtils]: 149: Hoare triple {2285#false} ~tmp___0~39#1.base, ~tmp___0~39#1.offset := #t~ret829#1.base, #t~ret829#1.offset;havoc #t~ret829#1.base, #t~ret829#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,345 INFO L290 TraceCheckUtils]: 150: Hoare triple {2285#false} assume !(0 == (~tmp___0~39#1.base + ~tmp___0~39#1.offset) % 18446744073709551616);assume { :begin_inline_usb_hcd_link_urb_to_ep } true;usb_hcd_link_urb_to_ep_#in~arg0#1.base, usb_hcd_link_urb_to_ep_#in~arg0#1.offset, usb_hcd_link_urb_to_ep_#in~arg1#1.base, usb_hcd_link_urb_to_ep_#in~arg1#1.offset := ~hcd#1.base, ~hcd#1.offset, ~urb#1.base, ~urb#1.offset;havoc usb_hcd_link_urb_to_ep_#res#1;havoc usb_hcd_link_urb_to_ep_#t~nondet1136#1, usb_hcd_link_urb_to_ep_~arg0#1.base, usb_hcd_link_urb_to_ep_~arg0#1.offset, usb_hcd_link_urb_to_ep_~arg1#1.base, usb_hcd_link_urb_to_ep_~arg1#1.offset;usb_hcd_link_urb_to_ep_~arg0#1.base, usb_hcd_link_urb_to_ep_~arg0#1.offset := usb_hcd_link_urb_to_ep_#in~arg0#1.base, usb_hcd_link_urb_to_ep_#in~arg0#1.offset;usb_hcd_link_urb_to_ep_~arg1#1.base, usb_hcd_link_urb_to_ep_~arg1#1.offset := usb_hcd_link_urb_to_ep_#in~arg1#1.base, usb_hcd_link_urb_to_ep_#in~arg1#1.offset;assume -2147483648 <= usb_hcd_link_urb_to_ep_#t~nondet1136#1 && usb_hcd_link_urb_to_ep_#t~nondet1136#1 <= 2147483647;usb_hcd_link_urb_to_ep_#res#1 := usb_hcd_link_urb_to_ep_#t~nondet1136#1;havoc usb_hcd_link_urb_to_ep_#t~nondet1136#1; {2285#false} is VALID [2022-02-20 22:35:20,346 INFO L290 TraceCheckUtils]: 151: Hoare triple {2285#false} #t~ret830#1 := usb_hcd_link_urb_to_ep_#res#1;assume { :end_inline_usb_hcd_link_urb_to_ep } true;assume -2147483648 <= #t~ret830#1 && #t~ret830#1 <= 2147483647;~ret~2#1 := #t~ret830#1;havoc #t~ret830#1; {2285#false} is VALID [2022-02-20 22:35:20,346 INFO L290 TraceCheckUtils]: 152: Hoare triple {2285#false} assume !(0 != ~ret~2#1);call #t~mem831#1.base, #t~mem831#1.offset := read~$Pointer$(~hep~0#1.base, 31 + ~hep~0#1.offset, 8); {2285#false} is VALID [2022-02-20 22:35:20,346 INFO L290 TraceCheckUtils]: 153: Hoare triple {2285#false} assume 0 == (#t~mem831#1.base + #t~mem831#1.offset) % 18446744073709551616;havoc #t~mem831#1.base, #t~mem831#1.offset; {2285#false} is VALID [2022-02-20 22:35:20,346 INFO L272 TraceCheckUtils]: 154: Hoare triple {2285#false} call #t~ret832#1.base, #t~ret832#1.offset := kzalloc(80, 32); {2285#false} is VALID [2022-02-20 22:35:20,346 INFO L290 TraceCheckUtils]: 155: Hoare triple {2285#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~91#1.base, ~tmp~91#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {2285#false} is VALID [2022-02-20 22:35:20,346 INFO L290 TraceCheckUtils]: 156: Hoare triple {2285#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {2285#false} is VALID [2022-02-20 22:35:20,347 INFO L272 TraceCheckUtils]: 157: Hoare triple {2285#false} call ldv_error(); {2285#false} is VALID [2022-02-20 22:35:20,347 INFO L290 TraceCheckUtils]: 158: Hoare triple {2285#false} assume !false; {2285#false} is VALID [2022-02-20 22:35:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-02-20 22:35:20,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:35:20,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876344579] [2022-02-20 22:35:20,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876344579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:35:20,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:35:20,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:35:20,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049609151] [2022-02-20 22:35:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:35:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-02-20 22:35:20,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:35:20,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 22:35:20,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:35:20,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:35:20,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:35:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:35:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:35:20,547 INFO L87 Difference]: Start difference. First operand has 2281 states, 1546 states have (on average 1.3855109961190168) internal successors, (2142), 1633 states have internal predecessors, (2142), 619 states have call successors, (619), 115 states have call predecessors, (619), 114 states have return successors, (611), 589 states have call predecessors, (611), 611 states have call successors, (611) Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 22:35:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:35:46,674 INFO L93 Difference]: Finished difference Result 5125 states and 7862 transitions. [2022-02-20 22:35:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:35:46,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-02-20 22:35:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:35:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 22:35:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7862 transitions. [2022-02-20 22:35:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 22:35:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7862 transitions. [2022-02-20 22:35:47,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 7862 transitions. [2022-02-20 22:35:53,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7862 edges. 7862 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:35:54,363 INFO L225 Difference]: With dead ends: 5125 [2022-02-20 22:35:54,363 INFO L226 Difference]: Without dead ends: 2828 [2022-02-20 22:35:54,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:35:54,390 INFO L933 BasicCegarLoop]: 2720 mSDtfsCounter, 4821 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 4602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4951 SdHoareTripleChecker+Valid, 4564 SdHoareTripleChecker+Invalid, 6897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4602 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:35:54,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4951 Valid, 4564 Invalid, 6897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4602 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-02-20 22:35:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2022-02-20 22:35:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2260. [2022-02-20 22:35:54,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:35:54,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2828 states. Second operand has 2260 states, 1535 states have (on average 1.3576547231270357) internal successors, (2084), 1612 states have internal predecessors, (2084), 611 states have call successors, (611), 114 states have call predecessors, (611), 113 states have return successors, (610), 588 states have call predecessors, (610), 610 states have call successors, (610) [2022-02-20 22:35:54,581 INFO L74 IsIncluded]: Start isIncluded. First operand 2828 states. Second operand has 2260 states, 1535 states have (on average 1.3576547231270357) internal successors, (2084), 1612 states have internal predecessors, (2084), 611 states have call successors, (611), 114 states have call predecessors, (611), 113 states have return successors, (610), 588 states have call predecessors, (610), 610 states have call successors, (610) [2022-02-20 22:35:54,596 INFO L87 Difference]: Start difference. First operand 2828 states. Second operand has 2260 states, 1535 states have (on average 1.3576547231270357) internal successors, (2084), 1612 states have internal predecessors, (2084), 611 states have call successors, (611), 114 states have call predecessors, (611), 113 states have return successors, (610), 588 states have call predecessors, (610), 610 states have call successors, (610) [2022-02-20 22:35:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:35:54,893 INFO L93 Difference]: Finished difference Result 2828 states and 4285 transitions. [2022-02-20 22:35:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4285 transitions. [2022-02-20 22:35:54,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:35:54,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:35:54,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 2260 states, 1535 states have (on average 1.3576547231270357) internal successors, (2084), 1612 states have internal predecessors, (2084), 611 states have call successors, (611), 114 states have call predecessors, (611), 113 states have return successors, (610), 588 states have call predecessors, (610), 610 states have call successors, (610) Second operand 2828 states. [2022-02-20 22:35:54,923 INFO L87 Difference]: Start difference. First operand has 2260 states, 1535 states have (on average 1.3576547231270357) internal successors, (2084), 1612 states have internal predecessors, (2084), 611 states have call successors, (611), 114 states have call predecessors, (611), 113 states have return successors, (610), 588 states have call predecessors, (610), 610 states have call successors, (610) Second operand 2828 states. [2022-02-20 22:35:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:35:55,233 INFO L93 Difference]: Finished difference Result 2828 states and 4285 transitions. [2022-02-20 22:35:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4285 transitions. [2022-02-20 22:35:55,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:35:55,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:35:55,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:35:55,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:35:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 1535 states have (on average 1.3576547231270357) internal successors, (2084), 1612 states have internal predecessors, (2084), 611 states have call successors, (611), 114 states have call predecessors, (611), 113 states have return successors, (610), 588 states have call predecessors, (610), 610 states have call successors, (610) [2022-02-20 22:35:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3305 transitions. [2022-02-20 22:35:55,531 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3305 transitions. Word has length 159 [2022-02-20 22:35:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:35:55,532 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 3305 transitions. [2022-02-20 22:35:55,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 22:35:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3305 transitions. [2022-02-20 22:35:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-20 22:35:55,541 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:35:55,542 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:35:55,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:35:55,542 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:35:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:35:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1460017047, now seen corresponding path program 1 times [2022-02-20 22:35:55,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:35:55,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130945678] [2022-02-20 22:35:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:35:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:35:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:35:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:35:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {18601#true} is VALID [2022-02-20 22:35:55,782 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {18718#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:55,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,783 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {18601#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,783 INFO L272 TraceCheckUtils]: 6: Hoare triple {18601#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {18601#true} is VALID [2022-02-20 22:35:55,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {18601#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,789 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18601#true} {18601#true} #6187#return; {18601#true} is VALID [2022-02-20 22:35:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:35:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:35:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {18601#true} is VALID [2022-02-20 22:35:55,816 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {18718#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:55,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {18601#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {18601#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,818 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {18601#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,819 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18601#true} {18601#true} #6189#return; {18601#true} is VALID [2022-02-20 22:35:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:35:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:35:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {18601#true} is VALID [2022-02-20 22:35:55,840 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {18718#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:55,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,841 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {18601#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {18601#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {18601#true} is VALID [2022-02-20 22:35:55,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {18601#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,848 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18601#true} {18601#true} #6191#return; {18601#true} is VALID [2022-02-20 22:35:55,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:35:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,869 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:55,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,872 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,875 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18601#true} {18601#true} #6193#return; {18601#true} is VALID [2022-02-20 22:35:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 22:35:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,890 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:55,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,890 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,891 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18601#true} {18601#true} #6195#return; {18601#true} is VALID [2022-02-20 22:35:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 22:35:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,904 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:55,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,905 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,905 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18601#true} {18601#true} #6197#return; {18601#true} is VALID [2022-02-20 22:35:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-02-20 22:35:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,921 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:55,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,922 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,922 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18601#true} {18601#true} #6199#return; {18601#true} is VALID [2022-02-20 22:35:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-02-20 22:35:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,938 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:55,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,939 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,939 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18601#true} {18601#true} #6201#return; {18601#true} is VALID [2022-02-20 22:35:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-20 22:35:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:35:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,966 INFO L272 TraceCheckUtils]: 1: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:55,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:55,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:55,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:55,967 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:55,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:55,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,967 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18601#true} {18601#true} #6203#return; {18601#true} is VALID [2022-02-20 22:35:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-02-20 22:35:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 897 + ~hcd.offset; {18601#true} is VALID [2022-02-20 22:35:55,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18601#true} {18602#false} #5749#return; {18602#false} is VALID [2022-02-20 22:35:55,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-02-20 22:35:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {18758#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {18601#true} is VALID [2022-02-20 22:35:55,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18601#true} {18602#false} #5751#return; {18602#false} is VALID [2022-02-20 22:35:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-02-20 22:35:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:35:55,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#true} ~r8a66597.base, ~r8a66597.offset := #in~r8a66597.base, #in~r8a66597.offset;~urb.base, ~urb.offset := #in~urb.base, #in~urb.offset;havoc ~tmp~23.base, ~tmp~23.offset;call #t~mem249 := read~int(~urb.base, 80 + ~urb.offset, 4); {18601#true} is VALID [2022-02-20 22:35:55,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume 0 == (if 0 == #t~mem249 / 256 then 0 else (if 1 == #t~mem249 / 256 then 1 else ~bitwiseAnd(#t~mem249 / 256, 127))) % 4294967296;havoc #t~mem249;#res.base, #res.offset := ~r8a66597.base, 92 + ~r8a66597.offset; {18601#true} is VALID [2022-02-20 22:35:55,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18601#true} {18602#false} #5753#return; {18602#false} is VALID [2022-02-20 22:35:55,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#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(85, 2);call #Ultimate.allocInit(20, 3);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(37, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(29, 7);call #Ultimate.allocInit(29, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(26, 10);call #Ultimate.allocInit(29, 11);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(18, 13);call #Ultimate.allocInit(210, 14);call #Ultimate.allocInit(33, 15);call #Ultimate.allocInit(33, 16);call #Ultimate.allocInit(56, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(17, 19);call #Ultimate.allocInit(210, 20);call #Ultimate.allocInit(20, 21);call #Ultimate.allocInit(20, 22);call #Ultimate.allocInit(44, 23);call #Ultimate.allocInit(25, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(33, 26);call #Ultimate.allocInit(33, 27);call #Ultimate.allocInit(49, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(21, 30);call #Ultimate.allocInit(210, 31);call #Ultimate.allocInit(14, 32);call #Ultimate.allocInit(14, 33);call #Ultimate.allocInit(13, 34);call #Ultimate.allocInit(26, 35);call #Ultimate.allocInit(210, 36);call #Ultimate.allocInit(14, 37);call #Ultimate.allocInit(14, 38);call #Ultimate.allocInit(26, 39);call #Ultimate.allocInit(35, 40);call #Ultimate.allocInit(36, 41);call #Ultimate.allocInit(42, 42);call #Ultimate.allocInit(13, 43);call #Ultimate.allocInit(21, 44);call #Ultimate.allocInit(210, 45);call #Ultimate.allocInit(4, 46);call write~init~int(37, 46, 0, 1);call write~init~int(115, 46, 1, 1);call write~init~int(10, 46, 2, 1);call write~init~int(0, 46, 3, 1);call #Ultimate.allocInit(4, 47);call write~init~int(37, 47, 0, 1);call write~init~int(115, 47, 1, 1);call write~init~int(10, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(21, 48);call #Ultimate.allocInit(13, 49);call #Ultimate.allocInit(21, 50);call #Ultimate.allocInit(210, 51);call #Ultimate.allocInit(19, 52);call #Ultimate.allocInit(19, 53);call #Ultimate.allocInit(13, 54);call #Ultimate.allocInit(20, 55);call #Ultimate.allocInit(210, 56);call #Ultimate.allocInit(4, 57);call write~init~int(37, 57, 0, 1);call write~init~int(115, 57, 1, 1);call write~init~int(10, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(37, 58, 0, 1);call write~init~int(115, 58, 1, 1);call write~init~int(10, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(20, 59);call #Ultimate.allocInit(13, 60);call #Ultimate.allocInit(20, 61);call #Ultimate.allocInit(210, 62);call #Ultimate.allocInit(18, 63);call #Ultimate.allocInit(18, 64);call #Ultimate.allocInit(13, 65);call #Ultimate.allocInit(17, 66);call #Ultimate.allocInit(210, 67);call #Ultimate.allocInit(4, 68);call write~init~int(37, 68, 0, 1);call write~init~int(115, 68, 1, 1);call write~init~int(10, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(4, 69);call write~init~int(37, 69, 0, 1);call write~init~int(115, 69, 1, 1);call write~init~int(10, 69, 2, 1);call write~init~int(0, 69, 3, 1);call #Ultimate.allocInit(17, 70);call #Ultimate.allocInit(13, 71);call #Ultimate.allocInit(16, 72);call #Ultimate.allocInit(210, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(4, 75);call write~init~int(37, 75, 0, 1);call write~init~int(115, 75, 1, 1);call write~init~int(10, 75, 2, 1);call write~init~int(0, 75, 3, 1);call #Ultimate.allocInit(16, 76);call #Ultimate.allocInit(19, 77);call #Ultimate.allocInit(30, 78);call #Ultimate.allocInit(45, 79);call #Ultimate.allocInit(16, 80);call #Ultimate.allocInit(18, 81);call #Ultimate.allocInit(22, 82);call #Ultimate.allocInit(6, 83);call write~init~int(117, 83, 0, 1);call write~init~int(115, 83, 1, 1);call write~init~int(98, 83, 2, 1);call write~init~int(37, 83, 3, 1);call write~init~int(100, 83, 4, 1);call write~init~int(0, 83, 5, 1);call #Ultimate.allocInit(23, 84);call #Ultimate.allocInit(26, 85);call #Ultimate.allocInit(19, 86);~probed_4~0 := 0;~ldv_timer_1_3~0 := 0;~ldv_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_timer_list_3_1~0.base, ~ldv_timer_list_3_1~0.offset := 0, 0;~r8a66597_driver_group1~0.base, ~r8a66597_driver_group1~0.offset := 0, 0;~ldv_timer_list_3_2~0.base, ~ldv_timer_list_3_2~0.offset := 0, 0;~ldv_timer_2_2~0 := 0;~ldv_timer_3_3~0 := 0;~ldv_timer_2_3~0 := 0;~ldv_timer_1_0~0 := 0;~ldv_timer_list_3_3~0.base, ~ldv_timer_list_3_3~0.offset := 0, 0;~ldv_timer_3_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~r8a66597_hc_driver_group0~0.base, ~r8a66597_hc_driver_group0~0.offset := 0, 0;~ldv_timer_list_1_3~0.base, ~ldv_timer_list_1_3~0.offset := 0, 0;~ldv_timer_list_1_1~0.base, ~ldv_timer_list_1_1~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_timer_list_1_0~0.base, ~ldv_timer_list_1_0~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~r8a66597_dev_pm_ops_group1~0.base, ~r8a66597_dev_pm_ops_group1~0.offset := 0, 0;~ldv_timer_1_2~0 := 0;~ldv_timer_2_0~0 := 0;~ldv_timer_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_timer_list_1_2~0.base, ~ldv_timer_list_1_2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~r8a66597_hc_driver_group1~0.base, ~r8a66597_hc_driver_group1~0.offset := 0, 0;~ldv_timer_3_2~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_timer_3_0~0 := 0;~ldv_timer_list_3_0~0.base, ~ldv_timer_list_3_0~0.offset := 0, 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~#hcd_name~0.base, ~#hcd_name~0.offset := 87, 0;call #Ultimate.allocInit(13, 87);call write~init~int(114, ~#hcd_name~0.base, ~#hcd_name~0.offset, 1);call write~init~int(56, ~#hcd_name~0.base, 1 + ~#hcd_name~0.offset, 1);call write~init~int(97, ~#hcd_name~0.base, 2 + ~#hcd_name~0.offset, 1);call write~init~int(54, ~#hcd_name~0.base, 3 + ~#hcd_name~0.offset, 1);call write~init~int(54, ~#hcd_name~0.base, 4 + ~#hcd_name~0.offset, 1);call write~init~int(53, ~#hcd_name~0.base, 5 + ~#hcd_name~0.offset, 1);call write~init~int(57, ~#hcd_name~0.base, 6 + ~#hcd_name~0.offset, 1);call write~init~int(55, ~#hcd_name~0.base, 7 + ~#hcd_name~0.offset, 1);call write~init~int(95, ~#hcd_name~0.base, 8 + ~#hcd_name~0.offset, 1);call write~init~int(104, ~#hcd_name~0.base, 9 + ~#hcd_name~0.offset, 1);call write~init~int(99, ~#hcd_name~0.base, 10 + ~#hcd_name~0.offset, 1);call write~init~int(100, ~#hcd_name~0.base, 11 + ~#hcd_name~0.offset, 1);call write~init~int(0, ~#hcd_name~0.base, 12 + ~#hcd_name~0.offset, 1);~#r8a66597_hc_driver~0.base, ~#r8a66597_hc_driver~0.offset := 88, 0;call #Ultimate.allocInit(348, 88);call write~init~$Pointer$(~#hcd_name~0.base, ~#hcd_name~0.offset, ~#r8a66597_hc_driver~0.base, ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 8 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~int(3136, ~#r8a66597_hc_driver~0.base, 16 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_irq.base, #funAddr~r8a66597_irq.offset, ~#r8a66597_hc_driver~0.base, 24 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~int(32, ~#r8a66597_hc_driver~0.base, 32 + ~#r8a66597_hc_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 36 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_start.base, #funAddr~r8a66597_start.offset, ~#r8a66597_hc_driver~0.base, 44 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 52 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 60 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_stop.base, #funAddr~r8a66597_stop.offset, ~#r8a66597_hc_driver~0.base, 68 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 76 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_get_frame.base, #funAddr~r8a66597_get_frame.offset, ~#r8a66597_hc_driver~0.base, 84 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_urb_enqueue.base, #funAddr~r8a66597_urb_enqueue.offset, ~#r8a66597_hc_driver~0.base, 92 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_urb_dequeue.base, #funAddr~r8a66597_urb_dequeue.offset, ~#r8a66597_hc_driver~0.base, 100 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 108 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 116 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_endpoint_disable.base, #funAddr~r8a66597_endpoint_disable.offset, ~#r8a66597_hc_driver~0.base, 124 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 132 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_hub_status_data.base, #funAddr~r8a66597_hub_status_data.offset, ~#r8a66597_hc_driver~0.base, 140 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_hub_control.base, #funAddr~r8a66597_hub_control.offset, ~#r8a66597_hc_driver~0.base, 148 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_bus_suspend.base, #funAddr~r8a66597_bus_suspend.offset, ~#r8a66597_hc_driver~0.base, 156 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_bus_resume.base, #funAddr~r8a66597_bus_resume.offset, ~#r8a66597_hc_driver~0.base, 164 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 172 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 180 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 188 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 196 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 204 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 212 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 220 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 228 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 236 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 244 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 252 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 260 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 268 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 276 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 284 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 292 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 300 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 308 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 316 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 324 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 332 + ~#r8a66597_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_hc_driver~0.base, 340 + ~#r8a66597_hc_driver~0.offset, 8);~#r8a66597_dev_pm_ops~0.base, ~#r8a66597_dev_pm_ops~0.offset := 89, 0;call #Ultimate.allocInit(184, 89);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 8 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_suspend.base, #funAddr~r8a66597_suspend.offset, ~#r8a66597_dev_pm_ops~0.base, 16 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_resume.base, #funAddr~r8a66597_resume.offset, ~#r8a66597_dev_pm_ops~0.base, 24 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 32 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 40 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_suspend.base, #funAddr~r8a66597_suspend.offset, ~#r8a66597_dev_pm_ops~0.base, 48 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_resume.base, #funAddr~r8a66597_resume.offset, ~#r8a66597_dev_pm_ops~0.base, 56 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 64 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 72 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 80 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 88 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 96 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 104 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 112 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 120 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 128 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 136 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 144 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 152 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 160 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 168 + ~#r8a66597_dev_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_dev_pm_ops~0.base, 176 + ~#r8a66597_dev_pm_ops~0.offset, 8);~#r8a66597_driver~0.base, ~#r8a66597_driver~0.offset := 90, 0;call #Ultimate.allocInit(166, 90);call write~init~$Pointer$(#funAddr~r8a66597_probe.base, #funAddr~r8a66597_probe.offset, ~#r8a66597_driver~0.base, ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~r8a66597_remove.base, #funAddr~r8a66597_remove.offset, ~#r8a66597_driver~0.base, 8 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 16 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 24 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 32 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(~#hcd_name~0.base, ~#hcd_name~0.offset, ~#r8a66597_driver~0.base, 40 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 48 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 56 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 64 + ~#r8a66597_driver~0.offset, 8);call write~init~int(0, ~#r8a66597_driver~0.base, 72 + ~#r8a66597_driver~0.offset, 1);call write~init~int(0, ~#r8a66597_driver~0.base, 73 + ~#r8a66597_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 77 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 85 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 93 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 101 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 109 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 117 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 125 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 133 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(~#r8a66597_dev_pm_ops~0.base, ~#r8a66597_dev_pm_ops~0.offset, ~#r8a66597_driver~0.base, 141 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 149 + ~#r8a66597_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#r8a66597_driver~0.base, 157 + ~#r8a66597_driver~0.offset, 8);call write~init~int(0, ~#r8a66597_driver~0.base, 165 + ~#r8a66597_driver~0.offset, 1);~ldv_retval_14~0 := 0;~ldv_retval_2~0 := 0;~ldv_retval_12~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_11~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_15~0 := 0;~ldv_retval_16~0 := 0;~ldv_retval_13~0 := 0;~ldv_retval_10~0 := 0;~ldv_retval_9~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_8~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_7~0 := 0;~ldv_spin~0 := 0; {18601#true} is VALID [2022-02-20 22:35:55,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1030#1.base, main_#t~ret1030#1.offset, main_#t~ret1031#1.base, main_#t~ret1031#1.offset, main_#t~ret1032#1.base, main_#t~ret1032#1.offset, main_#t~ret1033#1.base, main_#t~ret1033#1.offset, main_#t~ret1034#1.base, main_#t~ret1034#1.offset, main_#t~ret1035#1.base, main_#t~ret1035#1.offset, main_#t~ret1036#1.base, main_#t~ret1036#1.offset, main_#t~ret1037#1.base, main_#t~ret1037#1.offset, main_#t~ret1038#1.base, main_#t~ret1038#1.offset, main_#t~nondet1039#1, main_#t~switch1040#1, main_#t~nondet1041#1, main_#t~switch1042#1, main_#t~ret1043#1, main_#t~mem1044#1, main_#t~ret1045#1, main_#t~mem1046#1, main_#t~ret1047#1, main_#t~ret1048#1, main_#t~ret1049#1, main_#t~ret1050#1, main_#t~ret1051#1, main_#t~ret1052#1, main_#t~ret1053#1, main_#t~ret1054#1, main_#t~ret1055#1, main_#t~mem1056#1, main_#t~ret1057#1, main_#t~mem1058#1, main_#t~ret1059#1, main_#t~mem1060#1, main_#t~mem1061#1, main_#t~mem1062#1, main_#t~mem1063#1, main_#t~ret1064#1, main_#t~mem1065#1, main_#t~mem1066#1, main_#t~mem1067#1, main_#t~mem1068#1, main_#t~ret1069#1, main_#t~ret1070#1, main_#t~ret1071#1, main_#t~nondet1072#1, main_#t~switch1073#1, main_#t~ret1074#1, main_#t~ret1075#1, main_#t~ret1076#1, main_#t~nondet1077#1, main_#t~switch1078#1, main_#t~ret1079#1, main_#t~nondet1080#1, main_#t~switch1081#1, main_#t~ret1082#1, main_#t~ret1083#1, main_#t~ret1084#1, main_#t~ret1085#1, main_#t~ret1086#1, main_#t~ret1087#1, main_#t~ret1088#1, main_#t~ret1089#1, main_#t~ret1090#1, main_#t~ret1091#1, main_#t~ret1092#1, main_#t~ret1093#1, main_#t~ret1094#1, main_#t~ret1095#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~88#1.base, main_~tmp~88#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~16#1, main_~tmp___3~12#1, main_~tmp___4~6#1, main_~tmp___5~2#1, main_~tmp___6~2#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~88#1.base, main_~tmp~88#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~tmp___2~16#1;havoc main_~tmp___3~12#1;havoc main_~tmp___4~6#1;havoc main_~tmp___5~2#1;havoc main_~tmp___6~2#1; {18601#true} is VALID [2022-02-20 22:35:55,992 INFO L272 TraceCheckUtils]: 2: Hoare triple {18601#true} call main_#t~ret1030#1.base, main_#t~ret1030#1.offset := ldv_init_zalloc(72); {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:35:55,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {18601#true} is VALID [2022-02-20 22:35:55,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {18601#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {18718#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:55,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {18601#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L272 TraceCheckUtils]: 9: Hoare triple {18601#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,994 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {18601#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,995 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18601#true} {18601#true} #6187#return; {18601#true} is VALID [2022-02-20 22:35:55,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {18601#true} main_~tmp~88#1.base, main_~tmp~88#1.offset := main_#t~ret1030#1.base, main_#t~ret1030#1.offset;havoc main_#t~ret1030#1.base, main_#t~ret1030#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~88#1.base, main_~tmp~88#1.offset; {18601#true} is VALID [2022-02-20 22:35:55,995 INFO L272 TraceCheckUtils]: 18: Hoare triple {18601#true} call main_#t~ret1031#1.base, main_#t~ret1031#1.offset := ldv_init_zalloc(1); {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:35:55,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {18601#true} is VALID [2022-02-20 22:35:55,996 INFO L272 TraceCheckUtils]: 20: Hoare triple {18601#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {18718#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:55,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:55,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,997 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:55,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {18601#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {18601#true} is VALID [2022-02-20 22:35:55,997 INFO L272 TraceCheckUtils]: 25: Hoare triple {18601#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {18601#true} is VALID [2022-02-20 22:35:55,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:55,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:55,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:55,998 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:55,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {18601#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {18601#true} is VALID [2022-02-20 22:35:56,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,001 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18601#true} {18601#true} #6189#return; {18601#true} is VALID [2022-02-20 22:35:56,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {18601#true} main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset := main_#t~ret1031#1.base, main_#t~ret1031#1.offset;havoc main_#t~ret1031#1.base, main_#t~ret1031#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___0~49#1.base, main_~tmp___0~49#1.offset; {18601#true} is VALID [2022-02-20 22:35:56,001 INFO L272 TraceCheckUtils]: 34: Hoare triple {18601#true} call main_#t~ret1032#1.base, main_#t~ret1032#1.offset := ldv_init_zalloc(1); {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:35:56,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {18710#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~size); {18601#true} is VALID [2022-02-20 22:35:56,002 INFO L272 TraceCheckUtils]: 36: Hoare triple {18601#true} call #Ultimate.meminit(#t~malloc20.base, #t~malloc20.offset, 1, ~size, ~size); {18718#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:35:56,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {18718#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18601#true} is VALID [2022-02-20 22:35:56,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18601#true} {18601#true} #5587#return; {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {18601#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc20.base, #t~malloc20.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L272 TraceCheckUtils]: 41: Hoare triple {18601#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {18601#true} ~cond := #in~cond; {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {18601#true} assume !(0 == ~cond); {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18601#true} {18601#true} #5589#return; {18601#true} is VALID [2022-02-20 22:35:56,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {18601#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {18601#true} is VALID [2022-02-20 22:35:56,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,004 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18601#true} {18601#true} #6191#return; {18601#true} is VALID [2022-02-20 22:35:56,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {18601#true} main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset := main_#t~ret1032#1.base, main_#t~ret1032#1.offset;havoc main_#t~ret1032#1.base, main_#t~ret1032#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~25#1.base, main_~tmp___1~25#1.offset;assume { :begin_inline_ldv_initialize } true; {18601#true} is VALID [2022-02-20 22:35:56,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {18601#true} assume { :end_inline_ldv_initialize } true; {18601#true} is VALID [2022-02-20 22:35:56,005 INFO L272 TraceCheckUtils]: 51: Hoare triple {18601#true} call main_#t~ret1033#1.base, main_#t~ret1033#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 2); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L272 TraceCheckUtils]: 53: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18601#true} {18601#true} #6193#return; {18601#true} is VALID [2022-02-20 22:35:56,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {18601#true} havoc main_#t~ret1033#1.base, main_#t~ret1033#1.offset; {18601#true} is VALID [2022-02-20 22:35:56,007 INFO L272 TraceCheckUtils]: 62: Hoare triple {18601#true} call main_#t~ret1034#1.base, main_#t~ret1034#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 2); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,008 INFO L272 TraceCheckUtils]: 64: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:56,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:56,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:56,009 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:56,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,009 INFO L290 TraceCheckUtils]: 70: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,009 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18601#true} {18601#true} #6195#return; {18601#true} is VALID [2022-02-20 22:35:56,009 INFO L290 TraceCheckUtils]: 72: Hoare triple {18601#true} havoc main_#t~ret1034#1.base, main_#t~ret1034#1.offset; {18601#true} is VALID [2022-02-20 22:35:56,010 INFO L272 TraceCheckUtils]: 73: Hoare triple {18601#true} call main_#t~ret1035#1.base, main_#t~ret1035#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,010 INFO L290 TraceCheckUtils]: 74: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L272 TraceCheckUtils]: 75: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L290 TraceCheckUtils]: 78: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,011 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18601#true} {18601#true} #6197#return; {18601#true} is VALID [2022-02-20 22:35:56,012 INFO L290 TraceCheckUtils]: 83: Hoare triple {18601#true} havoc main_#t~ret1035#1.base, main_#t~ret1035#1.offset; {18601#true} is VALID [2022-02-20 22:35:56,012 INFO L272 TraceCheckUtils]: 84: Hoare triple {18601#true} call main_#t~ret1036#1.base, main_#t~ret1036#1.offset := ldv_memset(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,013 INFO L272 TraceCheckUtils]: 86: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,013 INFO L290 TraceCheckUtils]: 87: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:56,013 INFO L290 TraceCheckUtils]: 88: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:56,013 INFO L290 TraceCheckUtils]: 89: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:56,014 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:56,014 INFO L290 TraceCheckUtils]: 91: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,014 INFO L290 TraceCheckUtils]: 92: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,014 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {18601#true} {18601#true} #6199#return; {18601#true} is VALID [2022-02-20 22:35:56,014 INFO L290 TraceCheckUtils]: 94: Hoare triple {18601#true} havoc main_#t~ret1036#1.base, main_#t~ret1036#1.offset; {18601#true} is VALID [2022-02-20 22:35:56,015 INFO L272 TraceCheckUtils]: 95: Hoare triple {18601#true} call main_#t~ret1037#1.base, main_#t~ret1037#1.offset := ldv_memset(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 2); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L272 TraceCheckUtils]: 97: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,016 INFO L290 TraceCheckUtils]: 98: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L290 TraceCheckUtils]: 99: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L290 TraceCheckUtils]: 100: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L290 TraceCheckUtils]: 102: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,016 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {18601#true} {18601#true} #6201#return; {18601#true} is VALID [2022-02-20 22:35:56,017 INFO L290 TraceCheckUtils]: 105: Hoare triple {18601#true} havoc main_#t~ret1037#1.base, main_#t~ret1037#1.offset; {18601#true} is VALID [2022-02-20 22:35:56,018 INFO L272 TraceCheckUtils]: 106: Hoare triple {18601#true} call main_#t~ret1038#1.base, main_#t~ret1038#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 2); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,018 INFO L290 TraceCheckUtils]: 107: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,019 INFO L272 TraceCheckUtils]: 108: Hoare triple {18601#true} call #t~memset~res21.base, #t~memset~res21.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:35:56,019 INFO L290 TraceCheckUtils]: 109: Hoare triple {18733#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1149 := 0; {18601#true} is VALID [2022-02-20 22:35:56,019 INFO L290 TraceCheckUtils]: 110: Hoare triple {18601#true} assume !(#t~loopctr1149 % 18446744073709551616 < #amount % 18446744073709551616); {18601#true} is VALID [2022-02-20 22:35:56,019 INFO L290 TraceCheckUtils]: 111: Hoare triple {18601#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18601#true} is VALID [2022-02-20 22:35:56,019 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18601#true} {18601#true} #5655#return; {18601#true} is VALID [2022-02-20 22:35:56,020 INFO L290 TraceCheckUtils]: 113: Hoare triple {18601#true} ~tmp~3.base, ~tmp~3.offset := ~s.base, ~s.offset;havoc #t~memset~res21.base, #t~memset~res21.offset;#res.base, #res.offset := ~tmp~3.base, ~tmp~3.offset; {18601#true} is VALID [2022-02-20 22:35:56,020 INFO L290 TraceCheckUtils]: 114: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,020 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18601#true} {18601#true} #6203#return; {18601#true} is VALID [2022-02-20 22:35:56,020 INFO L290 TraceCheckUtils]: 116: Hoare triple {18601#true} havoc main_#t~ret1038#1.base, main_#t~ret1038#1.offset;~ldv_state_variable_6~0 := 0;~ldv_state_variable_4~0 := 0;assume { :begin_inline_timer_init_1 } true;~ldv_timer_1_0~0 := 0;~ldv_timer_1_1~0 := 0;~ldv_timer_1_2~0 := 0;~ldv_timer_1_3~0 := 0; {18699#(= ~ldv_state_variable_6~0 0)} is VALID [2022-02-20 22:35:56,020 INFO L290 TraceCheckUtils]: 117: Hoare triple {18699#(= ~ldv_state_variable_6~0 0)} assume { :end_inline_timer_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;assume { :begin_inline_timer_init_3 } true;~ldv_timer_3_0~0 := 0;~ldv_timer_3_1~0 := 0;~ldv_timer_3_2~0 := 0;~ldv_timer_3_3~0 := 0; {18699#(= ~ldv_state_variable_6~0 0)} is VALID [2022-02-20 22:35:56,021 INFO L290 TraceCheckUtils]: 118: Hoare triple {18699#(= ~ldv_state_variable_6~0 0)} assume { :end_inline_timer_init_3 } true;~ldv_state_variable_3~0 := 1;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {18699#(= ~ldv_state_variable_6~0 0)} is VALID [2022-02-20 22:35:56,021 INFO L290 TraceCheckUtils]: 119: Hoare triple {18699#(= ~ldv_state_variable_6~0 0)} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1;~ldv_state_variable_5~0 := 0; {18699#(= ~ldv_state_variable_6~0 0)} is VALID [2022-02-20 22:35:56,021 INFO L290 TraceCheckUtils]: 120: Hoare triple {18699#(= ~ldv_state_variable_6~0 0)} assume -2147483648 <= main_#t~nondet1039#1 && main_#t~nondet1039#1 <= 2147483647;main_~tmp___2~16#1 := main_#t~nondet1039#1;havoc main_#t~nondet1039#1;main_#t~switch1040#1 := 0 == main_~tmp___2~16#1; {18699#(= ~ldv_state_variable_6~0 0)} is VALID [2022-02-20 22:35:56,022 INFO L290 TraceCheckUtils]: 121: Hoare triple {18699#(= ~ldv_state_variable_6~0 0)} assume main_#t~switch1040#1; {18699#(= ~ldv_state_variable_6~0 0)} is VALID [2022-02-20 22:35:56,022 INFO L290 TraceCheckUtils]: 122: Hoare triple {18699#(= ~ldv_state_variable_6~0 0)} assume 0 != ~ldv_state_variable_6~0;assume -2147483648 <= main_#t~nondet1041#1 && main_#t~nondet1041#1 <= 2147483647;main_~tmp___3~12#1 := main_#t~nondet1041#1;havoc main_#t~nondet1041#1;main_#t~switch1042#1 := 0 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,022 INFO L290 TraceCheckUtils]: 123: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 1 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,022 INFO L290 TraceCheckUtils]: 124: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 2 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,022 INFO L290 TraceCheckUtils]: 125: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 3 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,022 INFO L290 TraceCheckUtils]: 126: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 4 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 127: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 5 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 128: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 6 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 129: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 7 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 130: Hoare triple {18602#false} assume !main_#t~switch1042#1;main_#t~switch1042#1 := main_#t~switch1042#1 || 8 == main_~tmp___3~12#1; {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 131: Hoare triple {18602#false} assume main_#t~switch1042#1; {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 132: Hoare triple {18602#false} assume 1 == ~ldv_state_variable_6~0;call main_#t~mem1056#1 := read~int(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 4); {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L272 TraceCheckUtils]: 133: Hoare triple {18602#false} call main_#t~ret1057#1 := r8a66597_urb_enqueue(~r8a66597_hc_driver_group1~0.base, ~r8a66597_hc_driver_group1~0.offset, ~r8a66597_hc_driver_group0~0.base, ~r8a66597_hc_driver_group0~0.offset, main_#t~mem1056#1); {18602#false} is VALID [2022-02-20 22:35:56,023 INFO L290 TraceCheckUtils]: 134: Hoare triple {18602#false} ~hcd#1.base, ~hcd#1.offset := #in~hcd#1.base, #in~hcd#1.offset;~urb#1.base, ~urb#1.offset := #in~urb#1.base, #in~urb#1.offset;~mem_flags#1 := #in~mem_flags#1;havoc ~hep~0#1.base, ~hep~0#1.offset;havoc ~r8a66597~6#1.base, ~r8a66597~6#1.offset;havoc ~tmp~69#1.base, ~tmp~69#1.offset;havoc ~td~11#1.base, ~td~11#1.offset;havoc ~ret~2#1;havoc ~request~0#1;havoc ~flags~3#1;havoc ~tmp___0~39#1.base, ~tmp___0~39#1.offset;havoc ~tmp___1~19#1;havoc ~tmp___2~12#1;havoc ~tmp___3~9#1;havoc ~tmp___4~4#1;call #t~mem827#1.base, #t~mem827#1.offset := read~$Pointer$(~urb#1.base, 72 + ~urb#1.offset, 8);~hep~0#1.base, ~hep~0#1.offset := #t~mem827#1.base, #t~mem827#1.offset;havoc #t~mem827#1.base, #t~mem827#1.offset; {18602#false} is VALID [2022-02-20 22:35:56,024 INFO L272 TraceCheckUtils]: 135: Hoare triple {18602#false} call #t~ret828#1.base, #t~ret828#1.offset := hcd_to_r8a66597(~hcd#1.base, ~hcd#1.offset); {18601#true} is VALID [2022-02-20 22:35:56,024 INFO L290 TraceCheckUtils]: 136: Hoare triple {18601#true} ~hcd.base, ~hcd.offset := #in~hcd.base, #in~hcd.offset;#res.base, #res.offset := ~hcd.base, 897 + ~hcd.offset; {18601#true} is VALID [2022-02-20 22:35:56,024 INFO L290 TraceCheckUtils]: 137: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,024 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {18601#true} {18602#false} #5749#return; {18602#false} is VALID [2022-02-20 22:35:56,024 INFO L290 TraceCheckUtils]: 139: Hoare triple {18602#false} ~tmp~69#1.base, ~tmp~69#1.offset := #t~ret828#1.base, #t~ret828#1.offset;havoc #t~ret828#1.base, #t~ret828#1.offset;~r8a66597~6#1.base, ~r8a66597~6#1.offset := ~tmp~69#1.base, ~tmp~69#1.offset;~td~11#1.base, ~td~11#1.offset := 0, 0;~request~0#1 := 0; {18602#false} is VALID [2022-02-20 22:35:56,024 INFO L272 TraceCheckUtils]: 140: Hoare triple {18602#false} call ldv_spin_lock(); {18758#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:35:56,024 INFO L290 TraceCheckUtils]: 141: Hoare triple {18758#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {18601#true} is VALID [2022-02-20 22:35:56,024 INFO L290 TraceCheckUtils]: 142: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,024 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18601#true} {18602#false} #5751#return; {18602#false} is VALID [2022-02-20 22:35:56,025 INFO L272 TraceCheckUtils]: 144: Hoare triple {18602#false} call #t~ret829#1.base, #t~ret829#1.offset := get_urb_to_r8a66597_dev(~r8a66597~6#1.base, ~r8a66597~6#1.offset, ~urb#1.base, ~urb#1.offset); {18601#true} is VALID [2022-02-20 22:35:56,025 INFO L290 TraceCheckUtils]: 145: Hoare triple {18601#true} ~r8a66597.base, ~r8a66597.offset := #in~r8a66597.base, #in~r8a66597.offset;~urb.base, ~urb.offset := #in~urb.base, #in~urb.offset;havoc ~tmp~23.base, ~tmp~23.offset;call #t~mem249 := read~int(~urb.base, 80 + ~urb.offset, 4); {18601#true} is VALID [2022-02-20 22:35:56,025 INFO L290 TraceCheckUtils]: 146: Hoare triple {18601#true} assume 0 == (if 0 == #t~mem249 / 256 then 0 else (if 1 == #t~mem249 / 256 then 1 else ~bitwiseAnd(#t~mem249 / 256, 127))) % 4294967296;havoc #t~mem249;#res.base, #res.offset := ~r8a66597.base, 92 + ~r8a66597.offset; {18601#true} is VALID [2022-02-20 22:35:56,025 INFO L290 TraceCheckUtils]: 147: Hoare triple {18601#true} assume true; {18601#true} is VALID [2022-02-20 22:35:56,025 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {18601#true} {18602#false} #5753#return; {18602#false} is VALID [2022-02-20 22:35:56,025 INFO L290 TraceCheckUtils]: 149: Hoare triple {18602#false} ~tmp___0~39#1.base, ~tmp___0~39#1.offset := #t~ret829#1.base, #t~ret829#1.offset;havoc #t~ret829#1.base, #t~ret829#1.offset; {18602#false} is VALID [2022-02-20 22:35:56,025 INFO L290 TraceCheckUtils]: 150: Hoare triple {18602#false} assume !(0 == (~tmp___0~39#1.base + ~tmp___0~39#1.offset) % 18446744073709551616);assume { :begin_inline_usb_hcd_link_urb_to_ep } true;usb_hcd_link_urb_to_ep_#in~arg0#1.base, usb_hcd_link_urb_to_ep_#in~arg0#1.offset, usb_hcd_link_urb_to_ep_#in~arg1#1.base, usb_hcd_link_urb_to_ep_#in~arg1#1.offset := ~hcd#1.base, ~hcd#1.offset, ~urb#1.base, ~urb#1.offset;havoc usb_hcd_link_urb_to_ep_#res#1;havoc usb_hcd_link_urb_to_ep_#t~nondet1136#1, usb_hcd_link_urb_to_ep_~arg0#1.base, usb_hcd_link_urb_to_ep_~arg0#1.offset, usb_hcd_link_urb_to_ep_~arg1#1.base, usb_hcd_link_urb_to_ep_~arg1#1.offset;usb_hcd_link_urb_to_ep_~arg0#1.base, usb_hcd_link_urb_to_ep_~arg0#1.offset := usb_hcd_link_urb_to_ep_#in~arg0#1.base, usb_hcd_link_urb_to_ep_#in~arg0#1.offset;usb_hcd_link_urb_to_ep_~arg1#1.base, usb_hcd_link_urb_to_ep_~arg1#1.offset := usb_hcd_link_urb_to_ep_#in~arg1#1.base, usb_hcd_link_urb_to_ep_#in~arg1#1.offset;assume -2147483648 <= usb_hcd_link_urb_to_ep_#t~nondet1136#1 && usb_hcd_link_urb_to_ep_#t~nondet1136#1 <= 2147483647;usb_hcd_link_urb_to_ep_#res#1 := usb_hcd_link_urb_to_ep_#t~nondet1136#1;havoc usb_hcd_link_urb_to_ep_#t~nondet1136#1; {18602#false} is VALID [2022-02-20 22:35:56,025 INFO L290 TraceCheckUtils]: 151: Hoare triple {18602#false} #t~ret830#1 := usb_hcd_link_urb_to_ep_#res#1;assume { :end_inline_usb_hcd_link_urb_to_ep } true;assume -2147483648 <= #t~ret830#1 && #t~ret830#1 <= 2147483647;~ret~2#1 := #t~ret830#1;havoc #t~ret830#1; {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L290 TraceCheckUtils]: 152: Hoare triple {18602#false} assume !(0 != ~ret~2#1);call #t~mem831#1.base, #t~mem831#1.offset := read~$Pointer$(~hep~0#1.base, 31 + ~hep~0#1.offset, 8); {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L290 TraceCheckUtils]: 153: Hoare triple {18602#false} assume 0 == (#t~mem831#1.base + #t~mem831#1.offset) % 18446744073709551616;havoc #t~mem831#1.base, #t~mem831#1.offset; {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L272 TraceCheckUtils]: 154: Hoare triple {18602#false} call #t~ret832#1.base, #t~ret832#1.offset := kzalloc(80, 32); {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L290 TraceCheckUtils]: 155: Hoare triple {18602#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~91#1.base, ~tmp~91#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L290 TraceCheckUtils]: 156: Hoare triple {18602#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L272 TraceCheckUtils]: 157: Hoare triple {18602#false} call ldv_error(); {18602#false} is VALID [2022-02-20 22:35:56,026 INFO L290 TraceCheckUtils]: 158: Hoare triple {18602#false} assume !false; {18602#false} is VALID [2022-02-20 22:35:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-02-20 22:35:56,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:35:56,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130945678] [2022-02-20 22:35:56,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130945678] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:35:56,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:35:56,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 22:35:56,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003970489] [2022-02-20 22:35:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:35:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-02-20 22:35:56,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:35:56,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 22:35:56,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:35:56,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 22:35:56,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:35:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 22:35:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:35:56,119 INFO L87 Difference]: Start difference. First operand 2260 states and 3305 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)