./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 81d1008401e9b638c804223ae1edaed37e73b80d2f51872c4d92327d9c04897f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:13:45,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:13:45,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:13:45,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:13:45,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:13:45,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:13:45,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:13:45,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:13:45,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:13:45,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:13:45,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:13:45,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:13:45,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:13:45,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:13:45,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:13:45,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:13:45,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:13:45,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:13:45,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:13:45,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:13:45,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:13:45,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:13:45,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:13:45,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:13:45,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:13:45,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:13:45,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:13:45,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:13:45,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:13:45,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:13:45,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:13:45,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:13:45,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:13:45,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:13:45,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:13:45,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:13:45,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:13:45,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:13:45,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:13:45,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:13:45,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:13:45,785 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:13:45,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:13:45,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:13:45,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:13:45,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:13:45,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:13:45,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:13:45,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:13:45,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:13:45,807 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:13:45,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:13:45,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:13:45,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:13:45,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:13:45,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:13:45,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:13:45,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:13:45,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:13:45,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:13:45,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:13:45,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:13:45,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:13:45,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:13:45,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:13:45,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:13:45,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:13:45,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:13:45,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:13:45,810 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:13:45,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:13:45,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:13:45,811 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 -> 81d1008401e9b638c804223ae1edaed37e73b80d2f51872c4d92327d9c04897f [2022-02-20 22:13:45,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:13:46,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:13:46,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:13:46,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:13:46,015 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:13:46,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i [2022-02-20 22:13:46,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29fb32e96/b6efe79a74434c969c2ca5e7972f8fe3/FLAG4e3d63625 [2022-02-20 22:13:46,714 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:13:46,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i [2022-02-20 22:13:46,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29fb32e96/b6efe79a74434c969c2ca5e7972f8fe3/FLAG4e3d63625 [2022-02-20 22:13:47,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29fb32e96/b6efe79a74434c969c2ca5e7972f8fe3 [2022-02-20 22:13:47,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:13:47,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:13:47,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:13:47,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:13:47,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:13:47,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:13:47" (1/1) ... [2022-02-20 22:13:47,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510246df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:47, skipping insertion in model container [2022-02-20 22:13:47,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:13:47" (1/1) ... [2022-02-20 22:13:47,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:13:47,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:13:48,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i[281155,281168] [2022-02-20 22:13:48,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:13:48,862 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:13:49,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i[281155,281168] [2022-02-20 22:13:49,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:13:49,277 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:13:49,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49 WrapperNode [2022-02-20 22:13:49,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:13:49,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:13:49,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:13:49,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:13:49,284 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:13:49" (1/1) ... [2022-02-20 22:13:49,373 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:13:49" (1/1) ... [2022-02-20 22:13:49,605 INFO L137 Inliner]: procedures = 268, calls = 2955, calls flagged for inlining = 107, calls inlined = 104, statements flattened = 7667 [2022-02-20 22:13:49,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:13:49,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:13:49,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:13:49,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:13:49,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:13:49,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:13:49,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:13:49,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:13:49,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (1/1) ... [2022-02-20 22:13:49,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:13:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:13:49,945 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:13:49,966 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:13:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_reset [2022-02-20 22:13:49,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_reset [2022-02-20 22:13:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure end_unlink_async [2022-02-20 22:13:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure end_unlink_async [2022-02-20 22:13:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure dbg_status_buf [2022-02-20 22:13:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure dbg_status_buf [2022-02-20 22:13:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-02-20 22:13:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-02-20 22:13:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-02-20 22:13:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-02-20 22:13:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:13:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:13:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:13:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:13:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure scan_periodic [2022-02-20 22:13:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure scan_periodic [2022-02-20 22:13:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:13:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:13:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-02-20 22:13:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-02-20 22:13:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:13:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:13:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_create [2022-02-20 22:13:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_create [2022-02-20 22:13:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_readl [2022-02-20 22:13:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_readl [2022-02-20 22:13:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_run [2022-02-20 22:13:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_run [2022-02-20 22:13:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:13:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:13:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure periodic_next_shadow [2022-02-20 22:13:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure periodic_next_shadow [2022-02-20 22:13:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure qh_put [2022-02-20 22:13:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_put [2022-02-20 22:13:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_irq [2022-02-20 22:13:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_irq [2022-02-20 22:13:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:13:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:13:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure scan_async [2022-02-20 22:13:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure scan_async [2022-02-20 22:13:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-02-20 22:13:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-02-20 22:13:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:13:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:13:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_halt [2022-02-20 22:13:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_halt [2022-02-20 22:13:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_endpoint_disable [2022-02-20 22:13:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_endpoint_disable [2022-02-20 22:13:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2022-02-20 22:13:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2022-02-20 22:13:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:13:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:13:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-02-20 22:13:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-02-20 22:13:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-02-20 22:13:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-02-20 22:13:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_qtd_free [2022-02-20 22:13:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_qtd_free [2022-02-20 22:13:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:13:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 22:13:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 22:13:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure qtd_list_free [2022-02-20 22:13:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure qtd_list_free [2022-02-20 22:13:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:13:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure qtd_fill [2022-02-20 22:13:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure qtd_fill [2022-02-20 22:13:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-02-20 22:13:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:13:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:13:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_writel [2022-02-20 22:13:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_writel [2022-02-20 22:13:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:13:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:13:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_drv_shutdown [2022-02-20 22:13:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_drv_shutdown [2022-02-20 22:13:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-02-20 22:13:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-02-20 22:13:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_murb_alloc [2022-02-20 22:13:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_murb_alloc [2022-02-20 22:13:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:13:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:13:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure dbg_command_buf [2022-02-20 22:13:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure dbg_command_buf [2022-02-20 22:13:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_urb_enqueue [2022-02-20 22:13:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_urb_enqueue [2022-02-20 22:13:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hc_died [2022-02-20 22:13:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hc_died [2022-02-20 22:13:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure periodic_usecs [2022-02-20 22:13:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure periodic_usecs [2022-02-20 22:13:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure intr_deschedule [2022-02-20 22:13:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure intr_deschedule [2022-02-20 22:13:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_buf_alloc [2022-02-20 22:13:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_buf_alloc [2022-02-20 22:13:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-02-20 22:13:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-02-20 22:13:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 22:13:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 22:13:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_hub_control [2022-02-20 22:13:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_hub_control [2022-02-20 22:13:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_unaligned_access_size [2022-02-20 22:13:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure qh_completions [2022-02-20 22:13:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_completions [2022-02-20 22:13:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 22:13:49,986 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 22:13:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_hcd [2022-02-20 22:13:49,986 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_hcd [2022-02-20 22:13:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-02-20 22:13:49,986 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-02-20 22:13:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:13:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_drv_probe [2022-02-20 22:13:49,986 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_drv_probe [2022-02-20 22:13:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 22:13:49,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 22:13:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure timer_action [2022-02-20 22:13:49,987 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_action [2022-02-20 22:13:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-02-20 22:13:49,987 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-02-20 22:13:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:13:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_get_frame [2022-02-20 22:13:49,987 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_get_frame [2022-02-20 22:13:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_stop [2022-02-20 22:13:49,988 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_stop [2022-02-20 22:13:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-02-20 22:13:49,988 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-02-20 22:13:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:13:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 22:13:49,988 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 22:13:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:13:49,988 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:13:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure qh_schedule [2022-02-20 22:13:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_schedule [2022-02-20 22:13:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure check_intr_schedule [2022-02-20 22:13:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure check_intr_schedule [2022-02-20 22:13:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure __oxu_urb_enqueue [2022-02-20 22:13:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __oxu_urb_enqueue [2022-02-20 22:13:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_drv_remove [2022-02-20 22:13:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_drv_remove [2022-02-20 22:13:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-02-20 22:13:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-02-20 22:13:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:13:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:13:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 22:13:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 22:13:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:13:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-02-20 22:13:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-02-20 22:13:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:13:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:13:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-02-20 22:13:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-02-20 22:13:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_work [2022-02-20 22:13:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_work [2022-02-20 22:13:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure qh_unlink_periodic [2022-02-20 22:13:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_unlink_periodic [2022-02-20 22:13:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:13:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:13:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2022-02-20 22:13:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2022-02-20 22:13:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:13:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-02-20 22:13:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-02-20 22:13:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_async [2022-02-20 22:13:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_async [2022-02-20 22:13:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_mem_cleanup [2022-02-20 22:13:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_mem_cleanup [2022-02-20 22:13:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_to_hcd [2022-02-20 22:13:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_to_hcd [2022-02-20 22:13:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:13:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:13:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-02-20 22:13:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-02-20 22:13:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:13:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_qh_alloc [2022-02-20 22:13:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_qh_alloc [2022-02-20 22:13:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_bus_suspend [2022-02-20 22:13:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_bus_suspend [2022-02-20 22:13:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure usb_calc_bus_time [2022-02-20 22:13:49,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_calc_bus_time [2022-02-20 22:13:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure __le32_to_cpup [2022-02-20 22:13:49,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __le32_to_cpup [2022-02-20 22:13:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-02-20 22:13:49,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-02-20 22:13:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure qh_link_async [2022-02-20 22:13:49,994 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_link_async [2022-02-20 22:13:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:13:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_hub_status_data [2022-02-20 22:13:49,994 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_hub_status_data [2022-02-20 22:13:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_shutdown [2022-02-20 22:13:49,995 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_shutdown [2022-02-20 22:13:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure qh_urb_transaction [2022-02-20 22:13:49,995 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_urb_transaction [2022-02-20 22:13:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:13:49,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:13:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure qh_get [2022-02-20 22:13:49,995 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_get [2022-02-20 22:13:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-02-20 22:13:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-02-20 22:13:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_quiesce [2022-02-20 22:13:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_quiesce [2022-02-20 22:13:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure timer_action_done [2022-02-20 22:13:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_action_done [2022-02-20 22:13:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 22:13:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 22:13:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-02-20 22:13:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-02-20 22:13:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-02-20 22:13:49,997 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-02-20 22:13:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure usb_remove_hcd [2022-02-20 22:13:49,997 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_remove_hcd [2022-02-20 22:13:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_murb_free [2022-02-20 22:13:49,997 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_murb_free [2022-02-20 22:13:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_urb_done [2022-02-20 22:13:49,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_urb_done [2022-02-20 22:13:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2022-02-20 22:13:49,997 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2022-02-20 22:13:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure handshake [2022-02-20 22:13:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure handshake [2022-02-20 22:13:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-02-20 22:13:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-02-20 22:13:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure qh_refresh [2022-02-20 22:13:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_refresh [2022-02-20 22:13:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 22:13:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 22:13:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure start_unlink_async [2022-02-20 22:13:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure start_unlink_async [2022-02-20 22:13:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:13:49,999 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:13:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_bus_resume [2022-02-20 22:13:49,999 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_bus_resume [2022-02-20 22:13:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_urb_dequeue [2022-02-20 22:13:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_urb_dequeue [2022-02-20 22:13:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 22:13:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 22:13:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-02-20 22:13:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-02-20 22:13:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-02-20 22:13:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-02-20 22:13:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-02-20 22:13:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-02-20 22:13:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure qh_append_tds [2022-02-20 22:13:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure qh_append_tds [2022-02-20 22:13:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_remove [2022-02-20 22:13:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_remove [2022-02-20 22:13:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:13:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure ehci_qtd_alloc [2022-02-20 22:13:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ehci_qtd_alloc [2022-02-20 22:13:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_oxu [2022-02-20 22:13:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_oxu [2022-02-20 22:13:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure oxu_reset [2022-02-20 22:13:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure oxu_reset [2022-02-20 22:13:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:13:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:13:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 22:13:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 22:13:50,780 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:13:50,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:13:51,417 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:14:00,528 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:14:00,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:14:00,554 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:14:00,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:14:00 BoogieIcfgContainer [2022-02-20 22:14:00,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:14:00,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:14:00,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:14:00,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:14:00,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:13:47" (1/3) ... [2022-02-20 22:14:00,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef36928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:14:00, skipping insertion in model container [2022-02-20 22:14:00,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:13:49" (2/3) ... [2022-02-20 22:14:00,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef36928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:14:00, skipping insertion in model container [2022-02-20 22:14:00,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:14:00" (3/3) ... [2022-02-20 22:14:00,563 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--usb--host--oxu210hp-hcd.ko-entry_point.cil.out.i [2022-02-20 22:14:00,567 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:14:00,567 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:14:00,621 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:14:00,625 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:14:00,626 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:14:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 3130 states, 2296 states have (on average 1.473432055749129) internal successors, (3383), 2367 states have internal predecessors, (3383), 715 states have call successors, (715), 118 states have call predecessors, (715), 117 states have return successors, (709), 693 states have call predecessors, (709), 709 states have call successors, (709) [2022-02-20 22:14:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-02-20 22:14:00,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:14:00,733 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:14:00,733 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:14:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:14:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash 389147525, now seen corresponding path program 1 times [2022-02-20 22:14:00,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:14:00,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737191264] [2022-02-20 22:14:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:14:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:14:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:14:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:14:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,272 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,272 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,273 INFO L272 TraceCheckUtils]: 6: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,274 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3133#true} #9225#return; {3134#false} is VALID [2022-02-20 22:14:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:14:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:14:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,314 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,315 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,317 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3134#false} #9227#return; {3134#false} is VALID [2022-02-20 22:14:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:14:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:14:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,346 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,347 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,349 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3134#false} #9229#return; {3134#false} is VALID [2022-02-20 22:14:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:14:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:14:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,375 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,375 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,378 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3134#false} #9231#return; {3134#false} is VALID [2022-02-20 22:14:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 22:14:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:14:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,488 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,489 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,490 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,490 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3134#false} #9233#return; {3134#false} is VALID [2022-02-20 22:14:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-20 22:14:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:14:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,517 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,518 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,519 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3134#false} #9235#return; {3134#false} is VALID [2022-02-20 22:14:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-02-20 22:14:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,560 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,560 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,561 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9237#return; {3134#false} is VALID [2022-02-20 22:14:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-02-20 22:14:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,590 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,591 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,591 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9239#return; {3134#false} is VALID [2022-02-20 22:14:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-02-20 22:14:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,609 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,610 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,611 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9241#return; {3134#false} is VALID [2022-02-20 22:14:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-02-20 22:14:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,631 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,632 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,632 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9243#return; {3134#false} is VALID [2022-02-20 22:14:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-02-20 22:14:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,657 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,658 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,658 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9245#return; {3134#false} is VALID [2022-02-20 22:14:01,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-02-20 22:14:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,676 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,677 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,677 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9247#return; {3134#false} is VALID [2022-02-20 22:14:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-02-20 22:14:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,697 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,697 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,698 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9249#return; {3134#false} is VALID [2022-02-20 22:14:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-02-20 22:14:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,716 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,717 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,717 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9251#return; {3134#false} is VALID [2022-02-20 22:14:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-02-20 22:14:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,736 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,737 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,737 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9253#return; {3134#false} is VALID [2022-02-20 22:14:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-02-20 22:14:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,759 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,759 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,760 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9255#return; {3134#false} is VALID [2022-02-20 22:14:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-02-20 22:14:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,776 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9257#return; {3134#false} is VALID [2022-02-20 22:14:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-02-20 22:14:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:14:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:14:01,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L272 TraceCheckUtils]: 1: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,793 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3133#true} {3134#false} #9259#return; {3134#false} is VALID [2022-02-20 22:14:01,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(85, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(20, 5);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(2, 8);call write~init~int(32, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(1, 9);call write~init~int(0, 9, 0, 1);call #Ultimate.allocInit(7, 10);call write~init~int(32, 10, 0, 1);call write~init~int(65, 10, 1, 1);call write~init~int(115, 10, 2, 1);call write~init~int(121, 10, 3, 1);call write~init~int(110, 10, 4, 1);call write~init~int(99, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(1, 11);call write~init~int(0, 11, 0, 1);call #Ultimate.allocInit(10, 12);call #Ultimate.allocInit(1, 13);call write~init~int(0, 13, 0, 1);call #Ultimate.allocInit(6, 14);call write~init~int(32, 14, 0, 1);call write~init~int(82, 14, 1, 1);call write~init~int(101, 14, 2, 1);call write~init~int(99, 14, 3, 1);call write~init~int(108, 14, 4, 1);call write~init~int(0, 14, 5, 1);call #Ultimate.allocInit(1, 15);call write~init~int(0, 15, 0, 1);call #Ultimate.allocInit(6, 16);call write~init~int(32, 16, 0, 1);call write~init~int(72, 16, 1, 1);call write~init~int(97, 16, 2, 1);call write~init~int(108, 16, 3, 1);call write~init~int(116, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(5, 18);call write~init~int(32, 18, 0, 1);call write~init~int(73, 18, 1, 1);call write~init~int(65, 18, 2, 1);call write~init~int(65, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(7, 20);call write~init~int(32, 20, 0, 1);call write~init~int(70, 20, 1, 1);call write~init~int(65, 20, 2, 1);call write~init~int(84, 20, 3, 1);call write~init~int(65, 20, 4, 1);call write~init~int(76, 20, 5, 1);call write~init~int(0, 20, 6, 1);call #Ultimate.allocInit(1, 21);call write~init~int(0, 21, 0, 1);call #Ultimate.allocInit(5, 22);call write~init~int(32, 22, 0, 1);call write~init~int(70, 22, 1, 1);call write~init~int(76, 22, 2, 1);call write~init~int(82, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(1, 23);call write~init~int(0, 23, 0, 1);call #Ultimate.allocInit(5, 24);call write~init~int(32, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(67, 24, 2, 1);call write~init~int(68, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(1, 25);call write~init~int(0, 25, 0, 1);call #Ultimate.allocInit(5, 26);call write~init~int(32, 26, 0, 1);call write~init~int(69, 26, 1, 1);call write~init~int(82, 26, 2, 1);call write~init~int(82, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(1, 27);call write~init~int(0, 27, 0, 1);call #Ultimate.allocInit(5, 28);call write~init~int(32, 28, 0, 1);call write~init~int(73, 28, 1, 1);call write~init~int(78, 28, 2, 1);call write~init~int(84, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(1, 29);call write~init~int(0, 29, 0, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(48, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(53, 31, 0, 1);call write~init~int(49, 31, 1, 1);call write~init~int(50, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int(50, 32, 0, 1);call write~init~int(53, 32, 1, 1);call write~init~int(54, 32, 2, 1);call write~init~int(0, 32, 3, 1);call #Ultimate.allocInit(3, 33);call write~init~int(63, 33, 0, 1);call write~init~int(63, 33, 1, 1);call write~init~int(0, 33, 2, 1);call #Ultimate.allocInit(57, 34);call #Ultimate.allocInit(2, 35);call write~init~int(32, 35, 0, 1);call write~init~int(0, 35, 1, 1);call #Ultimate.allocInit(1, 36);call write~init~int(0, 36, 0, 1);call #Ultimate.allocInit(5, 37);call write~init~int(112, 37, 0, 1);call write~init~int(97, 37, 1, 1);call write~init~int(114, 37, 2, 1);call write~init~int(107, 37, 3, 1);call write~init~int(0, 37, 4, 1);call #Ultimate.allocInit(7, 38);call write~init~int(40, 38, 0, 1);call write~init~int(112, 38, 1, 1);call write~init~int(97, 38, 2, 1);call write~init~int(114, 38, 3, 1);call write~init~int(107, 38, 4, 1);call write~init~int(41, 38, 5, 1);call write~init~int(0, 38, 6, 1);call #Ultimate.allocInit(8, 39);call #Ultimate.allocInit(1, 40);call write~init~int(0, 40, 0, 1);call #Ultimate.allocInit(6, 41);call write~init~int(32, 41, 0, 1);call write~init~int(73, 41, 1, 1);call write~init~int(65, 41, 2, 1);call write~init~int(65, 41, 3, 1);call write~init~int(68, 41, 4, 1);call write~init~int(0, 41, 5, 1);call #Ultimate.allocInit(1, 42);call write~init~int(0, 42, 0, 1);call #Ultimate.allocInit(7, 43);call write~init~int(32, 43, 0, 1);call write~init~int(65, 43, 1, 1);call write~init~int(115, 43, 2, 1);call write~init~int(121, 43, 3, 1);call write~init~int(110, 43, 4, 1);call write~init~int(99, 43, 5, 1);call write~init~int(0, 43, 6, 1);call #Ultimate.allocInit(1, 44);call write~init~int(0, 44, 0, 1);call #Ultimate.allocInit(10, 45);call #Ultimate.allocInit(1, 46);call write~init~int(0, 46, 0, 1);call #Ultimate.allocInit(7, 47);call write~init~int(32, 47, 0, 1);call write~init~int(82, 47, 1, 1);call write~init~int(101, 47, 2, 1);call write~init~int(115, 47, 3, 1);call write~init~int(101, 47, 4, 1);call write~init~int(116, 47, 5, 1);call write~init~int(0, 47, 6, 1);call #Ultimate.allocInit(1, 48);call write~init~int(0, 48, 0, 1);call #Ultimate.allocInit(4, 49);call write~init~int(82, 49, 0, 1);call write~init~int(85, 49, 1, 1);call write~init~int(78, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(5, 50);call write~init~int(72, 50, 0, 1);call write~init~int(65, 50, 1, 1);call write~init~int(76, 50, 2, 1);call write~init~int(84, 50, 3, 1);call write~init~int(0, 50, 4, 1);call #Ultimate.allocInit(4, 51);call write~init~int(115, 51, 0, 1);call write~init~int(101, 51, 1, 1);call write~init~int(48, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(2, 52);call write~init~int(107, 52, 0, 1);call write~init~int(0, 52, 1, 1);call #Ultimate.allocInit(2, 53);call write~init~int(106, 53, 0, 1);call write~init~int(0, 53, 1, 1);call #Ultimate.allocInit(2, 54);call write~init~int(63, 54, 0, 1);call write~init~int(0, 54, 1, 1);call #Ultimate.allocInit(53, 55);call #Ultimate.allocInit(2, 56);call write~init~int(32, 56, 0, 1);call write~init~int(0, 56, 1, 1);call #Ultimate.allocInit(1, 57);call write~init~int(0, 57, 0, 1);call #Ultimate.allocInit(7, 58);call write~init~int(32, 58, 0, 1);call write~init~int(80, 58, 1, 1);call write~init~int(79, 58, 2, 1);call write~init~int(87, 58, 3, 1);call write~init~int(69, 58, 4, 1);call write~init~int(82, 58, 5, 1);call write~init~int(0, 58, 6, 1);call #Ultimate.allocInit(1, 59);call write~init~int(0, 59, 0, 1);call #Ultimate.allocInit(7, 60);call write~init~int(32, 60, 0, 1);call write~init~int(79, 60, 1, 1);call write~init~int(87, 60, 2, 1);call write~init~int(78, 60, 3, 1);call write~init~int(69, 60, 4, 1);call write~init~int(82, 60, 5, 1);call write~init~int(0, 60, 6, 1);call #Ultimate.allocInit(1, 61);call write~init~int(0, 61, 0, 1);call #Ultimate.allocInit(7, 62);call write~init~int(32, 62, 0, 1);call write~init~int(82, 62, 1, 1);call write~init~int(69, 62, 2, 1);call write~init~int(83, 62, 3, 1);call write~init~int(69, 62, 4, 1);call write~init~int(84, 62, 5, 1);call write~init~int(0, 62, 6, 1);call #Ultimate.allocInit(1, 63);call write~init~int(0, 63, 0, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(1, 65);call write~init~int(0, 65, 0, 1);call #Ultimate.allocInit(8, 66);call #Ultimate.allocInit(1, 67);call write~init~int(0, 67, 0, 1);call #Ultimate.allocInit(5, 68);call write~init~int(32, 68, 0, 1);call write~init~int(79, 68, 1, 1);call write~init~int(67, 68, 2, 1);call write~init~int(67, 68, 3, 1);call write~init~int(0, 68, 4, 1);call #Ultimate.allocInit(1, 69);call write~init~int(0, 69, 0, 1);call #Ultimate.allocInit(4, 70);call write~init~int(32, 70, 0, 1);call write~init~int(79, 70, 1, 1);call write~init~int(67, 70, 2, 1);call write~init~int(0, 70, 3, 1);call #Ultimate.allocInit(1, 71);call write~init~int(0, 71, 0, 1);call #Ultimate.allocInit(5, 72);call write~init~int(32, 72, 0, 1);call write~init~int(80, 72, 1, 1);call write~init~int(69, 72, 2, 1);call write~init~int(67, 72, 3, 1);call write~init~int(0, 72, 4, 1);call #Ultimate.allocInit(1, 73);call write~init~int(0, 73, 0, 1);call #Ultimate.allocInit(4, 74);call write~init~int(32, 74, 0, 1);call write~init~int(80, 74, 1, 1);call write~init~int(69, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(1, 75);call write~init~int(0, 75, 0, 1);call #Ultimate.allocInit(5, 76);call write~init~int(32, 76, 0, 1);call write~init~int(67, 76, 1, 1);call write~init~int(83, 76, 2, 1);call write~init~int(67, 76, 3, 1);call write~init~int(0, 76, 4, 1);call #Ultimate.allocInit(1, 77);call write~init~int(0, 77, 0, 1);call #Ultimate.allocInit(9, 78);call #Ultimate.allocInit(1, 79);call write~init~int(0, 79, 0, 1);call #Ultimate.allocInit(6, 80);call write~init~int(114, 80, 0, 1);call write~init~int(101, 80, 1, 1);call write~init~int(115, 80, 2, 1);call write~init~int(101, 80, 3, 1);call write~init~int(116, 80, 4, 1);call write~init~int(0, 80, 5, 1);call #Ultimate.allocInit(13, 81);call #Ultimate.allocInit(11, 82);call #Ultimate.allocInit(210, 83);call #Ultimate.allocInit(4, 84);call write~init~int(37, 84, 0, 1);call write~init~int(115, 84, 1, 1);call write~init~int(10, 84, 2, 1);call write~init~int(0, 84, 3, 1);call #Ultimate.allocInit(4, 85);call write~init~int(37, 85, 0, 1);call write~init~int(115, 85, 1, 1);call write~init~int(10, 85, 2, 1);call write~init~int(0, 85, 3, 1);call #Ultimate.allocInit(13, 86);call #Ultimate.allocInit(21, 87);call #Ultimate.allocInit(210, 88);call #Ultimate.allocInit(41, 89);call #Ultimate.allocInit(41, 90);call #Ultimate.allocInit(13, 91);call #Ultimate.allocInit(21, 92);call #Ultimate.allocInit(210, 93);call #Ultimate.allocInit(20, 94);call #Ultimate.allocInit(20, 95);call #Ultimate.allocInit(21, 96);call #Ultimate.allocInit(13, 97);call #Ultimate.allocInit(11, 98);call #Ultimate.allocInit(210, 99);call #Ultimate.allocInit(22, 100);call #Ultimate.allocInit(22, 101);call #Ultimate.allocInit(13, 102);call #Ultimate.allocInit(13, 103);call #Ultimate.allocInit(210, 104);call #Ultimate.allocInit(13, 105);call #Ultimate.allocInit(13, 106);call #Ultimate.allocInit(13, 107);call #Ultimate.allocInit(14, 108);call #Ultimate.allocInit(210, 109);call #Ultimate.allocInit(22, 110);call #Ultimate.allocInit(22, 111);call #Ultimate.allocInit(13, 112);call #Ultimate.allocInit(16, 113);call #Ultimate.allocInit(210, 114);call #Ultimate.allocInit(28, 115);call #Ultimate.allocInit(28, 116);call #Ultimate.allocInit(3, 117);call write~init~int(105, 117, 0, 1);call write~init~int(110, 117, 1, 1);call write~init~int(0, 117, 2, 1);call #Ultimate.allocInit(4, 118);call write~init~int(111, 118, 0, 1);call write~init~int(117, 118, 1, 1);call write~init~int(116, 118, 2, 1);call write~init~int(0, 118, 3, 1);call #Ultimate.allocInit(13, 119);call #Ultimate.allocInit(8, 120);call #Ultimate.allocInit(210, 121);call #Ultimate.allocInit(31, 122);call #Ultimate.allocInit(31, 123);call #Ultimate.allocInit(13, 124);call #Ultimate.allocInit(8, 125);call #Ultimate.allocInit(210, 126);call #Ultimate.allocInit(23, 127);call #Ultimate.allocInit(23, 128);call #Ultimate.allocInit(35, 129);call #Ultimate.allocInit(13, 130);call #Ultimate.allocInit(17, 131);call #Ultimate.allocInit(210, 132);call #Ultimate.allocInit(39, 133);call #Ultimate.allocInit(39, 134);call #Ultimate.allocInit(13, 135);call #Ultimate.allocInit(19, 136);call #Ultimate.allocInit(210, 137);call #Ultimate.allocInit(41, 138);call #Ultimate.allocInit(41, 139);call #Ultimate.allocInit(13, 140);call #Ultimate.allocInit(12, 141);call #Ultimate.allocInit(210, 142);call #Ultimate.allocInit(23, 143);call #Ultimate.allocInit(23, 144);call #Ultimate.allocInit(13, 145);call #Ultimate.allocInit(11, 146);call #Ultimate.allocInit(210, 147);call #Ultimate.allocInit(25, 148);call #Ultimate.allocInit(25, 149);call #Ultimate.allocInit(13, 150);call #Ultimate.allocInit(12, 151);call #Ultimate.allocInit(210, 152);call #Ultimate.allocInit(31, 153);call #Ultimate.allocInit(31, 154);call #Ultimate.allocInit(13, 155);call #Ultimate.allocInit(14, 156);call #Ultimate.allocInit(210, 157);call #Ultimate.allocInit(36, 158);call #Ultimate.allocInit(36, 159);call #Ultimate.allocInit(13, 160);call #Ultimate.allocInit(16, 161);call #Ultimate.allocInit(210, 162);call #Ultimate.allocInit(21, 163);call #Ultimate.allocInit(21, 164);call #Ultimate.allocInit(3, 165);call write~init~int(117, 165, 0, 1);call write~init~int(112, 165, 1, 1);call write~init~int(0, 165, 2, 1);call #Ultimate.allocInit(5, 166);call write~init~int(100, 166, 0, 1);call write~init~int(111, 166, 1, 1);call write~init~int(119, 166, 2, 1);call write~init~int(110, 166, 3, 1);call write~init~int(0, 166, 4, 1);call #Ultimate.allocInit(13, 167);call #Ultimate.allocInit(15, 168);call #Ultimate.allocInit(210, 169);call #Ultimate.allocInit(16, 170);call #Ultimate.allocInit(16, 171);call #Ultimate.allocInit(13, 172);call #Ultimate.allocInit(15, 173);call #Ultimate.allocInit(210, 174);call #Ultimate.allocInit(23, 175);call #Ultimate.allocInit(23, 176);call #Ultimate.allocInit(6, 177);call write~init~int(102, 177, 0, 1);call write~init~int(97, 177, 1, 1);call write~init~int(116, 177, 2, 1);call write~init~int(97, 177, 3, 1);call write~init~int(108, 177, 4, 1);call write~init~int(0, 177, 5, 1);call #Ultimate.allocInit(13, 178);call #Ultimate.allocInit(15, 179);call #Ultimate.allocInit(210, 180);call #Ultimate.allocInit(4, 181);call write~init~int(37, 181, 0, 1);call write~init~int(115, 181, 1, 1);call write~init~int(10, 181, 2, 1);call write~init~int(0, 181, 3, 1);call #Ultimate.allocInit(4, 182);call write~init~int(37, 182, 0, 1);call write~init~int(115, 182, 1, 1);call write~init~int(10, 182, 2, 1);call write~init~int(0, 182, 3, 1);call #Ultimate.allocInit(6, 183);call write~init~int(102, 183, 0, 1);call write~init~int(97, 183, 1, 1);call write~init~int(116, 183, 2, 1);call write~init~int(97, 183, 3, 1);call write~init~int(108, 183, 4, 1);call write~init~int(0, 183, 5, 1);call #Ultimate.allocInit(13, 184);call #Ultimate.allocInit(15, 185);call #Ultimate.allocInit(210, 186);call #Ultimate.allocInit(4, 187);call write~init~int(37, 187, 0, 1);call write~init~int(115, 187, 1, 1);call write~init~int(10, 187, 2, 1);call write~init~int(0, 187, 3, 1);call #Ultimate.allocInit(4, 188);call write~init~int(37, 188, 0, 1);call write~init~int(115, 188, 1, 1);call write~init~int(10, 188, 2, 1);call write~init~int(0, 188, 3, 1);call #Ultimate.allocInit(13, 189);call #Ultimate.allocInit(21, 190);call #Ultimate.allocInit(13, 191);call #Ultimate.allocInit(13, 192);call #Ultimate.allocInit(210, 193);call #Ultimate.allocInit(9, 194);call #Ultimate.allocInit(9, 195);call #Ultimate.allocInit(25, 196);call #Ultimate.allocInit(5, 197);call write~init~int(105, 197, 0, 1);call write~init~int(110, 197, 1, 1);call write~init~int(105, 197, 2, 1);call write~init~int(116, 197, 3, 1);call write~init~int(0, 197, 4, 1);call #Ultimate.allocInit(13, 198);call #Ultimate.allocInit(8, 199);call #Ultimate.allocInit(210, 200);call #Ultimate.allocInit(4, 201);call write~init~int(37, 201, 0, 1);call write~init~int(115, 201, 1, 1);call write~init~int(10, 201, 2, 1);call write~init~int(0, 201, 3, 1);call #Ultimate.allocInit(4, 202);call write~init~int(37, 202, 0, 1);call write~init~int(115, 202, 1, 1);call write~init~int(10, 202, 2, 1);call write~init~int(0, 202, 3, 1);call #Ultimate.allocInit(52, 203);call #Ultimate.allocInit(7, 204);call write~init~int(48, 204, 0, 1);call write~init~int(46, 204, 1, 1);call write~init~int(48, 204, 2, 1);call write~init~int(46, 204, 3, 1);call write~init~int(53, 204, 4, 1);call write~init~int(48, 204, 5, 1);call write~init~int(0, 204, 6, 1);call #Ultimate.allocInit(22, 205);call #Ultimate.allocInit(1, 206);call write~init~int(0, 206, 0, 1);call #Ultimate.allocInit(19, 207);call #Ultimate.allocInit(13, 208);call #Ultimate.allocInit(9, 209);call #Ultimate.allocInit(210, 210);call #Ultimate.allocInit(4, 211);call write~init~int(37, 211, 0, 1);call write~init~int(115, 211, 1, 1);call write~init~int(10, 211, 2, 1);call write~init~int(0, 211, 3, 1);call #Ultimate.allocInit(4, 212);call write~init~int(37, 212, 0, 1);call write~init~int(115, 212, 1, 1);call write~init~int(10, 212, 2, 1);call write~init~int(0, 212, 3, 1);call #Ultimate.allocInit(13, 213);call #Ultimate.allocInit(16, 214);call #Ultimate.allocInit(210, 215);call #Ultimate.allocInit(22, 216);call #Ultimate.allocInit(22, 217);call #Ultimate.allocInit(32, 218);call #Ultimate.allocInit(26, 219);call #Ultimate.allocInit(1, 220);call write~init~int(0, 220, 0, 1);call #Ultimate.allocInit(10, 221);call #Ultimate.allocInit(25, 222);call #Ultimate.allocInit(24, 223);call #Ultimate.allocInit(13, 224);call #Ultimate.allocInit(16, 225);call #Ultimate.allocInit(210, 226);call #Ultimate.allocInit(23, 227);call #Ultimate.allocInit(23, 228);call #Ultimate.allocInit(10, 229);call #Ultimate.allocInit(13, 230);call #Ultimate.allocInit(16, 231);call #Ultimate.allocInit(210, 232);call #Ultimate.allocInit(4, 233);call write~init~int(37, 233, 0, 1);call write~init~int(115, 233, 1, 1);call write~init~int(10, 233, 2, 1);call write~init~int(0, 233, 3, 1);call #Ultimate.allocInit(4, 234);call write~init~int(37, 234, 0, 1);call write~init~int(115, 234, 1, 1);call write~init~int(10, 234, 2, 1);call write~init~int(0, 234, 3, 1);call #Ultimate.allocInit(13, 235);call #Ultimate.allocInit(16, 236);call #Ultimate.allocInit(210, 237);call #Ultimate.allocInit(18, 238);call #Ultimate.allocInit(18, 239);call #Ultimate.allocInit(13, 240);call #Ultimate.allocInit(15, 241);call #Ultimate.allocInit(210, 242);call #Ultimate.allocInit(19, 243);call #Ultimate.allocInit(19, 244);call #Ultimate.allocInit(1, 245);call write~init~int(0, 245, 0, 1);call #Ultimate.allocInit(18, 246);call #Ultimate.allocInit(13, 247);call #Ultimate.allocInit(13, 248);call #Ultimate.allocInit(9, 249);call #Ultimate.allocInit(13, 250);call #Ultimate.allocInit(13, 251);call #Ultimate.allocInit(9, 252);call #Ultimate.allocInit(14, 253);call #Ultimate.allocInit(32, 254);call #Ultimate.allocInit(13, 255);call #Ultimate.allocInit(13, 256);call #Ultimate.allocInit(19, 257);call #Ultimate.allocInit(31, 258);call #Ultimate.allocInit(31, 259);call #Ultimate.allocInit(25, 260);call #Ultimate.allocInit(13, 261);call #Ultimate.allocInit(14, 262);call #Ultimate.allocInit(210, 263);call #Ultimate.allocInit(17, 264);call #Ultimate.allocInit(17, 265);call #Ultimate.allocInit(24, 266);call #Ultimate.allocInit(13, 267);call #Ultimate.allocInit(14, 268);call #Ultimate.allocInit(210, 269);call #Ultimate.allocInit(25, 270);call #Ultimate.allocInit(25, 271);call #Ultimate.allocInit(29, 272);call #Ultimate.allocInit(18, 273);call #Ultimate.allocInit(13, 274);~oxu_hc_driver_group1~0.base, ~oxu_hc_driver_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_1_0~0 := 0;~ldv_timer_list_1_3~0.base, ~ldv_timer_list_1_3~0.offset := 0, 0;~ldv_timer_1_3~0 := 0;~oxu_hc_driver_group0~0.base, ~oxu_hc_driver_group0~0.offset := 0, 0;~probed_2~0 := 0;~ldv_timer_list_1_1~0.base, ~ldv_timer_list_1_1~0.offset := 0, 0;~ldv_timer_list_1_0~0.base, ~ldv_timer_list_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_timer_1_2~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_timer_1_1~0 := 0;~oxu_driver_group1~0.base, ~oxu_driver_group1~0.offset := 0, 0;~ldv_timer_list_1_2~0.base, ~ldv_timer_list_1_2~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_4~0 := 0;~#fls_strings~0.base, ~#fls_strings~0.offset := 275, 0;call #Ultimate.allocInit(32, 275);call write~init~$Pointer$(30, 0, ~#fls_strings~0.base, ~#fls_strings~0.offset, 8);call write~init~$Pointer$(31, 0, ~#fls_strings~0.base, 8 + ~#fls_strings~0.offset, 8);call write~init~$Pointer$(32, 0, ~#fls_strings~0.base, 16 + ~#fls_strings~0.offset, 8);call write~init~$Pointer$(33, 0, ~#fls_strings~0.base, 24 + ~#fls_strings~0.offset, 8);~log2_irq_thresh~0 := 0;~park~0 := 0;~ignore_oc~0 := 0;~#oxu_hc_driver~0.base, ~#oxu_hc_driver~0.offset := 276, 0;call #Ultimate.allocInit(348, 276);call write~init~$Pointer$(247, 0, ~#oxu_hc_driver~0.base, ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(248, 0, ~#oxu_hc_driver~0.base, 8 + ~#oxu_hc_driver~0.offset, 8);call write~init~int(768, ~#oxu_hc_driver~0.base, 16 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_irq.base, #funAddr~oxu_irq.offset, ~#oxu_hc_driver~0.base, 24 + ~#oxu_hc_driver~0.offset, 8);call write~init~int(33, ~#oxu_hc_driver~0.base, 32 + ~#oxu_hc_driver~0.offset, 4);call write~init~$Pointer$(#funAddr~oxu_reset.base, #funAddr~oxu_reset.offset, ~#oxu_hc_driver~0.base, 36 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_run.base, #funAddr~oxu_run.offset, ~#oxu_hc_driver~0.base, 44 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 52 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 60 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_stop.base, #funAddr~oxu_stop.offset, ~#oxu_hc_driver~0.base, 68 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_shutdown.base, #funAddr~oxu_shutdown.offset, ~#oxu_hc_driver~0.base, 76 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_get_frame.base, #funAddr~oxu_get_frame.offset, ~#oxu_hc_driver~0.base, 84 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_urb_enqueue.base, #funAddr~oxu_urb_enqueue.offset, ~#oxu_hc_driver~0.base, 92 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_urb_dequeue.base, #funAddr~oxu_urb_dequeue.offset, ~#oxu_hc_driver~0.base, 100 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 108 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 116 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_endpoint_disable.base, #funAddr~oxu_endpoint_disable.offset, ~#oxu_hc_driver~0.base, 124 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 132 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_hub_status_data.base, #funAddr~oxu_hub_status_data.offset, ~#oxu_hc_driver~0.base, 140 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_hub_control.base, #funAddr~oxu_hub_control.offset, ~#oxu_hc_driver~0.base, 148 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_bus_suspend.base, #funAddr~oxu_bus_suspend.offset, ~#oxu_hc_driver~0.base, 156 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_bus_resume.base, #funAddr~oxu_bus_resume.offset, ~#oxu_hc_driver~0.base, 164 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 172 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 180 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 188 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 196 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 204 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 212 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 220 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 228 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 236 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 244 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 252 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 260 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 268 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 276 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 284 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 292 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 300 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 308 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 316 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 324 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 332 + ~#oxu_hc_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_hc_driver~0.base, 340 + ~#oxu_hc_driver~0.offset, 8);~#oxu_driver~0.base, ~#oxu_driver~0.offset := 277, 0;call #Ultimate.allocInit(166, 277);call write~init~$Pointer$(#funAddr~oxu_drv_probe.base, #funAddr~oxu_drv_probe.offset, ~#oxu_driver~0.base, ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_drv_remove.base, #funAddr~oxu_drv_remove.offset, ~#oxu_driver~0.base, 8 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~oxu_drv_shutdown.base, #funAddr~oxu_drv_shutdown.offset, ~#oxu_driver~0.base, 16 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 24 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 32 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(274, 0, ~#oxu_driver~0.base, 40 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(~#platform_bus_type~0.base, ~#platform_bus_type~0.offset, ~#oxu_driver~0.base, 48 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 56 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 64 + ~#oxu_driver~0.offset, 8);call write~init~int(0, ~#oxu_driver~0.base, 72 + ~#oxu_driver~0.offset, 1);call write~init~int(0, ~#oxu_driver~0.base, 73 + ~#oxu_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 77 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 85 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 93 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 101 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 109 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 117 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 125 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 133 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 141 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 149 + ~#oxu_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#oxu_driver~0.base, 157 + ~#oxu_driver~0.offset, 8);call write~init~int(0, ~#oxu_driver~0.base, 165 + ~#oxu_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_module_refcounter~0 := 1; {3133#true} is VALID [2022-02-20 22:14:01,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1442#1.base, main_#t~ret1442#1.offset, main_#t~ret1443#1.base, main_#t~ret1443#1.offset, main_#t~ret1444#1.base, main_#t~ret1444#1.offset, main_#t~ret1445#1.base, main_#t~ret1445#1.offset, main_#t~ret1446#1.base, main_#t~ret1446#1.offset, main_#t~ret1447#1.base, main_#t~ret1447#1.offset, main_#t~ret1448#1.base, main_#t~ret1448#1.offset, main_#t~ret1449#1.base, main_#t~ret1449#1.offset, main_#t~ret1450#1.base, main_#t~ret1450#1.offset, main_#t~ret1451#1.base, main_#t~ret1451#1.offset, main_#t~ret1452#1.base, main_#t~ret1452#1.offset, main_#t~ret1453#1.base, main_#t~ret1453#1.offset, main_#t~ret1454#1.base, main_#t~ret1454#1.offset, main_#t~ret1455#1.base, main_#t~ret1455#1.offset, main_#t~ret1456#1.base, main_#t~ret1456#1.offset, main_#t~ret1457#1.base, main_#t~ret1457#1.offset, main_#t~ret1458#1.base, main_#t~ret1458#1.offset, main_#t~ret1459#1.base, main_#t~ret1459#1.offset, main_#t~nondet1460#1, main_#t~switch1461#1, main_#t~nondet1462#1, main_#t~switch1463#1, main_#t~ret1464#1, main_#t~mem1465#1, main_#t~ret1466#1, main_#t~mem1467#1, main_#t~ret1468#1, main_#t~mem1469#1, main_#t~ret1470#1, main_#t~ret1471#1, main_#t~ret1472#1, main_#t~ret1473#1, main_#t~ret1474#1, main_#t~ret1475#1, main_#t~ret1476#1, main_#t~ret1477#1, main_#t~ret1478#1, main_#t~ret1479#1, main_#t~ret1480#1, main_#t~ret1481#1, main_#t~ret1482#1, main_#t~ret1483#1, main_#t~ret1484#1, main_#t~ret1485#1, main_#t~mem1486#1, main_#t~ret1487#1, main_#t~mem1488#1, main_#t~ret1489#1, main_#t~mem1490#1, main_#t~ret1491#1, main_#t~mem1492#1, main_#t~mem1493#1, main_#t~mem1494#1, main_#t~mem1495#1, main_#t~ret1496#1, main_#t~mem1497#1, main_#t~mem1498#1, main_#t~mem1499#1, main_#t~mem1500#1, main_#t~ret1501#1, main_#t~mem1502#1, main_#t~mem1503#1, main_#t~mem1504#1, main_#t~mem1505#1, main_#t~ret1506#1, main_#t~ret1507#1, main_#t~ret1508#1, main_#t~ret1509#1, main_#t~nondet1510#1, main_#t~switch1511#1, main_#t~ret1512#1, main_#t~nondet1513#1, main_#t~switch1514#1, main_#t~ret1515#1, main_#t~mem1516#1, main_#t~ret1517#1, main_#t~mem1518#1, main_#t~ret1519#1, main_#t~mem1520#1, main_#t~ret1521#1, main_#t~ret1522#1, main_#t~ret1523#1, main_#t~ret1524#1, main_#t~ret1525#1, main_#t~ret1526#1, main_#t~ret1527#1, main_#t~ret1528#1, main_#t~ret1529#1, main_#t~ret1530#1, main_#t~ret1531#1, main_#t~ret1532#1, main_#t~ret1533#1, main_#t~ret1534#1, main_#t~ret1535#1, main_#t~ret1536#1, main_#t~mem1537#1, main_#t~ret1538#1, main_#t~mem1539#1, main_#t~ret1540#1, main_#t~mem1541#1, main_#t~ret1542#1, main_#t~mem1543#1, main_#t~mem1544#1, main_#t~mem1545#1, main_#t~mem1546#1, main_#t~ret1547#1, main_#t~mem1548#1, main_#t~mem1549#1, main_#t~mem1550#1, main_#t~mem1551#1, main_#t~ret1552#1, main_#t~mem1553#1, main_#t~mem1554#1, main_#t~mem1555#1, main_#t~mem1556#1, main_#t~ret1557#1, main_#t~ret1558#1, main_#t~ret1559#1, main_#t~ret1560#1, main_#t~nondet1561#1, main_#t~switch1562#1, main_#t~ret1563#1, main_#t~ret1564#1, main_#t~ret1565#1, main_#t~ret1566#1, main_#t~ret1567#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~91#1.base, main_~tmp~91#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___0~59#1.base, main_~tmp___0~59#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~43#1.base, main_~tmp___1~43#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset, main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset, main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset, main_~tmp___2~31#1.base, main_~tmp___2~31#1.offset, main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset, main_~tmp___3~24#1.base, main_~tmp___3~24#1.offset, main_~#ldvarg17~0#1.base, main_~#ldvarg17~0#1.offset, main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___4~16#1.base, main_~tmp___4~16#1.offset, main_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset, main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset, main_~tmp___5~13#1, main_~tmp___6~9#1, main_~tmp___7~9#1, main_~tmp___8~4#1, main_~tmp___9~4#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~91#1.base, main_~tmp~91#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___0~59#1.base, main_~tmp___0~59#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~43#1.base, main_~tmp___1~43#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset;havoc main_~tmp___2~31#1.base, main_~tmp___2~31#1.offset;havoc main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset;havoc main_~tmp___3~24#1.base, main_~tmp___3~24#1.offset;call main_~#ldvarg17~0#1.base, main_~#ldvarg17~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___4~16#1.base, main_~tmp___4~16#1.offset;call main_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset := #Ultimate.allocOnStack(2);call main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset := #Ultimate.allocOnStack(2);havoc main_~tmp___5~13#1;havoc main_~tmp___6~9#1;havoc main_~tmp___7~9#1;havoc main_~tmp___8~4#1;havoc main_~tmp___9~4#1; {3133#true} is VALID [2022-02-20 22:14:01,805 INFO L272 TraceCheckUtils]: 2: Hoare triple {3133#true} call main_#t~ret1442#1.base, main_#t~ret1442#1.offset := ldv_init_zalloc(72); {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:14:01,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,806 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,806 INFO L272 TraceCheckUtils]: 9: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,807 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,807 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3134#false} {3133#true} #9225#return; {3134#false} is VALID [2022-02-20 22:14:01,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {3134#false} main_~tmp~91#1.base, main_~tmp~91#1.offset := main_#t~ret1442#1.base, main_#t~ret1442#1.offset;havoc main_#t~ret1442#1.base, main_#t~ret1442#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~91#1.base, main_~tmp~91#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,808 INFO L272 TraceCheckUtils]: 18: Hoare triple {3134#false} call main_#t~ret1443#1.base, main_#t~ret1443#1.offset := ldv_init_zalloc(1); {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:14:01,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,808 INFO L272 TraceCheckUtils]: 20: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,809 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,810 INFO L272 TraceCheckUtils]: 25: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,811 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,811 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3134#false} {3134#false} #9227#return; {3134#false} is VALID [2022-02-20 22:14:01,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {3134#false} main_~tmp___0~59#1.base, main_~tmp___0~59#1.offset := main_#t~ret1443#1.base, main_#t~ret1443#1.offset;havoc main_#t~ret1443#1.base, main_#t~ret1443#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___0~59#1.base, main_~tmp___0~59#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,811 INFO L272 TraceCheckUtils]: 34: Hoare triple {3134#false} call main_#t~ret1444#1.base, main_#t~ret1444#1.offset := ldv_init_zalloc(1); {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:14:01,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,813 INFO L272 TraceCheckUtils]: 36: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,817 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,817 INFO L272 TraceCheckUtils]: 41: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,819 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,819 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3134#false} {3134#false} #9229#return; {3134#false} is VALID [2022-02-20 22:14:01,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {3134#false} main_~tmp___1~43#1.base, main_~tmp___1~43#1.offset := main_#t~ret1444#1.base, main_#t~ret1444#1.offset;havoc main_#t~ret1444#1.base, main_#t~ret1444#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~43#1.base, main_~tmp___1~43#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,819 INFO L272 TraceCheckUtils]: 50: Hoare triple {3134#false} call main_#t~ret1445#1.base, main_#t~ret1445#1.offset := ldv_init_zalloc(72); {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:14:01,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,820 INFO L272 TraceCheckUtils]: 52: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,821 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,821 INFO L272 TraceCheckUtils]: 57: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,822 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,822 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3134#false} {3134#false} #9231#return; {3134#false} is VALID [2022-02-20 22:14:01,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {3134#false} main_~tmp___2~31#1.base, main_~tmp___2~31#1.offset := main_#t~ret1445#1.base, main_#t~ret1445#1.offset;havoc main_#t~ret1445#1.base, main_#t~ret1445#1.offset;main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset := main_~tmp___2~31#1.base, main_~tmp___2~31#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,823 INFO L272 TraceCheckUtils]: 66: Hoare triple {3134#false} call main_#t~ret1446#1.base, main_#t~ret1446#1.offset := ldv_init_zalloc(1); {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:14:01,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,824 INFO L272 TraceCheckUtils]: 68: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,824 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,825 INFO L272 TraceCheckUtils]: 73: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,825 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,826 INFO L290 TraceCheckUtils]: 79: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,826 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {3134#false} {3134#false} #9233#return; {3134#false} is VALID [2022-02-20 22:14:01,826 INFO L290 TraceCheckUtils]: 81: Hoare triple {3134#false} main_~tmp___3~24#1.base, main_~tmp___3~24#1.offset := main_#t~ret1446#1.base, main_#t~ret1446#1.offset;havoc main_#t~ret1446#1.base, main_#t~ret1446#1.offset;main_~ldvarg15~0#1.base, main_~ldvarg15~0#1.offset := main_~tmp___3~24#1.base, main_~tmp___3~24#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,826 INFO L272 TraceCheckUtils]: 82: Hoare triple {3134#false} call main_#t~ret1447#1.base, main_#t~ret1447#1.offset := ldv_init_zalloc(1); {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:14:01,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {3327#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~10.base, ~tmp~10.offset;call #t~malloc78.base, #t~malloc78.offset := #Ultimate.allocOnHeap(~size); {3133#true} is VALID [2022-02-20 22:14:01,827 INFO L272 TraceCheckUtils]: 84: Hoare triple {3133#true} call #Ultimate.meminit(#t~malloc78.base, #t~malloc78.offset, 1, ~size, ~size); {3335#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:14:01,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {3335#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3133#true} is VALID [2022-02-20 22:14:01,828 INFO L290 TraceCheckUtils]: 86: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,828 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {3133#true} {3133#true} #8511#return; {3133#true} is VALID [2022-02-20 22:14:01,830 INFO L290 TraceCheckUtils]: 88: Hoare triple {3133#true} ~tmp~10.base, ~tmp~10.offset := #t~malloc78.base, #t~malloc78.offset;~p~2.base, ~p~2.offset := ~tmp~10.base, ~tmp~10.offset; {3133#true} is VALID [2022-02-20 22:14:01,831 INFO L272 TraceCheckUtils]: 89: Hoare triple {3133#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {3133#true} is VALID [2022-02-20 22:14:01,832 INFO L290 TraceCheckUtils]: 90: Hoare triple {3133#true} ~cond := #in~cond; {3133#true} is VALID [2022-02-20 22:14:01,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {3133#true} assume 0 == ~cond;assume false; {3134#false} is VALID [2022-02-20 22:14:01,834 INFO L290 TraceCheckUtils]: 92: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,834 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {3134#false} {3133#true} #8513#return; {3134#false} is VALID [2022-02-20 22:14:01,834 INFO L290 TraceCheckUtils]: 94: Hoare triple {3134#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {3134#false} is VALID [2022-02-20 22:14:01,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {3134#false} assume true; {3134#false} is VALID [2022-02-20 22:14:01,835 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {3134#false} {3134#false} #9235#return; {3134#false} is VALID [2022-02-20 22:14:01,835 INFO L290 TraceCheckUtils]: 97: Hoare triple {3134#false} main_~tmp___4~16#1.base, main_~tmp___4~16#1.offset := main_#t~ret1447#1.base, main_#t~ret1447#1.offset;havoc main_#t~ret1447#1.base, main_#t~ret1447#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___4~16#1.base, main_~tmp___4~16#1.offset;assume { :begin_inline_ldv_initialize } true; {3134#false} is VALID [2022-02-20 22:14:01,835 INFO L290 TraceCheckUtils]: 98: Hoare triple {3134#false} assume { :end_inline_ldv_initialize } true; {3134#false} is VALID [2022-02-20 22:14:01,838 INFO L272 TraceCheckUtils]: 99: Hoare triple {3134#false} call main_#t~ret1448#1.base, main_#t~ret1448#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 2); {3371#(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:14:01,839 INFO L290 TraceCheckUtils]: 100: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,843 INFO L272 TraceCheckUtils]: 101: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,843 INFO L290 TraceCheckUtils]: 102: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,844 INFO L290 TraceCheckUtils]: 103: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,844 INFO L290 TraceCheckUtils]: 104: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,844 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,844 INFO L290 TraceCheckUtils]: 107: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,844 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {3133#true} {3134#false} #9237#return; {3134#false} is VALID [2022-02-20 22:14:01,844 INFO L290 TraceCheckUtils]: 109: Hoare triple {3134#false} havoc main_#t~ret1448#1.base, main_#t~ret1448#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,845 INFO L272 TraceCheckUtils]: 110: Hoare triple {3134#false} call main_#t~ret1449#1.base, main_#t~ret1449#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 2); {3371#(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:14:01,845 INFO L290 TraceCheckUtils]: 111: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L272 TraceCheckUtils]: 112: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,846 INFO L290 TraceCheckUtils]: 113: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L290 TraceCheckUtils]: 114: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L290 TraceCheckUtils]: 115: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L290 TraceCheckUtils]: 117: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L290 TraceCheckUtils]: 118: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,846 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {3133#true} {3134#false} #9239#return; {3134#false} is VALID [2022-02-20 22:14:01,847 INFO L290 TraceCheckUtils]: 120: Hoare triple {3134#false} havoc main_#t~ret1449#1.base, main_#t~ret1449#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,847 INFO L272 TraceCheckUtils]: 121: Hoare triple {3134#false} call main_#t~ret1450#1.base, main_#t~ret1450#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {3371#(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:14:01,847 INFO L290 TraceCheckUtils]: 122: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L272 TraceCheckUtils]: 123: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,848 INFO L290 TraceCheckUtils]: 124: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L290 TraceCheckUtils]: 125: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L290 TraceCheckUtils]: 126: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L290 TraceCheckUtils]: 128: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L290 TraceCheckUtils]: 129: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,848 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {3133#true} {3134#false} #9241#return; {3134#false} is VALID [2022-02-20 22:14:01,849 INFO L290 TraceCheckUtils]: 131: Hoare triple {3134#false} havoc main_#t~ret1450#1.base, main_#t~ret1450#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,849 INFO L272 TraceCheckUtils]: 132: Hoare triple {3134#false} call main_#t~ret1451#1.base, main_#t~ret1451#1.offset := ldv_memset(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4); {3371#(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:14:01,849 INFO L290 TraceCheckUtils]: 133: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,850 INFO L272 TraceCheckUtils]: 134: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,850 INFO L290 TraceCheckUtils]: 135: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,850 INFO L290 TraceCheckUtils]: 136: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,850 INFO L290 TraceCheckUtils]: 137: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,850 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,850 INFO L290 TraceCheckUtils]: 139: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,850 INFO L290 TraceCheckUtils]: 140: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,851 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {3133#true} {3134#false} #9243#return; {3134#false} is VALID [2022-02-20 22:14:01,851 INFO L290 TraceCheckUtils]: 142: Hoare triple {3134#false} havoc main_#t~ret1451#1.base, main_#t~ret1451#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,851 INFO L272 TraceCheckUtils]: 143: Hoare triple {3134#false} call main_#t~ret1452#1.base, main_#t~ret1452#1.offset := ldv_memset(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 2); {3371#(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:14:01,851 INFO L290 TraceCheckUtils]: 144: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,852 INFO L272 TraceCheckUtils]: 145: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,852 INFO L290 TraceCheckUtils]: 146: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,852 INFO L290 TraceCheckUtils]: 147: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,852 INFO L290 TraceCheckUtils]: 148: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,852 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,852 INFO L290 TraceCheckUtils]: 150: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,853 INFO L290 TraceCheckUtils]: 151: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,853 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {3133#true} {3134#false} #9245#return; {3134#false} is VALID [2022-02-20 22:14:01,854 INFO L290 TraceCheckUtils]: 153: Hoare triple {3134#false} havoc main_#t~ret1452#1.base, main_#t~ret1452#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,854 INFO L272 TraceCheckUtils]: 154: Hoare triple {3134#false} call main_#t~ret1453#1.base, main_#t~ret1453#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 2); {3371#(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:14:01,854 INFO L290 TraceCheckUtils]: 155: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,855 INFO L272 TraceCheckUtils]: 156: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,855 INFO L290 TraceCheckUtils]: 157: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,855 INFO L290 TraceCheckUtils]: 158: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,855 INFO L290 TraceCheckUtils]: 159: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,855 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,855 INFO L290 TraceCheckUtils]: 161: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,855 INFO L290 TraceCheckUtils]: 162: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,856 INFO L284 TraceCheckUtils]: 163: Hoare quadruple {3133#true} {3134#false} #9247#return; {3134#false} is VALID [2022-02-20 22:14:01,856 INFO L290 TraceCheckUtils]: 164: Hoare triple {3134#false} havoc main_#t~ret1453#1.base, main_#t~ret1453#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,856 INFO L272 TraceCheckUtils]: 165: Hoare triple {3134#false} call main_#t~ret1454#1.base, main_#t~ret1454#1.offset := ldv_memset(main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset, 0, 2); {3371#(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:14:01,856 INFO L290 TraceCheckUtils]: 166: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,857 INFO L272 TraceCheckUtils]: 167: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,857 INFO L290 TraceCheckUtils]: 168: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,857 INFO L290 TraceCheckUtils]: 169: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,857 INFO L290 TraceCheckUtils]: 170: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,857 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,857 INFO L290 TraceCheckUtils]: 172: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,858 INFO L290 TraceCheckUtils]: 173: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,858 INFO L284 TraceCheckUtils]: 174: Hoare quadruple {3133#true} {3134#false} #9249#return; {3134#false} is VALID [2022-02-20 22:14:01,858 INFO L290 TraceCheckUtils]: 175: Hoare triple {3134#false} havoc main_#t~ret1454#1.base, main_#t~ret1454#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,858 INFO L272 TraceCheckUtils]: 176: Hoare triple {3134#false} call main_#t~ret1455#1.base, main_#t~ret1455#1.offset := ldv_memset(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset, 0, 2); {3371#(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:14:01,858 INFO L290 TraceCheckUtils]: 177: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,859 INFO L272 TraceCheckUtils]: 178: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,859 INFO L290 TraceCheckUtils]: 179: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,859 INFO L290 TraceCheckUtils]: 180: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,859 INFO L290 TraceCheckUtils]: 181: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,859 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,859 INFO L290 TraceCheckUtils]: 183: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,860 INFO L290 TraceCheckUtils]: 184: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,860 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {3133#true} {3134#false} #9251#return; {3134#false} is VALID [2022-02-20 22:14:01,860 INFO L290 TraceCheckUtils]: 186: Hoare triple {3134#false} havoc main_#t~ret1455#1.base, main_#t~ret1455#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,860 INFO L272 TraceCheckUtils]: 187: Hoare triple {3134#false} call main_#t~ret1456#1.base, main_#t~ret1456#1.offset := ldv_memset(main_~#ldvarg17~0#1.base, main_~#ldvarg17~0#1.offset, 0, 4); {3371#(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:14:01,860 INFO L290 TraceCheckUtils]: 188: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,861 INFO L272 TraceCheckUtils]: 189: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,861 INFO L290 TraceCheckUtils]: 190: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,861 INFO L290 TraceCheckUtils]: 191: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,861 INFO L290 TraceCheckUtils]: 192: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,861 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,862 INFO L290 TraceCheckUtils]: 194: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,862 INFO L290 TraceCheckUtils]: 195: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,862 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {3133#true} {3134#false} #9253#return; {3134#false} is VALID [2022-02-20 22:14:01,862 INFO L290 TraceCheckUtils]: 197: Hoare triple {3134#false} havoc main_#t~ret1456#1.base, main_#t~ret1456#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,862 INFO L272 TraceCheckUtils]: 198: Hoare triple {3134#false} call main_#t~ret1457#1.base, main_#t~ret1457#1.offset := ldv_memset(main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset, 0, 4); {3371#(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:14:01,862 INFO L290 TraceCheckUtils]: 199: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,863 INFO L272 TraceCheckUtils]: 200: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,863 INFO L290 TraceCheckUtils]: 201: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,863 INFO L290 TraceCheckUtils]: 202: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,863 INFO L290 TraceCheckUtils]: 203: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,863 INFO L284 TraceCheckUtils]: 204: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,864 INFO L290 TraceCheckUtils]: 205: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,864 INFO L290 TraceCheckUtils]: 206: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,864 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {3133#true} {3134#false} #9255#return; {3134#false} is VALID [2022-02-20 22:14:01,864 INFO L290 TraceCheckUtils]: 208: Hoare triple {3134#false} havoc main_#t~ret1457#1.base, main_#t~ret1457#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,864 INFO L272 TraceCheckUtils]: 209: Hoare triple {3134#false} call main_#t~ret1458#1.base, main_#t~ret1458#1.offset := ldv_memset(main_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset, 0, 2); {3371#(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:14:01,864 INFO L290 TraceCheckUtils]: 210: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,865 INFO L272 TraceCheckUtils]: 211: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,865 INFO L290 TraceCheckUtils]: 212: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,865 INFO L290 TraceCheckUtils]: 213: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,865 INFO L290 TraceCheckUtils]: 214: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,866 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,866 INFO L290 TraceCheckUtils]: 216: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,867 INFO L290 TraceCheckUtils]: 217: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,867 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {3133#true} {3134#false} #9257#return; {3134#false} is VALID [2022-02-20 22:14:01,867 INFO L290 TraceCheckUtils]: 219: Hoare triple {3134#false} havoc main_#t~ret1458#1.base, main_#t~ret1458#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,867 INFO L272 TraceCheckUtils]: 220: Hoare triple {3134#false} call main_#t~ret1459#1.base, main_#t~ret1459#1.offset := ldv_memset(main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset, 0, 2); {3371#(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:14:01,868 INFO L290 TraceCheckUtils]: 221: Hoare triple {3371#(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~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,869 INFO L272 TraceCheckUtils]: 222: Hoare triple {3133#true} call #t~memset~res79.base, #t~memset~res79.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {3371#(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:14:01,869 INFO L290 TraceCheckUtils]: 223: Hoare triple {3371#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1613 := 0; {3133#true} is VALID [2022-02-20 22:14:01,869 INFO L290 TraceCheckUtils]: 224: Hoare triple {3133#true} assume !(#t~loopctr1613 % 18446744073709551616 < #amount % 18446744073709551616); {3133#true} is VALID [2022-02-20 22:14:01,869 INFO L290 TraceCheckUtils]: 225: Hoare triple {3133#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3133#true} is VALID [2022-02-20 22:14:01,869 INFO L284 TraceCheckUtils]: 226: Hoare quadruple {3133#true} {3133#true} #8573#return; {3133#true} is VALID [2022-02-20 22:14:01,869 INFO L290 TraceCheckUtils]: 227: Hoare triple {3133#true} ~tmp~11.base, ~tmp~11.offset := ~s.base, ~s.offset;havoc #t~memset~res79.base, #t~memset~res79.offset;#res.base, #res.offset := ~tmp~11.base, ~tmp~11.offset; {3133#true} is VALID [2022-02-20 22:14:01,870 INFO L290 TraceCheckUtils]: 228: Hoare triple {3133#true} assume true; {3133#true} is VALID [2022-02-20 22:14:01,870 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {3133#true} {3134#false} #9259#return; {3134#false} is VALID [2022-02-20 22:14:01,870 INFO L290 TraceCheckUtils]: 230: Hoare triple {3134#false} havoc main_#t~ret1459#1.base, main_#t~ret1459#1.offset;~ldv_state_variable_4~0 := 0;assume { :begin_inline_timer_init_1 } true;~ldv_timer_1_0~0 := 0;~ldv_timer_1_1~0 := 0;~ldv_timer_1_2~0 := 0;~ldv_timer_1_3~0 := 0; {3134#false} is VALID [2022-02-20 22:14:01,870 INFO L290 TraceCheckUtils]: 231: Hoare triple {3134#false} assume { :end_inline_timer_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 232: Hoare triple {3134#false} assume -2147483648 <= main_#t~nondet1460#1 && main_#t~nondet1460#1 <= 2147483647;main_~tmp___5~13#1 := main_#t~nondet1460#1;havoc main_#t~nondet1460#1;main_#t~switch1461#1 := 0 == main_~tmp___5~13#1; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 233: Hoare triple {3134#false} assume !main_#t~switch1461#1;main_#t~switch1461#1 := main_#t~switch1461#1 || 1 == main_~tmp___5~13#1; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 234: Hoare triple {3134#false} assume !main_#t~switch1461#1;main_#t~switch1461#1 := main_#t~switch1461#1 || 2 == main_~tmp___5~13#1; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 235: Hoare triple {3134#false} assume main_#t~switch1461#1; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 236: Hoare triple {3134#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet1510#1 && main_#t~nondet1510#1 <= 2147483647;main_~tmp___7~9#1 := main_#t~nondet1510#1;havoc main_#t~nondet1510#1;main_#t~switch1511#1 := 0 == main_~tmp___7~9#1; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 237: Hoare triple {3134#false} assume main_#t~switch1511#1; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 238: Hoare triple {3134#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_oxu_driver_exit } true;assume { :begin_inline_ldv_platform_driver_unregister_12 } true;ldv_platform_driver_unregister_12_#in~ldv_func_arg1#1.base, ldv_platform_driver_unregister_12_#in~ldv_func_arg1#1.offset := ~#oxu_driver~0.base, ~#oxu_driver~0.offset;havoc ldv_platform_driver_unregister_12_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_12_~ldv_func_arg1#1.offset;ldv_platform_driver_unregister_12_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_12_~ldv_func_arg1#1.offset := ldv_platform_driver_unregister_12_#in~ldv_func_arg1#1.base, ldv_platform_driver_unregister_12_#in~ldv_func_arg1#1.offset;assume { :begin_inline_platform_driver_unregister } true;platform_driver_unregister_#in~arg0#1.base, platform_driver_unregister_#in~arg0#1.offset := ldv_platform_driver_unregister_12_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_12_~ldv_func_arg1#1.offset;havoc platform_driver_unregister_~arg0#1.base, platform_driver_unregister_~arg0#1.offset;platform_driver_unregister_~arg0#1.base, platform_driver_unregister_~arg0#1.offset := platform_driver_unregister_#in~arg0#1.base, platform_driver_unregister_#in~arg0#1.offset; {3134#false} is VALID [2022-02-20 22:14:01,871 INFO L290 TraceCheckUtils]: 239: Hoare triple {3134#false} assume { :end_inline_platform_driver_unregister } true;~ldv_state_variable_2~0 := 0; {3134#false} is VALID [2022-02-20 22:14:01,872 INFO L290 TraceCheckUtils]: 240: Hoare triple {3134#false} assume { :end_inline_ldv_platform_driver_unregister_12 } true; {3134#false} is VALID [2022-02-20 22:14:01,872 INFO L290 TraceCheckUtils]: 241: Hoare triple {3134#false} assume { :end_inline_oxu_driver_exit } true;~ldv_state_variable_0~0 := 2; {3134#false} is VALID [2022-02-20 22:14:01,872 INFO L290 TraceCheckUtils]: 242: Hoare triple {3134#false} assume { :begin_inline_ldv_check_final_state } true; {3134#false} is VALID [2022-02-20 22:14:01,872 INFO L290 TraceCheckUtils]: 243: Hoare triple {3134#false} assume 1 != ~ldv_module_refcounter~0; {3134#false} is VALID [2022-02-20 22:14:01,872 INFO L272 TraceCheckUtils]: 244: Hoare triple {3134#false} call ldv_error(); {3134#false} is VALID [2022-02-20 22:14:01,872 INFO L290 TraceCheckUtils]: 245: Hoare triple {3134#false} assume !false; {3134#false} is VALID [2022-02-20 22:14:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-02-20 22:14:01,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:14:01,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737191264] [2022-02-20 22:14:01,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737191264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:14:01,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:14:01,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:14:01,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80649670] [2022-02-20 22:14:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:14:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 246 [2022-02-20 22:14:01,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:14:01,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 22:14:02,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:14:02,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:14:02,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:14:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:14:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:14:02,037 INFO L87 Difference]: Start difference. First operand has 3130 states, 2296 states have (on average 1.473432055749129) internal successors, (3383), 2367 states have internal predecessors, (3383), 715 states have call successors, (715), 118 states have call predecessors, (715), 117 states have return successors, (709), 693 states have call predecessors, (709), 709 states have call successors, (709) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 22:14:20,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:14:26,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:14:28,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:14:30,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:14:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:14:34,616 INFO L93 Difference]: Finished difference Result 6677 states and 10567 transitions. [2022-02-20 22:14:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:14:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 246 [2022-02-20 22:14:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:14:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 22:14:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10567 transitions. [2022-02-20 22:14:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 22:14:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10567 transitions. [2022-02-20 22:14:35,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 10567 transitions. [2022-02-20 22:14:44,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10567 edges. 10567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:14:45,239 INFO L225 Difference]: With dead ends: 6677 [2022-02-20 22:14:45,240 INFO L226 Difference]: Without dead ends: 3528 [2022-02-20 22:14:45,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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:14:45,267 INFO L933 BasicCegarLoop]: 4264 mSDtfsCounter, 2556 mSDsluCounter, 4019 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 1961 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 8283 SdHoareTripleChecker+Invalid, 4573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1961 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-02-20 22:14:45,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2636 Valid, 8283 Invalid, 4573 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1961 Valid, 2608 Invalid, 4 Unknown, 0 Unchecked, 15.1s Time] [2022-02-20 22:14:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2022-02-20 22:14:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3106. [2022-02-20 22:14:45,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:14:45,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3528 states. Second operand has 3106 states, 2282 states have (on average 1.3720420683610868) internal successors, (3131), 2345 states have internal predecessors, (3131), 707 states have call successors, (707), 117 states have call predecessors, (707), 116 states have return successors, (706), 690 states have call predecessors, (706), 706 states have call successors, (706) [2022-02-20 22:14:45,475 INFO L74 IsIncluded]: Start isIncluded. First operand 3528 states. Second operand has 3106 states, 2282 states have (on average 1.3720420683610868) internal successors, (3131), 2345 states have internal predecessors, (3131), 707 states have call successors, (707), 117 states have call predecessors, (707), 116 states have return successors, (706), 690 states have call predecessors, (706), 706 states have call successors, (706) [2022-02-20 22:14:45,481 INFO L87 Difference]: Start difference. First operand 3528 states. Second operand has 3106 states, 2282 states have (on average 1.3720420683610868) internal successors, (3131), 2345 states have internal predecessors, (3131), 707 states have call successors, (707), 117 states have call predecessors, (707), 116 states have return successors, (706), 690 states have call predecessors, (706), 706 states have call successors, (706) [2022-02-20 22:14:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:14:45,932 INFO L93 Difference]: Finished difference Result 3528 states and 5275 transitions. [2022-02-20 22:14:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5275 transitions. [2022-02-20 22:14:45,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:14:45,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:14:45,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 3106 states, 2282 states have (on average 1.3720420683610868) internal successors, (3131), 2345 states have internal predecessors, (3131), 707 states have call successors, (707), 117 states have call predecessors, (707), 116 states have return successors, (706), 690 states have call predecessors, (706), 706 states have call successors, (706) Second operand 3528 states. [2022-02-20 22:14:45,980 INFO L87 Difference]: Start difference. First operand has 3106 states, 2282 states have (on average 1.3720420683610868) internal successors, (3131), 2345 states have internal predecessors, (3131), 707 states have call successors, (707), 117 states have call predecessors, (707), 116 states have return successors, (706), 690 states have call predecessors, (706), 706 states have call successors, (706) Second operand 3528 states. [2022-02-20 22:14:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:14:46,403 INFO L93 Difference]: Finished difference Result 3528 states and 5275 transitions. [2022-02-20 22:14:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5275 transitions. [2022-02-20 22:14:46,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:14:46,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:14:46,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:14:46,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:14:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2282 states have (on average 1.3720420683610868) internal successors, (3131), 2345 states have internal predecessors, (3131), 707 states have call successors, (707), 117 states have call predecessors, (707), 116 states have return successors, (706), 690 states have call predecessors, (706), 706 states have call successors, (706)