./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.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-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.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 1f258bb699a014f11eb0babe874a45670072f33ce1154e31a2f0110b34e4ef74 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:04:57,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:04:57,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:04:57,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:04:57,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:04:57,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:04:57,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:04:57,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:04:57,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:04:57,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:04:57,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:04:57,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:04:57,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:04:57,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:04:57,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:04:57,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:04:57,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:04:57,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:04:57,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:04:57,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:04:57,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:04:57,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:04:57,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:04:57,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:04:57,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:04:57,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:04:57,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:04:57,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:04:57,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:04:57,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:04:57,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:04:57,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:04:57,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:04:57,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:04:57,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:04:57,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:04:57,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:04:57,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:04:57,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:04:57,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:04:57,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:04:57,664 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:04:57,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:04:57,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:04:57,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:04:57,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:04:57,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:04:57,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:04:57,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:04:57,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:04:57,688 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:04:57,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:04:57,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:04:57,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:04:57,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:04:57,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:04:57,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:04:57,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:04:57,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:04:57,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:04:57,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:04:57,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:04:57,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:04:57,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:04:57,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:04:57,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:04:57,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:04:57,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:04:57,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:04:57,693 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:04:57,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:04:57,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:04:57,693 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 -> 1f258bb699a014f11eb0babe874a45670072f33ce1154e31a2f0110b34e4ef74 [2022-02-20 22:04:57,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:04:57,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:04:57,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:04:57,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:04:57,864 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:04:57,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:04:57,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8629322ee/c274d26589724d579a2601680d3802a6/FLAGf6559f079 [2022-02-20 22:04:58,508 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:04:58,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:04:58,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8629322ee/c274d26589724d579a2601680d3802a6/FLAGf6559f079 [2022-02-20 22:04:58,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8629322ee/c274d26589724d579a2601680d3802a6 [2022-02-20 22:04:58,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:04:58,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:04:58,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:04:58,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:04:58,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:04:58,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:04:58" (1/1) ... [2022-02-20 22:04:58,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744c673f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:58, skipping insertion in model container [2022-02-20 22:04:58,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:04:58" (1/1) ... [2022-02-20 22:04:58,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:04:59,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:05:00,539 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-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i[239447,239460] [2022-02-20 22:05:00,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:05:00,595 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:05:00,841 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-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i[239447,239460] [2022-02-20 22:05:00,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:05:00,936 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:05:00,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00 WrapperNode [2022-02-20 22:05:00,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:05:00,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:05:00,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:05:00,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:05:00,944 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:05:00" (1/1) ... [2022-02-20 22:05:01,019 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:05:00" (1/1) ... [2022-02-20 22:05:01,334 INFO L137 Inliner]: procedures = 261, calls = 1811, calls flagged for inlining = 104, calls inlined = 100, statements flattened = 4661 [2022-02-20 22:05:01,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:05:01,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:05:01,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:05:01,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:05:01,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:05:01,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:05:01,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:05:01,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:05:01,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (1/1) ... [2022-02-20 22:05:01,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:05:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:05:01,669 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:05:01,687 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:05:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-02-20 22:05:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-02-20 22:05:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_12 [2022-02-20 22:05:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_12 [2022-02-20 22:05:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:05:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:05:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:05:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:05:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:05:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:05:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_delete [2022-02-20 22:05:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_delete [2022-02-20 22:05:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_wait [2022-02-20 22:05:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_wait [2022-02-20 22:05:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_usb_bulk_msg [2022-02-20 22:05:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_usb_bulk_msg [2022-02-20 22:05:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-02-20 22:05:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-02-20 22:05:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-02-20 22:05:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-02-20 22:05:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:05:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:05:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-02-20 22:05:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-02-20 22:05:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-02-20 22:05:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-02-20 22:05:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_signal_sdio_irq [2022-02-20 22:05:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_signal_sdio_irq [2022-02-20 22:05:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_50 [2022-02-20 22:05:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_50 [2022-02-20 22:05:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 22:05:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 22:05:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:05:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:05:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:05:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:05:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:05:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:05:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_detect_change [2022-02-20 22:05:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_detect_change [2022-02-20 22:05:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 22:05:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 22:05:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_cancel [2022-02-20 22:05:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_cancel [2022-02-20 22:05:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 22:05:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 22:05:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_init [2022-02-20 22:05:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_init [2022-02-20 22:05:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_29 [2022-02-20 22:05:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_29 [2022-02-20 22:05:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure __command_read_data [2022-02-20 22:05:01,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_read_data [2022-02-20 22:05:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:05:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_27 [2022-02-20 22:05:01,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_27 [2022-02-20 22:05:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 22:05:01,713 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 22:05:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-02-20 22:05:01,714 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-02-20 22:05:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:05:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_13 [2022-02-20 22:05:01,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_13 [2022-02-20 22:05:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 22:05:01,714 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 22:05:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure irqpoll_out_completed [2022-02-20 22:05:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure irqpoll_out_completed [2022-02-20 22:05:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_disconnect [2022-02-20 22:05:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_disconnect [2022-02-20 22:05:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_3 [2022-02-20 22:05:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_3 [2022-02-20 22:05:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_15 [2022-02-20 22:05:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_15 [2022-02-20 22:05:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:05:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:05:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-02-20 22:05:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-02-20 22:05:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:05:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:05:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_enable_sdio_irq [2022-02-20 22:05:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_enable_sdio_irq [2022-02-20 22:05:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-02-20 22:05:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-02-20 22:05:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-02-20 22:05:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-02-20 22:05:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure add_offloaded_reg [2022-02-20 22:05:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure add_offloaded_reg [2022-02-20 22:05:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-02-20 22:05:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-02-20 22:05:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure command_out_completed [2022-02-20 22:05:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure command_out_completed [2022-02-20 22:05:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure roundup_to_multiple_of_64 [2022-02-20 22:05:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure roundup_to_multiple_of_64 [2022-02-20 22:05:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-02-20 22:05:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-02-20 22:05:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-02-20 22:05:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-02-20 22:05:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:05:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_cmndwork_thread [2022-02-20 22:05:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_cmndwork_thread [2022-02-20 22:05:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:05:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_4 [2022-02-20 22:05:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_4 [2022-02-20 22:05:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure send_command [2022-02-20 22:05:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure send_command [2022-02-20 22:05:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-02-20 22:05:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-02-20 22:05:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:05:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-02-20 22:05:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-02-20 22:05:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:05:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:05:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 22:05:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 22:05:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure send_irqpoll [2022-02-20 22:05:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure send_irqpoll [2022-02-20 22:05:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-02-20 22:05:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-02-20 22:05:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:05:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:05:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2022-02-20 22:05:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2022-02-20 22:05:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:05:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_response_error [2022-02-20 22:05:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_response_error [2022-02-20 22:05:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2022-02-20 22:05:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2022-02-20 22:05:01,728 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_free_host [2022-02-20 22:05:01,728 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_free_host [2022-02-20 22:05:01,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:05:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:05:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_32 [2022-02-20 22:05:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_32 [2022-02-20 22:05:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:05:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:05:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:05:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_queue_poll_work [2022-02-20 22:05:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_queue_poll_work [2022-02-20 22:05:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_4 [2022-02-20 22:05:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_4 [2022-02-20 22:05:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:05:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:05:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2022-02-20 22:05:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2022-02-20 22:05:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2022-02-20 22:05:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2022-02-20 22:05:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:05:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure sg_copy_to_buffer [2022-02-20 22:05:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_copy_to_buffer [2022-02-20 22:05:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put_9 [2022-02-20 22:05:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put_9 [2022-02-20 22:05:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 22:05:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 22:05:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:05:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure __download_offload_pseudocode [2022-02-20 22:05:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __download_offload_pseudocode [2022-02-20 22:05:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:05:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:05:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_4 [2022-02-20 22:05:01,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_4 [2022-02-20 22:05:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_pollwork_thread [2022-02-20 22:05:01,736 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_pollwork_thread [2022-02-20 22:05:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_InterfaceNumber [2022-02-20 22:05:01,736 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_InterfaceNumber [2022-02-20 22:05:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-02-20 22:05:01,736 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-02-20 22:05:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 22:05:01,737 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 22:05:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-02-20 22:05:01,737 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-02-20 22:05:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure __do_poll [2022-02-20 22:05:01,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_poll [2022-02-20 22:05:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_3 [2022-02-20 22:05:01,737 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_3 [2022-02-20 22:05:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure new_system_port_status [2022-02-20 22:05:01,737 INFO L138 BoogieDeclarations]: Found implementation of procedure new_system_port_status [2022-02-20 22:05:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_request_done [2022-02-20 22:05:01,738 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_request_done [2022-02-20 22:05:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-02-20 22:05:01,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-02-20 22:05:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:05:01,739 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:05:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure __command_write_data [2022-02-20 22:05:01,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_write_data [2022-02-20 22:05:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-02-20 22:05:01,739 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-02-20 22:05:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-02-20 22:05:01,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-02-20 22:05:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-02-20 22:05:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_47 [2022-02-20 22:05:01,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_47 [2022-02-20 22:05:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-02-20 22:05:01,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-02-20 22:05:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:05:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-02-20 22:05:01,740 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-02-20 22:05:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_priv [2022-02-20 22:05:01,740 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_priv [2022-02-20 22:05:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-02-20 22:05:01,741 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-02-20 22:05:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_deadwork_thread [2022-02-20 22:05:01,741 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_deadwork_thread [2022-02-20 22:05:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure check_vub300_port_status [2022-02-20 22:05:01,741 INFO L138 BoogieDeclarations]: Found implementation of procedure check_vub300_port_status [2022-02-20 22:05:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-02-20 22:05:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:05:01,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:05:02,311 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:05:02,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:05:03,374 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:05:06,564 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:05:06,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:05:06,588 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:05:06,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:05:06 BoogieIcfgContainer [2022-02-20 22:05:06,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:05:06,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:05:06,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:05:06,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:05:06,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:04:58" (1/3) ... [2022-02-20 22:05:06,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d072af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:05:06, skipping insertion in model container [2022-02-20 22:05:06,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:00" (2/3) ... [2022-02-20 22:05:06,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d072af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:05:06, skipping insertion in model container [2022-02-20 22:05:06,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:05:06" (3/3) ... [2022-02-20 22:05:06,598 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:05:06,604 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:05:06,604 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:05:06,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:05:06,655 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:05:06,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:05:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 1662 states, 1185 states have (on average 1.4270042194092827) internal successors, (1691), 1251 states have internal predecessors, (1691), 382 states have call successors, (382), 94 states have call predecessors, (382), 93 states have return successors, (373), 347 states have call predecessors, (373), 373 states have call successors, (373) [2022-02-20 22:05:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-20 22:05:06,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:05:06,708 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:05:06,708 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:05:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:05:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash -744390701, now seen corresponding path program 1 times [2022-02-20 22:05:06,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:05:06,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716214166] [2022-02-20 22:05:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:05:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:05:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:05:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,098 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,099 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,101 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1666#false} {1665#true} #4422#return; {1666#false} is VALID [2022-02-20 22:05:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:05:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,130 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,130 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,132 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1666#false} {1666#false} #4424#return; {1666#false} is VALID [2022-02-20 22:05:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:05:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,168 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,169 INFO L272 TraceCheckUtils]: 6: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,171 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1666#false} {1666#false} #4426#return; {1666#false} is VALID [2022-02-20 22:05:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:05:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,196 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,197 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,199 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1666#false} {1666#false} #4428#return; {1666#false} is VALID [2022-02-20 22:05:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 22:05:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {1665#true} is VALID [2022-02-20 22:05:07,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {1665#true} is VALID [2022-02-20 22:05:07,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1665#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1665#true} is VALID [2022-02-20 22:05:07,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #4020#return; {1665#true} is VALID [2022-02-20 22:05:07,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#(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~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,222 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1771#(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:05:07,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {1665#true} is VALID [2022-02-20 22:05:07,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {1665#true} is VALID [2022-02-20 22:05:07,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {1665#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1665#true} is VALID [2022-02-20 22:05:07,223 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1665#true} {1665#true} #4020#return; {1665#true} is VALID [2022-02-20 22:05:07,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,223 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1665#true} {1666#false} #4430#return; {1666#false} is VALID [2022-02-20 22:05:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 22:05:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:07,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {1665#true} is VALID [2022-02-20 22:05:07,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {1665#true} is VALID [2022-02-20 22:05:07,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {1665#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1665#true} is VALID [2022-02-20 22:05:07,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #4020#return; {1665#true} is VALID [2022-02-20 22:05:07,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#(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~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,241 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1771#(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:05:07,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {1665#true} is VALID [2022-02-20 22:05:07,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {1665#true} is VALID [2022-02-20 22:05:07,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {1665#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1665#true} is VALID [2022-02-20 22:05:07,242 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1665#true} {1665#true} #4020#return; {1665#true} is VALID [2022-02-20 22:05:07,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,243 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1665#true} {1666#false} #4432#return; {1666#false} is VALID [2022-02-20 22:05:07,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#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(104, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(20, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(31, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(27, 12);call #Ultimate.allocInit(32, 13);call #Ultimate.allocInit(74, 14);call #Ultimate.allocInit(42, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(29, 17);call #Ultimate.allocInit(32, 18);call #Ultimate.allocInit(73, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(47, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(42, 24);call #Ultimate.allocInit(26, 25);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(10, 27);call #Ultimate.allocInit(5, 28);call write~init~int(46, 28, 0, 1);call write~init~int(98, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(110, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(32, 29);call #Ultimate.allocInit(16, 30);call #Ultimate.allocInit(31, 31);call #Ultimate.allocInit(17, 32);call #Ultimate.allocInit(45, 33);call #Ultimate.allocInit(7, 34);call write~init~int(118, 34, 0, 1);call write~init~int(117, 34, 1, 1);call write~init~int(98, 34, 2, 1);call write~init~int(51, 34, 3, 1);call write~init~int(48, 34, 4, 1);call write~init~int(48, 34, 5, 1);call write~init~int(0, 34, 6, 1);call #Ultimate.allocInit(18, 35);call #Ultimate.allocInit(268, 36);call #Ultimate.allocInit(23, 37);call #Ultimate.allocInit(23, 38);call #Ultimate.allocInit(30, 39);call #Ultimate.allocInit(37, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(36, 43);call #Ultimate.allocInit(31, 44);call #Ultimate.allocInit(19, 45);call #Ultimate.allocInit(19, 46);call #Ultimate.allocInit(9, 47);call #Ultimate.allocInit(8, 48);call #Ultimate.allocInit(8, 49);call #Ultimate.allocInit(37, 50);call #Ultimate.allocInit(37, 51);call #Ultimate.allocInit(38, 52);call #Ultimate.allocInit(34, 53);call #Ultimate.allocInit(55, 54);call #Ultimate.allocInit(6, 55);call write~init~int(76, 55, 0, 1);call write~init~int(65, 55, 1, 1);call write~init~int(82, 55, 2, 1);call write~init~int(71, 55, 3, 1);call write~init~int(69, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(6, 56);call write~init~int(83, 56, 0, 1);call write~init~int(77, 56, 1, 1);call write~init~int(65, 56, 2, 1);call write~init~int(76, 56, 3, 1);call write~init~int(76, 56, 4, 1);call write~init~int(0, 56, 5, 1);call #Ultimate.allocInit(55, 57);call #Ultimate.allocInit(54, 58);call #Ultimate.allocInit(5, 59);call write~init~int(73, 59, 0, 1);call write~init~int(82, 59, 1, 1);call write~init~int(81, 59, 2, 1);call write~init~int(115, 59, 3, 1);call write~init~int(0, 59, 4, 1);call #Ultimate.allocInit(5, 60);call write~init~int(80, 60, 0, 1);call write~init~int(79, 60, 1, 1);call write~init~int(76, 60, 2, 1);call write~init~int(76, 60, 3, 1);call write~init~int(0, 60, 4, 1);call #Ultimate.allocInit(6, 61);call write~init~int(52, 61, 0, 1);call write~init~int(45, 61, 1, 1);call write~init~int(98, 61, 2, 1);call write~init~int(105, 61, 3, 1);call write~init~int(116, 61, 4, 1);call write~init~int(0, 61, 5, 1);call #Ultimate.allocInit(6, 62);call write~init~int(49, 62, 0, 1);call write~init~int(45, 62, 1, 1);call write~init~int(98, 62, 2, 1);call write~init~int(105, 62, 3, 1);call write~init~int(116, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(22, 63);call #Ultimate.allocInit(5, 64);call write~init~int(119, 64, 0, 1);call write~init~int(105, 64, 1, 1);call write~init~int(116, 64, 2, 1);call write~init~int(104, 64, 3, 1);call write~init~int(0, 64, 4, 1);call #Ultimate.allocInit(29, 65);call #Ultimate.allocInit(30, 66);call #Ultimate.allocInit(20, 67);call #Ultimate.allocInit(20, 68);call #Ultimate.allocInit(80, 69);call #Ultimate.allocInit(83, 70);call #Ultimate.allocInit(61, 71);call #Ultimate.allocInit(7, 72);call write~init~int(118, 72, 0, 1);call write~init~int(117, 72, 1, 1);call write~init~int(98, 72, 2, 1);call write~init~int(51, 72, 3, 1);call write~init~int(48, 72, 4, 1);call write~init~int(48, 72, 5, 1);call write~init~int(0, 72, 6, 1);call #Ultimate.allocInit(61, 73);call #Ultimate.allocInit(9, 74);call #Ultimate.allocInit(9, 75);call #Ultimate.allocInit(45, 76);call #Ultimate.allocInit(9, 77);call #Ultimate.allocInit(9, 78);call #Ultimate.allocInit(45, 79);call #Ultimate.allocInit(9, 80);call #Ultimate.allocInit(9, 81);call #Ultimate.allocInit(45, 82);call #Ultimate.allocInit(7, 83);call write~init~int(118, 83, 0, 1);call write~init~int(117, 83, 1, 1);call write~init~int(98, 83, 2, 1);call write~init~int(51, 83, 3, 1);call write~init~int(48, 83, 4, 1);call write~init~int(48, 83, 5, 1);call write~init~int(0, 83, 6, 1);call #Ultimate.allocInit(38, 84);~ldv_timer_state_5~0 := 0;~ldv_timer_list_5~0.base, ~ldv_timer_list_5~0.offset := 0, 0;~ldv_timer_list_4~0.base, ~ldv_timer_list_4~0.offset := 0, 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~vub300_mmc_ops_group0~0.base, ~vub300_mmc_ops_group0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_0~0 := 0;~ldv_work_struct_2_3~0.base, ~ldv_work_struct_2_3~0.offset := 0, 0;~ldv_work_struct_2_0~0.base, ~ldv_work_struct_2_0~0.offset := 0, 0;~ldv_work_struct_2_2~0.base, ~ldv_work_struct_2_2~0.offset := 0, 0;~ldv_timer_state_4~0 := 0;~ref_cnt~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_work_struct_2_1~0.base, ~ldv_work_struct_2_1~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_work_3_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_work_2_0~0 := 0;~usb_counter~0 := 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_2_2~0 := 0;~ldv_state_variable_3~0 := 0;~vub300_driver_group1~0.base, ~vub300_driver_group1~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_work_2_3~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_work_2_1~0 := 0;~limit_speed_to_24_MHz~0 := 0;~pad_input_to_usb_pkt~0 := 0;~disable_offload_processing~0 := 0;~force_1_bit_data_xfers~0 := 0;~force_polling_for_irqs~0 := 0;~firmware_irqpoll_timeout~0 := 1024;~force_max_req_size~0 := 128;~firmware_rom_wait_states~0 := 28;~#vub300_table~0.base, ~#vub300_table~0.offset := 85, 0;call #Ultimate.allocInit(75, 85);call write~init~int(3, ~#vub300_table~0.base, ~#vub300_table~0.offset, 2);call write~init~int(8705, ~#vub300_table~0.base, 2 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 4 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 6 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 8 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 10 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 11 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 12 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 13 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 14 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 15 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 16 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 17 + ~#vub300_table~0.offset, 8);call write~init~int(3, ~#vub300_table~0.base, 25 + ~#vub300_table~0.offset, 2);call write~init~int(1060, ~#vub300_table~0.base, 27 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 29 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 31 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 33 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 35 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 36 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 37 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 38 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 39 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 40 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 41 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 42 + ~#vub300_table~0.offset, 8);call write~init~int(0, ~#vub300_table~0.base, 50 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 52 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 54 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 56 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 58 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 60 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 61 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 62 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 63 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 64 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 65 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 66 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 67 + ~#vub300_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := 0, 0;~pollworkqueue~0.base, ~pollworkqueue~0.offset := 0, 0;~deadworkqueue~0.base, ~deadworkqueue~0.offset := 0, 0;~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset := 86, 0;call #Ultimate.allocInit(120, 86);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 8 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 16 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 24 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_request.base, #funAddr~vub300_mmc_request.offset, ~#vub300_mmc_ops~0.base, 32 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_set_ios.base, #funAddr~vub300_mmc_set_ios.offset, ~#vub300_mmc_ops~0.base, 40 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_get_ro.base, #funAddr~vub300_mmc_get_ro.offset, ~#vub300_mmc_ops~0.base, 48 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 56 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_enable_sdio_irq.base, #funAddr~vub300_enable_sdio_irq.offset, ~#vub300_mmc_ops~0.base, 64 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_init_card.base, #funAddr~vub300_init_card.offset, ~#vub300_mmc_ops~0.base, 72 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 80 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 88 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 96 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 104 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 112 + ~#vub300_mmc_ops~0.offset, 8);~#vub300_driver~0.base, ~#vub300_driver~0.offset := 87, 0;call #Ultimate.allocInit(277, 87);call write~init~$Pointer$(72, 0, ~#vub300_driver~0.base, ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_probe.base, #funAddr~vub300_probe.offset, ~#vub300_driver~0.base, 8 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_disconnect.base, #funAddr~vub300_disconnect.offset, ~#vub300_driver~0.base, 16 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 24 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_suspend.base, #funAddr~vub300_suspend.offset, ~#vub300_driver~0.base, 32 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_resume.base, #funAddr~vub300_resume.offset, ~#vub300_driver~0.base, 40 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 48 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_pre_reset.base, #funAddr~vub300_pre_reset.offset, ~#vub300_driver~0.base, 56 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_post_reset.base, #funAddr~vub300_post_reset.offset, ~#vub300_driver~0.base, 64 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(~#vub300_table~0.base, ~#vub300_table~0.offset, ~#vub300_driver~0.base, 72 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 80 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 84 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 88 + ~#vub300_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 92 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 100 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 108 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 116 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 124 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 132 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 136 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 148 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 156 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 164 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 172 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 180 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 188 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 196 + ~#vub300_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 197 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 205 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 213 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 221 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 229 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 237 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 245 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 253 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 261 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 269 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 273 + ~#vub300_driver~0.offset, 1);call write~init~int(1, ~#vub300_driver~0.base, 274 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 275 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 276 + ~#vub300_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~URB_STATE~0 := 0;~DEV_STATE~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~int_urb~0.base, ~int_urb~0.offset := 0, 0;~bulk_urb~0.base, ~bulk_urb~0.offset := 0, 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {1665#true} is VALID [2022-02-20 22:05:07,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret968#1.base, main_#t~ret968#1.offset, main_#t~ret969#1.base, main_#t~ret969#1.offset, main_#t~ret970#1.base, main_#t~ret970#1.offset, main_#t~ret971#1.base, main_#t~ret971#1.offset, main_#t~ret972#1.base, main_#t~ret972#1.offset, main_#t~ret973#1.base, main_#t~ret973#1.offset, main_#t~nondet974#1, main_#t~switch975#1, main_#t~nondet976#1, main_#t~switch977#1, main_#t~ret978#1, main_#t~mem979#1, main_#t~ret980#1, main_#t~ret981#1, main_#t~ret982#1, main_#t~nondet983#1, main_#t~switch984#1, main_#t~mem985#1, main_#t~ret986#1, main_#t~nondet987#1, main_#t~switch988#1, main_#t~ret989#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~tmp___3~2#1, main_~tmp___4~3#1, main_~tmp___5~2#1, main_~tmp___6~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~tmp___3~2#1;havoc main_~tmp___4~3#1;havoc main_~tmp___5~2#1;havoc main_~tmp___6~2#1; {1665#true} is VALID [2022-02-20 22:05:07,245 INFO L272 TraceCheckUtils]: 2: Hoare triple {1665#true} call main_#t~ret968#1.base, main_#t~ret968#1.offset := ldv_init_zalloc(32); {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:07,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,246 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,247 INFO L272 TraceCheckUtils]: 9: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,248 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,248 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1666#false} {1665#true} #4422#return; {1666#false} is VALID [2022-02-20 22:05:07,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {1666#false} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret968#1.base, main_#t~ret968#1.offset;havoc main_#t~ret968#1.base, main_#t~ret968#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset; {1666#false} is VALID [2022-02-20 22:05:07,249 INFO L272 TraceCheckUtils]: 18: Hoare triple {1666#false} call main_#t~ret969#1.base, main_#t~ret969#1.offset := ldv_init_zalloc(1824); {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:07,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,249 INFO L272 TraceCheckUtils]: 20: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,250 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,250 INFO L272 TraceCheckUtils]: 25: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,251 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,252 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1666#false} {1666#false} #4424#return; {1666#false} is VALID [2022-02-20 22:05:07,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {1666#false} main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset := main_#t~ret969#1.base, main_#t~ret969#1.offset;havoc main_#t~ret969#1.base, main_#t~ret969#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset; {1666#false} is VALID [2022-02-20 22:05:07,252 INFO L272 TraceCheckUtils]: 34: Hoare triple {1666#false} call main_#t~ret970#1.base, main_#t~ret970#1.offset := ldv_init_zalloc(16); {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:07,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,253 INFO L272 TraceCheckUtils]: 36: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,253 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,254 INFO L272 TraceCheckUtils]: 41: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,254 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,255 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1666#false} {1666#false} #4426#return; {1666#false} is VALID [2022-02-20 22:05:07,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {1666#false} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret970#1.base, main_#t~ret970#1.offset;havoc main_#t~ret970#1.base, main_#t~ret970#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset; {1666#false} is VALID [2022-02-20 22:05:07,255 INFO L272 TraceCheckUtils]: 50: Hoare triple {1666#false} call main_#t~ret971#1.base, main_#t~ret971#1.offset := ldv_init_zalloc(136); {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:07,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {1741#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {1665#true} is VALID [2022-02-20 22:05:07,256 INFO L272 TraceCheckUtils]: 52: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {1749#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:07,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {1749#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 22:05:07,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,257 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {1665#true} {1665#true} #4010#return; {1665#true} is VALID [2022-02-20 22:05:07,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {1665#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1665#true} is VALID [2022-02-20 22:05:07,257 INFO L272 TraceCheckUtils]: 57: Hoare triple {1665#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1665#true} is VALID [2022-02-20 22:05:07,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 22:05:07,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {1665#true} assume 0 == ~cond;assume false; {1666#false} is VALID [2022-02-20 22:05:07,258 INFO L290 TraceCheckUtils]: 60: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,258 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1666#false} {1665#true} #4012#return; {1666#false} is VALID [2022-02-20 22:05:07,258 INFO L290 TraceCheckUtils]: 62: Hoare triple {1666#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1666#false} is VALID [2022-02-20 22:05:07,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {1666#false} assume true; {1666#false} is VALID [2022-02-20 22:05:07,258 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1666#false} {1666#false} #4428#return; {1666#false} is VALID [2022-02-20 22:05:07,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {1666#false} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret971#1.base, main_#t~ret971#1.offset;havoc main_#t~ret971#1.base, main_#t~ret971#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;assume { :begin_inline_ldv_initialize } true; {1666#false} is VALID [2022-02-20 22:05:07,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {1666#false} assume { :end_inline_ldv_initialize } true; {1666#false} is VALID [2022-02-20 22:05:07,261 INFO L272 TraceCheckUtils]: 67: Hoare triple {1666#false} call main_#t~ret972#1.base, main_#t~ret972#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {1771#(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:05:07,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {1771#(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~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,262 INFO L272 TraceCheckUtils]: 69: Hoare triple {1665#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1771#(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:05:07,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {1771#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {1665#true} is VALID [2022-02-20 22:05:07,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {1665#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {1665#true} is VALID [2022-02-20 22:05:07,262 INFO L290 TraceCheckUtils]: 72: Hoare triple {1665#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1665#true} is VALID [2022-02-20 22:05:07,266 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {1665#true} {1665#true} #4020#return; {1665#true} is VALID [2022-02-20 22:05:07,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {1665#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,266 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {1665#true} {1666#false} #4430#return; {1666#false} is VALID [2022-02-20 22:05:07,267 INFO L290 TraceCheckUtils]: 77: Hoare triple {1666#false} havoc main_#t~ret972#1.base, main_#t~ret972#1.offset; {1666#false} is VALID [2022-02-20 22:05:07,267 INFO L272 TraceCheckUtils]: 78: Hoare triple {1666#false} call main_#t~ret973#1.base, main_#t~ret973#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {1771#(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:05:07,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {1771#(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~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,268 INFO L272 TraceCheckUtils]: 80: Hoare triple {1665#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1771#(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:05:07,268 INFO L290 TraceCheckUtils]: 81: Hoare triple {1771#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {1665#true} is VALID [2022-02-20 22:05:07,268 INFO L290 TraceCheckUtils]: 82: Hoare triple {1665#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {1665#true} is VALID [2022-02-20 22:05:07,268 INFO L290 TraceCheckUtils]: 83: Hoare triple {1665#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1665#true} is VALID [2022-02-20 22:05:07,268 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {1665#true} {1665#true} #4020#return; {1665#true} is VALID [2022-02-20 22:05:07,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {1665#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1665#true} is VALID [2022-02-20 22:05:07,269 INFO L290 TraceCheckUtils]: 86: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 22:05:07,269 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {1665#true} {1666#false} #4432#return; {1666#false} is VALID [2022-02-20 22:05:07,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {1666#false} havoc main_#t~ret973#1.base, main_#t~ret973#1.offset;~ldv_state_variable_6~0 := 0;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {1666#false} is VALID [2022-02-20 22:05:07,269 INFO L290 TraceCheckUtils]: 89: Hoare triple {1666#false} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;assume { :begin_inline_work_init_2 } true;~ldv_work_2_0~0 := 0;~ldv_work_2_1~0 := 0;~ldv_work_2_2~0 := 0;~ldv_work_2_3~0 := 0; {1666#false} is VALID [2022-02-20 22:05:07,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {1666#false} assume { :end_inline_work_init_2 } true;~ldv_state_variable_2~0 := 1;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {1666#false} is VALID [2022-02-20 22:05:07,270 INFO L290 TraceCheckUtils]: 91: Hoare triple {1666#false} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 1; {1666#false} is VALID [2022-02-20 22:05:07,270 INFO L290 TraceCheckUtils]: 92: Hoare triple {1666#false} assume -2147483648 <= main_#t~nondet974#1 && main_#t~nondet974#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet974#1;havoc main_#t~nondet974#1;main_#t~switch975#1 := 0 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,270 INFO L290 TraceCheckUtils]: 93: Hoare triple {1666#false} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 1 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,270 INFO L290 TraceCheckUtils]: 94: Hoare triple {1666#false} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 2 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,271 INFO L290 TraceCheckUtils]: 95: Hoare triple {1666#false} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 3 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,271 INFO L290 TraceCheckUtils]: 96: Hoare triple {1666#false} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 4 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,271 INFO L290 TraceCheckUtils]: 97: Hoare triple {1666#false} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 5 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,271 INFO L290 TraceCheckUtils]: 98: Hoare triple {1666#false} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 6 == main_~tmp___3~2#1; {1666#false} is VALID [2022-02-20 22:05:07,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {1666#false} assume main_#t~switch975#1; {1666#false} is VALID [2022-02-20 22:05:07,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {1666#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet987#1 && main_#t~nondet987#1 <= 2147483647;main_~tmp___6~2#1 := main_#t~nondet987#1;havoc main_#t~nondet987#1;main_#t~switch988#1 := 0 == main_~tmp___6~2#1; {1666#false} is VALID [2022-02-20 22:05:07,276 INFO L290 TraceCheckUtils]: 101: Hoare triple {1666#false} assume !main_#t~switch988#1;main_#t~switch988#1 := main_#t~switch988#1 || 1 == main_~tmp___6~2#1; {1666#false} is VALID [2022-02-20 22:05:07,276 INFO L290 TraceCheckUtils]: 102: Hoare triple {1666#false} assume main_#t~switch988#1; {1666#false} is VALID [2022-02-20 22:05:07,276 INFO L290 TraceCheckUtils]: 103: Hoare triple {1666#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_vub300_init } true;havoc vub300_init_#res#1;havoc vub300_init_#t~nondet941#1, vub300_init_#t~nondet942#1.base, vub300_init_#t~nondet942#1.offset, vub300_init_#t~nondet943#1, vub300_init_#t~nondet944#1.base, vub300_init_#t~nondet944#1.offset, vub300_init_#t~nondet945#1, vub300_init_#t~nondet946#1.base, vub300_init_#t~nondet946#1.offset, vub300_init_#t~nondet947#1, vub300_init_#t~ret948#1, vub300_init_#t~nondet949#1, vub300_init_~result~3#1, vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset, vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset, vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset, vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset, vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset, vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset, vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset, vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset, vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_~result~3#1;call vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset;havoc vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset;call vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset;havoc vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset;call vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset;havoc vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_#t~nondet941#1;vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset := 74, 0;havoc vub300_init_#t~nondet942#1.base, vub300_init_#t~nondet942#1.offset;vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset := vub300_init_#t~nondet942#1.base, vub300_init_#t~nondet942#1.offset;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset; {1666#false} is VALID [2022-02-20 22:05:07,277 INFO L290 TraceCheckUtils]: 104: Hoare triple {1666#false} assume 0 == (~cmndworkqueue~0.base + ~cmndworkqueue~0.offset) % 18446744073709551616;havoc vub300_init_#t~nondet943#1;vub300_init_~result~3#1 := -12; {1666#false} is VALID [2022-02-20 22:05:07,277 INFO L290 TraceCheckUtils]: 105: Hoare triple {1666#false} vub300_init_#res#1 := vub300_init_~result~3#1;call ULTIMATE.dealloc(vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset);havoc vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset);havoc vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset);havoc vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset; {1666#false} is VALID [2022-02-20 22:05:07,277 INFO L290 TraceCheckUtils]: 106: Hoare triple {1666#false} main_#t~ret989#1 := vub300_init_#res#1;assume { :end_inline_vub300_init } true;assume -2147483648 <= main_#t~ret989#1 && main_#t~ret989#1 <= 2147483647;~ldv_retval_3~0 := main_#t~ret989#1;havoc main_#t~ret989#1; {1666#false} is VALID [2022-02-20 22:05:07,277 INFO L290 TraceCheckUtils]: 107: Hoare triple {1666#false} assume !(0 == ~ldv_retval_3~0); {1666#false} is VALID [2022-02-20 22:05:07,277 INFO L290 TraceCheckUtils]: 108: Hoare triple {1666#false} assume 0 != ~ldv_retval_3~0;~ldv_state_variable_0~0 := 2; {1666#false} is VALID [2022-02-20 22:05:07,278 INFO L290 TraceCheckUtils]: 109: Hoare triple {1666#false} assume { :begin_inline_ldv_check_final_state } true; {1666#false} is VALID [2022-02-20 22:05:07,278 INFO L290 TraceCheckUtils]: 110: Hoare triple {1666#false} assume 0 != ~URB_STATE~0; {1666#false} is VALID [2022-02-20 22:05:07,278 INFO L272 TraceCheckUtils]: 111: Hoare triple {1666#false} call ldv_error(); {1666#false} is VALID [2022-02-20 22:05:07,278 INFO L290 TraceCheckUtils]: 112: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2022-02-20 22:05:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-02-20 22:05:07,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:05:07,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716214166] [2022-02-20 22:05:07,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716214166] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:05:07,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:05:07,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:05:07,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572333197] [2022-02-20 22:05:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:05:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 113 [2022-02-20 22:05:07,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:05:07,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:05:07,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:05:07,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:05:07,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:05:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:05:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:05:07,382 INFO L87 Difference]: Start difference. First operand has 1662 states, 1185 states have (on average 1.4270042194092827) internal successors, (1691), 1251 states have internal predecessors, (1691), 382 states have call successors, (382), 94 states have call predecessors, (382), 93 states have return successors, (373), 347 states have call predecessors, (373), 373 states have call successors, (373) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:05:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:05:24,946 INFO L93 Difference]: Finished difference Result 3482 states and 5270 transitions. [2022-02-20 22:05:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:05:24,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 113 [2022-02-20 22:05:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:05:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:05:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5270 transitions. [2022-02-20 22:05:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:05:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5270 transitions. [2022-02-20 22:05:25,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5270 transitions. [2022-02-20 22:05:29,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5270 edges. 5270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:05:29,912 INFO L225 Difference]: With dead ends: 3482 [2022-02-20 22:05:29,912 INFO L226 Difference]: Without dead ends: 1808 [2022-02-20 22:05:29,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:05:29,924 INFO L933 BasicCegarLoop]: 2216 mSDtfsCounter, 1194 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:05:29,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1225 Valid, 3892 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-02-20 22:05:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-02-20 22:05:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1646. [2022-02-20 22:05:30,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:05:30,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1808 states. Second operand has 1646 states, 1180 states have (on average 1.3847457627118644) internal successors, (1634), 1235 states have internal predecessors, (1634), 373 states have call successors, (373), 93 states have call predecessors, (373), 92 states have return successors, (369), 343 states have call predecessors, (369), 369 states have call successors, (369) [2022-02-20 22:05:30,031 INFO L74 IsIncluded]: Start isIncluded. First operand 1808 states. Second operand has 1646 states, 1180 states have (on average 1.3847457627118644) internal successors, (1634), 1235 states have internal predecessors, (1634), 373 states have call successors, (373), 93 states have call predecessors, (373), 92 states have return successors, (369), 343 states have call predecessors, (369), 369 states have call successors, (369) [2022-02-20 22:05:30,033 INFO L87 Difference]: Start difference. First operand 1808 states. Second operand has 1646 states, 1180 states have (on average 1.3847457627118644) internal successors, (1634), 1235 states have internal predecessors, (1634), 373 states have call successors, (373), 93 states have call predecessors, (373), 92 states have return successors, (369), 343 states have call predecessors, (369), 369 states have call successors, (369) [2022-02-20 22:05:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:05:30,158 INFO L93 Difference]: Finished difference Result 1808 states and 2662 transitions. [2022-02-20 22:05:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2662 transitions. [2022-02-20 22:05:30,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:05:30,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:05:30,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 1646 states, 1180 states have (on average 1.3847457627118644) internal successors, (1634), 1235 states have internal predecessors, (1634), 373 states have call successors, (373), 93 states have call predecessors, (373), 92 states have return successors, (369), 343 states have call predecessors, (369), 369 states have call successors, (369) Second operand 1808 states. [2022-02-20 22:05:30,175 INFO L87 Difference]: Start difference. First operand has 1646 states, 1180 states have (on average 1.3847457627118644) internal successors, (1634), 1235 states have internal predecessors, (1634), 373 states have call successors, (373), 93 states have call predecessors, (373), 92 states have return successors, (369), 343 states have call predecessors, (369), 369 states have call successors, (369) Second operand 1808 states. [2022-02-20 22:05:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:05:30,293 INFO L93 Difference]: Finished difference Result 1808 states and 2662 transitions. [2022-02-20 22:05:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2662 transitions. [2022-02-20 22:05:30,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:05:30,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:05:30,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:05:30,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:05:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1180 states have (on average 1.3847457627118644) internal successors, (1634), 1235 states have internal predecessors, (1634), 373 states have call successors, (373), 93 states have call predecessors, (373), 92 states have return successors, (369), 343 states have call predecessors, (369), 369 states have call successors, (369) [2022-02-20 22:05:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2376 transitions. [2022-02-20 22:05:30,440 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2376 transitions. Word has length 113 [2022-02-20 22:05:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:05:30,441 INFO L470 AbstractCegarLoop]: Abstraction has 1646 states and 2376 transitions. [2022-02-20 22:05:30,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:05:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2376 transitions. [2022-02-20 22:05:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-20 22:05:30,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:05:30,445 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:05:30,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:05:30,445 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:05:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:05:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1785197365, now seen corresponding path program 1 times [2022-02-20 22:05:30,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:05:30,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999430819] [2022-02-20 22:05:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:05:30,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:05:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:05:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,652 INFO L272 TraceCheckUtils]: 1: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,652 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,661 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4422#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:05:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,690 INFO L272 TraceCheckUtils]: 1: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,693 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,694 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4424#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:05:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L272 TraceCheckUtils]: 1: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,722 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,723 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4426#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:05:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,761 INFO L272 TraceCheckUtils]: 1: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,763 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,763 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4428#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 22:05:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {12540#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {12433#true} is VALID [2022-02-20 22:05:30,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {12433#true} is VALID [2022-02-20 22:05:30,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {12433#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12433#true} is VALID [2022-02-20 22:05:30,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12433#true} {12433#true} #4020#return; {12433#true} is VALID [2022-02-20 22:05:30,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {12540#(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~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,791 INFO L272 TraceCheckUtils]: 1: Hoare triple {12433#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12540#(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:05:30,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {12540#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {12433#true} is VALID [2022-02-20 22:05:30,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {12433#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {12433#true} is VALID [2022-02-20 22:05:30,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {12433#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12433#true} is VALID [2022-02-20 22:05:30,792 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12433#true} {12433#true} #4020#return; {12433#true} is VALID [2022-02-20 22:05:30,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {12433#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,793 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4430#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 22:05:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:30,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {12540#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {12433#true} is VALID [2022-02-20 22:05:30,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {12433#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {12433#true} is VALID [2022-02-20 22:05:30,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {12433#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12433#true} is VALID [2022-02-20 22:05:30,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12433#true} {12433#true} #4020#return; {12433#true} is VALID [2022-02-20 22:05:30,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {12540#(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~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,825 INFO L272 TraceCheckUtils]: 1: Hoare triple {12433#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12540#(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:05:30,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {12540#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {12433#true} is VALID [2022-02-20 22:05:30,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {12433#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {12433#true} is VALID [2022-02-20 22:05:30,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {12433#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12433#true} is VALID [2022-02-20 22:05:30,825 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12433#true} {12433#true} #4020#return; {12433#true} is VALID [2022-02-20 22:05:30,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {12433#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,826 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4432#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {12433#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(104, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(20, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(31, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(27, 12);call #Ultimate.allocInit(32, 13);call #Ultimate.allocInit(74, 14);call #Ultimate.allocInit(42, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(29, 17);call #Ultimate.allocInit(32, 18);call #Ultimate.allocInit(73, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(47, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(42, 24);call #Ultimate.allocInit(26, 25);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(10, 27);call #Ultimate.allocInit(5, 28);call write~init~int(46, 28, 0, 1);call write~init~int(98, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(110, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(32, 29);call #Ultimate.allocInit(16, 30);call #Ultimate.allocInit(31, 31);call #Ultimate.allocInit(17, 32);call #Ultimate.allocInit(45, 33);call #Ultimate.allocInit(7, 34);call write~init~int(118, 34, 0, 1);call write~init~int(117, 34, 1, 1);call write~init~int(98, 34, 2, 1);call write~init~int(51, 34, 3, 1);call write~init~int(48, 34, 4, 1);call write~init~int(48, 34, 5, 1);call write~init~int(0, 34, 6, 1);call #Ultimate.allocInit(18, 35);call #Ultimate.allocInit(268, 36);call #Ultimate.allocInit(23, 37);call #Ultimate.allocInit(23, 38);call #Ultimate.allocInit(30, 39);call #Ultimate.allocInit(37, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(36, 43);call #Ultimate.allocInit(31, 44);call #Ultimate.allocInit(19, 45);call #Ultimate.allocInit(19, 46);call #Ultimate.allocInit(9, 47);call #Ultimate.allocInit(8, 48);call #Ultimate.allocInit(8, 49);call #Ultimate.allocInit(37, 50);call #Ultimate.allocInit(37, 51);call #Ultimate.allocInit(38, 52);call #Ultimate.allocInit(34, 53);call #Ultimate.allocInit(55, 54);call #Ultimate.allocInit(6, 55);call write~init~int(76, 55, 0, 1);call write~init~int(65, 55, 1, 1);call write~init~int(82, 55, 2, 1);call write~init~int(71, 55, 3, 1);call write~init~int(69, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(6, 56);call write~init~int(83, 56, 0, 1);call write~init~int(77, 56, 1, 1);call write~init~int(65, 56, 2, 1);call write~init~int(76, 56, 3, 1);call write~init~int(76, 56, 4, 1);call write~init~int(0, 56, 5, 1);call #Ultimate.allocInit(55, 57);call #Ultimate.allocInit(54, 58);call #Ultimate.allocInit(5, 59);call write~init~int(73, 59, 0, 1);call write~init~int(82, 59, 1, 1);call write~init~int(81, 59, 2, 1);call write~init~int(115, 59, 3, 1);call write~init~int(0, 59, 4, 1);call #Ultimate.allocInit(5, 60);call write~init~int(80, 60, 0, 1);call write~init~int(79, 60, 1, 1);call write~init~int(76, 60, 2, 1);call write~init~int(76, 60, 3, 1);call write~init~int(0, 60, 4, 1);call #Ultimate.allocInit(6, 61);call write~init~int(52, 61, 0, 1);call write~init~int(45, 61, 1, 1);call write~init~int(98, 61, 2, 1);call write~init~int(105, 61, 3, 1);call write~init~int(116, 61, 4, 1);call write~init~int(0, 61, 5, 1);call #Ultimate.allocInit(6, 62);call write~init~int(49, 62, 0, 1);call write~init~int(45, 62, 1, 1);call write~init~int(98, 62, 2, 1);call write~init~int(105, 62, 3, 1);call write~init~int(116, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(22, 63);call #Ultimate.allocInit(5, 64);call write~init~int(119, 64, 0, 1);call write~init~int(105, 64, 1, 1);call write~init~int(116, 64, 2, 1);call write~init~int(104, 64, 3, 1);call write~init~int(0, 64, 4, 1);call #Ultimate.allocInit(29, 65);call #Ultimate.allocInit(30, 66);call #Ultimate.allocInit(20, 67);call #Ultimate.allocInit(20, 68);call #Ultimate.allocInit(80, 69);call #Ultimate.allocInit(83, 70);call #Ultimate.allocInit(61, 71);call #Ultimate.allocInit(7, 72);call write~init~int(118, 72, 0, 1);call write~init~int(117, 72, 1, 1);call write~init~int(98, 72, 2, 1);call write~init~int(51, 72, 3, 1);call write~init~int(48, 72, 4, 1);call write~init~int(48, 72, 5, 1);call write~init~int(0, 72, 6, 1);call #Ultimate.allocInit(61, 73);call #Ultimate.allocInit(9, 74);call #Ultimate.allocInit(9, 75);call #Ultimate.allocInit(45, 76);call #Ultimate.allocInit(9, 77);call #Ultimate.allocInit(9, 78);call #Ultimate.allocInit(45, 79);call #Ultimate.allocInit(9, 80);call #Ultimate.allocInit(9, 81);call #Ultimate.allocInit(45, 82);call #Ultimate.allocInit(7, 83);call write~init~int(118, 83, 0, 1);call write~init~int(117, 83, 1, 1);call write~init~int(98, 83, 2, 1);call write~init~int(51, 83, 3, 1);call write~init~int(48, 83, 4, 1);call write~init~int(48, 83, 5, 1);call write~init~int(0, 83, 6, 1);call #Ultimate.allocInit(38, 84);~ldv_timer_state_5~0 := 0;~ldv_timer_list_5~0.base, ~ldv_timer_list_5~0.offset := 0, 0;~ldv_timer_list_4~0.base, ~ldv_timer_list_4~0.offset := 0, 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~vub300_mmc_ops_group0~0.base, ~vub300_mmc_ops_group0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_0~0 := 0;~ldv_work_struct_2_3~0.base, ~ldv_work_struct_2_3~0.offset := 0, 0;~ldv_work_struct_2_0~0.base, ~ldv_work_struct_2_0~0.offset := 0, 0;~ldv_work_struct_2_2~0.base, ~ldv_work_struct_2_2~0.offset := 0, 0;~ldv_timer_state_4~0 := 0;~ref_cnt~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_work_struct_2_1~0.base, ~ldv_work_struct_2_1~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_work_3_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_work_2_0~0 := 0;~usb_counter~0 := 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_2_2~0 := 0;~ldv_state_variable_3~0 := 0;~vub300_driver_group1~0.base, ~vub300_driver_group1~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_work_2_3~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_work_2_1~0 := 0;~limit_speed_to_24_MHz~0 := 0;~pad_input_to_usb_pkt~0 := 0;~disable_offload_processing~0 := 0;~force_1_bit_data_xfers~0 := 0;~force_polling_for_irqs~0 := 0;~firmware_irqpoll_timeout~0 := 1024;~force_max_req_size~0 := 128;~firmware_rom_wait_states~0 := 28;~#vub300_table~0.base, ~#vub300_table~0.offset := 85, 0;call #Ultimate.allocInit(75, 85);call write~init~int(3, ~#vub300_table~0.base, ~#vub300_table~0.offset, 2);call write~init~int(8705, ~#vub300_table~0.base, 2 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 4 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 6 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 8 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 10 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 11 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 12 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 13 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 14 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 15 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 16 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 17 + ~#vub300_table~0.offset, 8);call write~init~int(3, ~#vub300_table~0.base, 25 + ~#vub300_table~0.offset, 2);call write~init~int(1060, ~#vub300_table~0.base, 27 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 29 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 31 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 33 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 35 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 36 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 37 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 38 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 39 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 40 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 41 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 42 + ~#vub300_table~0.offset, 8);call write~init~int(0, ~#vub300_table~0.base, 50 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 52 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 54 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 56 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 58 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 60 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 61 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 62 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 63 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 64 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 65 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 66 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 67 + ~#vub300_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := 0, 0;~pollworkqueue~0.base, ~pollworkqueue~0.offset := 0, 0;~deadworkqueue~0.base, ~deadworkqueue~0.offset := 0, 0;~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset := 86, 0;call #Ultimate.allocInit(120, 86);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 8 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 16 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 24 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_request.base, #funAddr~vub300_mmc_request.offset, ~#vub300_mmc_ops~0.base, 32 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_set_ios.base, #funAddr~vub300_mmc_set_ios.offset, ~#vub300_mmc_ops~0.base, 40 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_get_ro.base, #funAddr~vub300_mmc_get_ro.offset, ~#vub300_mmc_ops~0.base, 48 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 56 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_enable_sdio_irq.base, #funAddr~vub300_enable_sdio_irq.offset, ~#vub300_mmc_ops~0.base, 64 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_init_card.base, #funAddr~vub300_init_card.offset, ~#vub300_mmc_ops~0.base, 72 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 80 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 88 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 96 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 104 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 112 + ~#vub300_mmc_ops~0.offset, 8);~#vub300_driver~0.base, ~#vub300_driver~0.offset := 87, 0;call #Ultimate.allocInit(277, 87);call write~init~$Pointer$(72, 0, ~#vub300_driver~0.base, ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_probe.base, #funAddr~vub300_probe.offset, ~#vub300_driver~0.base, 8 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_disconnect.base, #funAddr~vub300_disconnect.offset, ~#vub300_driver~0.base, 16 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 24 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_suspend.base, #funAddr~vub300_suspend.offset, ~#vub300_driver~0.base, 32 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_resume.base, #funAddr~vub300_resume.offset, ~#vub300_driver~0.base, 40 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 48 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_pre_reset.base, #funAddr~vub300_pre_reset.offset, ~#vub300_driver~0.base, 56 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_post_reset.base, #funAddr~vub300_post_reset.offset, ~#vub300_driver~0.base, 64 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(~#vub300_table~0.base, ~#vub300_table~0.offset, ~#vub300_driver~0.base, 72 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 80 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 84 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 88 + ~#vub300_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 92 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 100 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 108 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 116 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 124 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 132 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 136 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 148 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 156 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 164 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 172 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 180 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 188 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 196 + ~#vub300_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 197 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 205 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 213 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 221 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 229 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 237 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 245 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 253 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 261 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 269 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 273 + ~#vub300_driver~0.offset, 1);call write~init~int(1, ~#vub300_driver~0.base, 274 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 275 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 276 + ~#vub300_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~URB_STATE~0 := 0;~DEV_STATE~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~int_urb~0.base, ~int_urb~0.offset := 0, 0;~bulk_urb~0.base, ~bulk_urb~0.offset := 0, 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {12435#(= ~URB_STATE~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret968#1.base, main_#t~ret968#1.offset, main_#t~ret969#1.base, main_#t~ret969#1.offset, main_#t~ret970#1.base, main_#t~ret970#1.offset, main_#t~ret971#1.base, main_#t~ret971#1.offset, main_#t~ret972#1.base, main_#t~ret972#1.offset, main_#t~ret973#1.base, main_#t~ret973#1.offset, main_#t~nondet974#1, main_#t~switch975#1, main_#t~nondet976#1, main_#t~switch977#1, main_#t~ret978#1, main_#t~mem979#1, main_#t~ret980#1, main_#t~ret981#1, main_#t~ret982#1, main_#t~nondet983#1, main_#t~switch984#1, main_#t~mem985#1, main_#t~ret986#1, main_#t~nondet987#1, main_#t~switch988#1, main_#t~ret989#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~tmp___3~2#1, main_~tmp___4~3#1, main_~tmp___5~2#1, main_~tmp___6~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~tmp___3~2#1;havoc main_~tmp___4~3#1;havoc main_~tmp___5~2#1;havoc main_~tmp___6~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,828 INFO L272 TraceCheckUtils]: 2: Hoare triple {12435#(= ~URB_STATE~0 0)} call main_#t~ret968#1.base, main_#t~ret968#1.offset := ldv_init_zalloc(32); {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:30,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L272 TraceCheckUtils]: 9: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,832 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,832 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4422#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {12435#(= ~URB_STATE~0 0)} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret968#1.base, main_#t~ret968#1.offset;havoc main_#t~ret968#1.base, main_#t~ret968#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,833 INFO L272 TraceCheckUtils]: 18: Hoare triple {12435#(= ~URB_STATE~0 0)} call main_#t~ret969#1.base, main_#t~ret969#1.offset := ldv_init_zalloc(1824); {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:30,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,834 INFO L272 TraceCheckUtils]: 20: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L272 TraceCheckUtils]: 25: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,835 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,837 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4424#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {12435#(= ~URB_STATE~0 0)} main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset := main_#t~ret969#1.base, main_#t~ret969#1.offset;havoc main_#t~ret969#1.base, main_#t~ret969#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,840 INFO L272 TraceCheckUtils]: 34: Hoare triple {12435#(= ~URB_STATE~0 0)} call main_#t~ret970#1.base, main_#t~ret970#1.offset := ldv_init_zalloc(16); {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:30,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,841 INFO L272 TraceCheckUtils]: 36: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,843 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,843 INFO L272 TraceCheckUtils]: 41: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,844 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,845 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4426#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {12435#(= ~URB_STATE~0 0)} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret970#1.base, main_#t~ret970#1.offset;havoc main_#t~ret970#1.base, main_#t~ret970#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,846 INFO L272 TraceCheckUtils]: 50: Hoare triple {12435#(= ~URB_STATE~0 0)} call main_#t~ret971#1.base, main_#t~ret971#1.offset := ldv_init_zalloc(136); {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:30,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {12510#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc128.base, #t~malloc128.offset := #Ultimate.allocOnHeap(~size); {12433#true} is VALID [2022-02-20 22:05:30,846 INFO L272 TraceCheckUtils]: 52: Hoare triple {12433#true} call #Ultimate.meminit(#t~malloc128.base, #t~malloc128.offset, 1, ~size, ~size); {12518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:30,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {12518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12433#true} is VALID [2022-02-20 22:05:30,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,847 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12433#true} {12433#true} #4010#return; {12433#true} is VALID [2022-02-20 22:05:30,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {12433#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc128.base, #t~malloc128.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12433#true} is VALID [2022-02-20 22:05:30,847 INFO L272 TraceCheckUtils]: 57: Hoare triple {12433#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12433#true} is VALID [2022-02-20 22:05:30,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {12433#true} ~cond := #in~cond; {12433#true} is VALID [2022-02-20 22:05:30,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {12433#true} assume !(0 == ~cond); {12433#true} is VALID [2022-02-20 22:05:30,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,848 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12433#true} {12433#true} #4012#return; {12433#true} is VALID [2022-02-20 22:05:30,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {12433#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12433#true} is VALID [2022-02-20 22:05:30,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,848 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4428#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {12435#(= ~URB_STATE~0 0)} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret971#1.base, main_#t~ret971#1.offset;havoc main_#t~ret971#1.base, main_#t~ret971#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;assume { :begin_inline_ldv_initialize } true; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {12435#(= ~URB_STATE~0 0)} assume { :end_inline_ldv_initialize } true; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,850 INFO L272 TraceCheckUtils]: 67: Hoare triple {12435#(= ~URB_STATE~0 0)} call main_#t~ret972#1.base, main_#t~ret972#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {12540#(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:05:30,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {12540#(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~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,851 INFO L272 TraceCheckUtils]: 69: Hoare triple {12433#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12540#(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:05:30,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {12540#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {12433#true} is VALID [2022-02-20 22:05:30,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {12433#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {12433#true} is VALID [2022-02-20 22:05:30,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {12433#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12433#true} is VALID [2022-02-20 22:05:30,851 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12433#true} {12433#true} #4020#return; {12433#true} is VALID [2022-02-20 22:05:30,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {12433#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,851 INFO L290 TraceCheckUtils]: 75: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,852 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4430#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {12435#(= ~URB_STATE~0 0)} havoc main_#t~ret972#1.base, main_#t~ret972#1.offset; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,853 INFO L272 TraceCheckUtils]: 78: Hoare triple {12435#(= ~URB_STATE~0 0)} call main_#t~ret973#1.base, main_#t~ret973#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {12540#(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:05:30,853 INFO L290 TraceCheckUtils]: 79: Hoare triple {12540#(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~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,854 INFO L272 TraceCheckUtils]: 80: Hoare triple {12433#true} call #t~memset~res129.base, #t~memset~res129.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12540#(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:05:30,854 INFO L290 TraceCheckUtils]: 81: Hoare triple {12540#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1055 := 0; {12433#true} is VALID [2022-02-20 22:05:30,854 INFO L290 TraceCheckUtils]: 82: Hoare triple {12433#true} assume !(#t~loopctr1055 % 18446744073709551616 < #amount % 18446744073709551616); {12433#true} is VALID [2022-02-20 22:05:30,854 INFO L290 TraceCheckUtils]: 83: Hoare triple {12433#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12433#true} is VALID [2022-02-20 22:05:30,855 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {12433#true} {12433#true} #4020#return; {12433#true} is VALID [2022-02-20 22:05:30,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {12433#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res129.base, #t~memset~res129.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12433#true} is VALID [2022-02-20 22:05:30,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {12433#true} assume true; {12433#true} is VALID [2022-02-20 22:05:30,856 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12433#true} {12435#(= ~URB_STATE~0 0)} #4432#return; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {12435#(= ~URB_STATE~0 0)} havoc main_#t~ret973#1.base, main_#t~ret973#1.offset;~ldv_state_variable_6~0 := 0;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {12435#(= ~URB_STATE~0 0)} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;assume { :begin_inline_work_init_2 } true;~ldv_work_2_0~0 := 0;~ldv_work_2_1~0 := 0;~ldv_work_2_2~0 := 0;~ldv_work_2_3~0 := 0; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {12435#(= ~URB_STATE~0 0)} assume { :end_inline_work_init_2 } true;~ldv_state_variable_2~0 := 1;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {12435#(= ~URB_STATE~0 0)} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {12435#(= ~URB_STATE~0 0)} assume -2147483648 <= main_#t~nondet974#1 && main_#t~nondet974#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet974#1;havoc main_#t~nondet974#1;main_#t~switch975#1 := 0 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 1 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 2 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 3 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,858 INFO L290 TraceCheckUtils]: 96: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 4 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,858 INFO L290 TraceCheckUtils]: 97: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 5 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch975#1;main_#t~switch975#1 := main_#t~switch975#1 || 6 == main_~tmp___3~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,859 INFO L290 TraceCheckUtils]: 99: Hoare triple {12435#(= ~URB_STATE~0 0)} assume main_#t~switch975#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,859 INFO L290 TraceCheckUtils]: 100: Hoare triple {12435#(= ~URB_STATE~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet987#1 && main_#t~nondet987#1 <= 2147483647;main_~tmp___6~2#1 := main_#t~nondet987#1;havoc main_#t~nondet987#1;main_#t~switch988#1 := 0 == main_~tmp___6~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,860 INFO L290 TraceCheckUtils]: 101: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !main_#t~switch988#1;main_#t~switch988#1 := main_#t~switch988#1 || 1 == main_~tmp___6~2#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,860 INFO L290 TraceCheckUtils]: 102: Hoare triple {12435#(= ~URB_STATE~0 0)} assume main_#t~switch988#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,860 INFO L290 TraceCheckUtils]: 103: Hoare triple {12435#(= ~URB_STATE~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_vub300_init } true;havoc vub300_init_#res#1;havoc vub300_init_#t~nondet941#1, vub300_init_#t~nondet942#1.base, vub300_init_#t~nondet942#1.offset, vub300_init_#t~nondet943#1, vub300_init_#t~nondet944#1.base, vub300_init_#t~nondet944#1.offset, vub300_init_#t~nondet945#1, vub300_init_#t~nondet946#1.base, vub300_init_#t~nondet946#1.offset, vub300_init_#t~nondet947#1, vub300_init_#t~ret948#1, vub300_init_#t~nondet949#1, vub300_init_~result~3#1, vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset, vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset, vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset, vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset, vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset, vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset, vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset, vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset, vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_~result~3#1;call vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset;havoc vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset;call vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset;havoc vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset;call vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset;havoc vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_#t~nondet941#1;vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset := 74, 0;havoc vub300_init_#t~nondet942#1.base, vub300_init_#t~nondet942#1.offset;vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset := vub300_init_#t~nondet942#1.base, vub300_init_#t~nondet942#1.offset;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,860 INFO L290 TraceCheckUtils]: 104: Hoare triple {12435#(= ~URB_STATE~0 0)} assume 0 == (~cmndworkqueue~0.base + ~cmndworkqueue~0.offset) % 18446744073709551616;havoc vub300_init_#t~nondet943#1;vub300_init_~result~3#1 := -12; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,861 INFO L290 TraceCheckUtils]: 105: Hoare triple {12435#(= ~URB_STATE~0 0)} vub300_init_#res#1 := vub300_init_~result~3#1;call ULTIMATE.dealloc(vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset);havoc vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset);havoc vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset);havoc vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,861 INFO L290 TraceCheckUtils]: 106: Hoare triple {12435#(= ~URB_STATE~0 0)} main_#t~ret989#1 := vub300_init_#res#1;assume { :end_inline_vub300_init } true;assume -2147483648 <= main_#t~ret989#1 && main_#t~ret989#1 <= 2147483647;~ldv_retval_3~0 := main_#t~ret989#1;havoc main_#t~ret989#1; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,861 INFO L290 TraceCheckUtils]: 107: Hoare triple {12435#(= ~URB_STATE~0 0)} assume !(0 == ~ldv_retval_3~0); {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,862 INFO L290 TraceCheckUtils]: 108: Hoare triple {12435#(= ~URB_STATE~0 0)} assume 0 != ~ldv_retval_3~0;~ldv_state_variable_0~0 := 2; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,862 INFO L290 TraceCheckUtils]: 109: Hoare triple {12435#(= ~URB_STATE~0 0)} assume { :begin_inline_ldv_check_final_state } true; {12435#(= ~URB_STATE~0 0)} is VALID [2022-02-20 22:05:30,862 INFO L290 TraceCheckUtils]: 110: Hoare triple {12435#(= ~URB_STATE~0 0)} assume 0 != ~URB_STATE~0; {12434#false} is VALID [2022-02-20 22:05:30,862 INFO L272 TraceCheckUtils]: 111: Hoare triple {12434#false} call ldv_error(); {12434#false} is VALID [2022-02-20 22:05:30,862 INFO L290 TraceCheckUtils]: 112: Hoare triple {12434#false} assume !false; {12434#false} is VALID [2022-02-20 22:05:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-02-20 22:05:30,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:05:30,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999430819] [2022-02-20 22:05:30,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999430819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:05:30,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:05:30,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:05:30,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398625529] [2022-02-20 22:05:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:05:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 113 [2022-02-20 22:05:30,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:05:30,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:05:30,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:05:30,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:05:30,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:05:30,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:05:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:05:30,928 INFO L87 Difference]: Start difference. First operand 1646 states and 2376 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9)