./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.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 99f9870c0a11847528222b5446256dd4069d375e1dee3e428847b909838b4c1b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:50:03,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:50:03,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:50:03,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:50:03,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:50:03,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:50:03,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:50:03,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:50:03,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:50:03,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:50:03,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:50:03,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:50:03,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:50:03,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:50:03,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:50:03,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:50:03,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:50:03,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:50:03,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:50:03,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:50:03,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:50:03,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:50:03,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:50:03,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:50:03,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:50:03,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:50:03,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:50:03,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:50:03,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:50:03,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:50:03,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:50:03,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:50:03,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:50:03,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:50:03,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:50:03,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:50:03,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:50:03,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:50:03,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:50:03,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:50:03,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:50:03,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:50:03,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:50:03,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:50:03,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:50:03,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:50:03,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:50:03,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:50:03,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:50:03,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:50:03,920 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:50:03,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:50:03,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:50:03,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:50:03,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:50:03,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:50:03,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:50:03,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:50:03,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:50:03,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:50:03,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:50:03,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:50:03,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:50:03,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:50:03,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:50:03,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:50:03,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:50:03,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:50:03,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:50:03,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:50:03,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:50:03,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:50:03,925 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 -> 99f9870c0a11847528222b5446256dd4069d375e1dee3e428847b909838b4c1b [2022-02-20 21:50:04,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:50:04,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:50:04,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:50:04,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:50:04,142 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:50:04,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2022-02-20 21:50:04,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3aa864ac/d546e551920a4ee2b87e56fc1661ecaa/FLAG3135d369c [2022-02-20 21:50:04,824 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:50:04,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2022-02-20 21:50:04,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3aa864ac/d546e551920a4ee2b87e56fc1661ecaa/FLAG3135d369c [2022-02-20 21:50:05,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3aa864ac/d546e551920a4ee2b87e56fc1661ecaa [2022-02-20 21:50:05,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:50:05,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:50:05,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:50:05,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:50:05,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:50:05,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:50:05" (1/1) ... [2022-02-20 21:50:05,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25504e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:05, skipping insertion in model container [2022-02-20 21:50:05,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:50:05" (1/1) ... [2022-02-20 21:50:05,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:50:05,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:50:06,076 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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i[164521,164534] [2022-02-20 21:50:06,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:50:06,427 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:50:06,553 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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i[164521,164534] [2022-02-20 21:50:06,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:50:06,817 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:50:06,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06 WrapperNode [2022-02-20 21:50:06,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:50:06,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:50:06,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:50:06,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:50:06,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:06,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,010 INFO L137 Inliner]: procedures = 157, calls = 675, calls flagged for inlining = 60, calls inlined = 51, statements flattened = 1529 [2022-02-20 21:50:07,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:50:07,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:50:07,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:50:07,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:50:07,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:50:07,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:50:07,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:50:07,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:50:07,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (1/1) ... [2022-02-20 21:50:07,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:50:07,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:50:07,204 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 21:50:07,238 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 21:50:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_schedule_event [2022-02-20 21:50:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_schedule_event [2022-02-20 21:50:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_freebcshw [2022-02-20 21:50:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_freebcshw [2022-02-20 21:50:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_set_modem_ctrl [2022-02-20 21:50:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_set_modem_ctrl [2022-02-20 21:50:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:50:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2022-02-20 21:50:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2022-02-20 21:50:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_reinitbcshw [2022-02-20 21:50:07,255 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_reinitbcshw [2022-02-20 21:50:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:50:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:50:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:50:07,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:50:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:50:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_m10x_send_skb [2022-02-20 21:50:07,284 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_m10x_send_skb [2022-02-20 21:50:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_brkchars [2022-02-20 21:50:07,284 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_brkchars [2022-02-20 21:50:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-02-20 21:50:07,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-02-20 21:50:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_add_event [2022-02-20 21:50:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_add_event [2022-02-20 21:50:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:50:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:50:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 21:50:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 21:50:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:50:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:50:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-02-20 21:50:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-02-20 21:50:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_close_bchannel [2022-02-20 21:50:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_close_bchannel [2022-02-20 21:50:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_resume [2022-02-20 21:50:07,287 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_resume [2022-02-20 21:50:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-02-20 21:50:07,287 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-02-20 21:50:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_baud_rate [2022-02-20 21:50:07,287 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_baud_rate [2022-02-20 21:50:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_initcshw [2022-02-20 21:50:07,288 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_initcshw [2022-02-20 21:50:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:50:07,288 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:50:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:50:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:50:07,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:50:07,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:50:07,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:50:07,289 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_initbcshw [2022-02-20 21:50:07,289 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_initbcshw [2022-02-20 21:50:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_dbg_buffer [2022-02-20 21:50:07,290 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_dbg_buffer [2022-02-20 21:50:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:50:07,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:50:07,290 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_set_line_ctrl [2022-02-20 21:50:07,291 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_set_line_ctrl [2022-02-20 21:50:07,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:50:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-02-20 21:50:07,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-02-20 21:50:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_kill [2022-02-20 21:50:07,293 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_kill [2022-02-20 21:50:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:50:07,293 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:50:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_freecs [2022-02-20 21:50:07,293 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_freecs [2022-02-20 21:50:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:50:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_write_room [2022-02-20 21:50:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_write_room [2022-02-20 21:50:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_suspend [2022-02-20 21:50:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_suspend [2022-02-20 21:50:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 21:50:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 21:50:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:50:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:50:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2022-02-20 21:50:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2022-02-20 21:50:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:50:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:50:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-02-20 21:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-02-20 21:50:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:50:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-02-20 21:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-02-20 21:50:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-02-20 21:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-02-20 21:50:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_freedriver [2022-02-20 21:50:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_freedriver [2022-02-20 21:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_disconnect [2022-02-20 21:50:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_disconnect [2022-02-20 21:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_chars_in_buffer [2022-02-20 21:50:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_chars_in_buffer [2022-02-20 21:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:50:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:50:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:50:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_17 [2022-02-20 21:50:07,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_17 [2022-02-20 21:50:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_m10x_input [2022-02-20 21:50:07,299 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_m10x_input [2022-02-20 21:50:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:50:07,300 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:50:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 21:50:07,300 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 21:50:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure set_value [2022-02-20 21:50:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure set_value [2022-02-20 21:50:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure tiocm_to_gigaset [2022-02-20 21:50:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure tiocm_to_gigaset [2022-02-20 21:50:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-02-20 21:50:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-02-20 21:50:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:50:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:50:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:50:07,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:50:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_init_bchannel [2022-02-20 21:50:07,302 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_init_bchannel [2022-02-20 21:50:07,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:50:07,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:50:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_read_int_callback [2022-02-20 21:50:07,304 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_read_int_callback [2022-02-20 21:50:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_freecshw [2022-02-20 21:50:07,306 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_freecshw [2022-02-20 21:50:07,703 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:50:07,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:50:07,939 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:50:08,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-02-20 21:50:10,103 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:50:10,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:50:10,117 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:50:10,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:50:10 BoogieIcfgContainer [2022-02-20 21:50:10,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:50:10,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:50:10,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:50:10,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:50:10,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:50:05" (1/3) ... [2022-02-20 21:50:10,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f6a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:50:10, skipping insertion in model container [2022-02-20 21:50:10,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:50:06" (2/3) ... [2022-02-20 21:50:10,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f6a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:50:10, skipping insertion in model container [2022-02-20 21:50:10,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:50:10" (3/3) ... [2022-02-20 21:50:10,125 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2022-02-20 21:50:10,129 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:50:10,129 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:50:10,168 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:50:10,174 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 21:50:10,174 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:50:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 739 states, 519 states have (on average 1.3737957610789981) internal successors, (713), 543 states have internal predecessors, (713), 167 states have call successors, (167), 53 states have call predecessors, (167), 51 states have return successors, (161), 156 states have call predecessors, (161), 161 states have call successors, (161) [2022-02-20 21:50:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 21:50:10,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:50:10,225 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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 21:50:10,225 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:50:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:50:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash 127184033, now seen corresponding path program 1 times [2022-02-20 21:50:10,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:50:10,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239500666] [2022-02-20 21:50:10,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:50:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:50:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:50:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #1773#return; {742#true} is VALID [2022-02-20 21:50:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:50:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #1775#return; {742#true} is VALID [2022-02-20 21:50:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:50:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #1777#return; {742#true} is VALID [2022-02-20 21:50:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:50:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #1779#return; {742#true} is VALID [2022-02-20 21:50:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:50:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #1781#return; {742#true} is VALID [2022-02-20 21:50:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:50:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:10,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {742#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {742#true} is VALID [2022-02-20 21:50:10,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {742#true} {743#false} #1861#return; {743#false} is VALID [2022-02-20 21:50:10,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {742#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(90, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(35, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(28, 7);call #Ultimate.allocInit(26, 8);call #Ultimate.allocInit(59, 9);call #Ultimate.allocInit(43, 10);call #Ultimate.allocInit(26, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(42, 14);call #Ultimate.allocInit(40, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(46, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(26, 19);call #Ultimate.allocInit(23, 20);call #Ultimate.allocInit(26, 21);call #Ultimate.allocInit(42, 22);call #Ultimate.allocInit(48, 23);call #Ultimate.allocInit(26, 24);call #Ultimate.allocInit(32, 25);call #Ultimate.allocInit(26, 26);call #Ultimate.allocInit(27, 27);call #Ultimate.allocInit(26, 28);call #Ultimate.allocInit(28, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(32, 31);call #Ultimate.allocInit(28, 32);call #Ultimate.allocInit(47, 33);call #Ultimate.allocInit(38, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(13, 36);call #Ultimate.allocInit(9, 37);call #Ultimate.allocInit(29, 38);call #Ultimate.allocInit(26, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(33, 41);call #Ultimate.allocInit(37, 42);call #Ultimate.allocInit(47, 43);call #Ultimate.allocInit(14, 44);call #Ultimate.allocInit(56, 45);call #Ultimate.allocInit(46, 46);call #Ultimate.allocInit(33, 47);call #Ultimate.allocInit(38, 48);call #Ultimate.allocInit(26, 49);call #Ultimate.allocInit(14, 50);call #Ultimate.allocInit(12, 51);call #Ultimate.allocInit(35, 52);call #Ultimate.allocInit(32, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(26, 55);call #Ultimate.allocInit(33, 56);call #Ultimate.allocInit(35, 57);call #Ultimate.allocInit(32, 58);call #Ultimate.allocInit(38, 59);call #Ultimate.allocInit(31, 60);call #Ultimate.allocInit(12, 61);call #Ultimate.allocInit(6, 62);call write~init~int(116, 62, 0, 1);call write~init~int(116, 62, 1, 1);call write~init~int(121, 62, 2, 1);call write~init~int(71, 62, 3, 1);call write~init~int(85, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(47, 64);call #Ultimate.allocInit(54, 65);~LDV_IN_INTERRUPT~0 := 1;~gigaset_usb_driver_group1~0.base, ~gigaset_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ops_group1~0.base, ~ops_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ops_group0~0.base, ~ops_group0~0.offset := 0, 0;~startmode~0 := 1;~cidmode~0 := 1;~#gigaset_table~0.base, ~#gigaset_table~0.offset := 66, 0;call #Ultimate.allocInit(50, 66);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#gigaset_table~0.base);call write~unchecked~int(3, ~#gigaset_table~0.base, ~#gigaset_table~0.offset, 2);call write~unchecked~int(1665, ~#gigaset_table~0.base, 2 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(9, ~#gigaset_table~0.base, 4 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 6 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 8 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 10 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 11 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 12 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 13 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 14 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 15 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 16 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 17 + ~#gigaset_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~driver~0.base, ~driver~0.offset := 0, 0;~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset := 67, 0;call #Ultimate.allocInit(285, 67);call write~init~$Pointer$(3, 0, ~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_probe.base, #funAddr~gigaset_probe.offset, ~#gigaset_usb_driver~0.base, 8 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_disconnect.base, #funAddr~gigaset_disconnect.offset, ~#gigaset_usb_driver~0.base, 16 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 24 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_suspend.base, #funAddr~gigaset_suspend.offset, ~#gigaset_usb_driver~0.base, 32 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 40 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 48 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_pre_reset.base, #funAddr~gigaset_pre_reset.offset, ~#gigaset_usb_driver~0.base, 56 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 64 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(~#gigaset_table~0.base, ~#gigaset_table~0.offset, ~#gigaset_usb_driver~0.base, 72 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 80 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 84 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 88 + ~#gigaset_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 92 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 100 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 108 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 116 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 124 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 132 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 136 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 148 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 156 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 164 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 172 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 180 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 188 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 196 + ~#gigaset_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 197 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 205 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 213 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 221 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 229 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 237 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 245 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 253 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 261 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 269 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 277 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 281 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 282 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(1, ~#gigaset_usb_driver~0.base, 283 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 284 + ~#gigaset_usb_driver~0.offset, 1);~#ops~0.base, ~#ops~0.offset := 68, 0;call #Ultimate.allocInit(128, 68);call write~init~$Pointer$(#funAddr~gigaset_write_cmd.base, #funAddr~gigaset_write_cmd.offset, ~#ops~0.base, ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_write_room.base, #funAddr~gigaset_write_room.offset, ~#ops~0.base, 8 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_chars_in_buffer.base, #funAddr~gigaset_chars_in_buffer.offset, ~#ops~0.base, 16 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_brkchars.base, #funAddr~gigaset_brkchars.offset, ~#ops~0.base, 24 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_init_bchannel.base, #funAddr~gigaset_init_bchannel.offset, ~#ops~0.base, 32 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_close_bchannel.base, #funAddr~gigaset_close_bchannel.offset, ~#ops~0.base, 40 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initbcshw.base, #funAddr~gigaset_initbcshw.offset, ~#ops~0.base, 48 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freebcshw.base, #funAddr~gigaset_freebcshw.offset, ~#ops~0.base, 56 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_reinitbcshw.base, #funAddr~gigaset_reinitbcshw.offset, ~#ops~0.base, 64 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initcshw.base, #funAddr~gigaset_initcshw.offset, ~#ops~0.base, 72 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freecshw.base, #funAddr~gigaset_freecshw.offset, ~#ops~0.base, 80 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_modem_ctrl.base, #funAddr~gigaset_set_modem_ctrl.offset, ~#ops~0.base, 88 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_baud_rate.base, #funAddr~gigaset_baud_rate.offset, ~#ops~0.base, 96 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_line_ctrl.base, #funAddr~gigaset_set_line_ctrl.offset, ~#ops~0.base, 104 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_send_skb.base, #funAddr~gigaset_m10x_send_skb.offset, ~#ops~0.base, 112 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_input.base, #funAddr~gigaset_m10x_input.offset, ~#ops~0.base, 120 + ~#ops~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset, main_#t~ret407#1.base, main_#t~ret407#1.offset, main_#t~nondet408#1, main_#t~nondet409#1, main_#t~ret410#1.base, main_#t~ret410#1.offset, main_#t~nondet411#1, main_#t~nondet412#1, main_#t~ret413#1.base, main_#t~ret413#1.offset, main_#t~ret414#1.base, main_#t~ret414#1.offset, main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset, main_#t~nondet416#1, main_#t~switch417#1, main_#t~nondet418#1, main_#t~switch419#1, main_#t~ret420#1, main_#t~ret421#1, main_#t~ret422#1, main_#t~ret423#1, main_#t~ret424#1, main_#t~ret425#1, main_#t~ret426#1, main_#t~ret427#1, main_#t~ret428#1, main_#t~ret429#1, main_#t~ret430#1, main_#t~ret431#1, main_#t~ret432#1, main_#t~ret433#1, main_#t~ret434#1, main_#t~ret435#1, main_#t~ret436#1, main_#t~ret437#1, main_#t~ret438#1, main_#t~ret439#1, main_#t~ret440#1, main_#t~ret441#1, main_#t~ret442#1, main_#t~ret443#1, main_#t~ret444#1, main_#t~nondet445#1, main_#t~switch446#1, main_#t~ret447#1, main_#t~nondet448#1, main_#t~switch449#1, main_#t~ret450#1, main_#t~ret451#1, main_#t~mem452#1, main_#t~ret453#1, main_#t~ret454#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~ldvarg0~0#1, main_~tmp___1~7#1, main_~ldvarg5~0#1, main_~tmp___2~7#1, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset, main_~ldvarg1~0#1, main_~tmp___4~4#1, main_~ldvarg4~0#1, main_~tmp___5~2#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~tmp___10~0#1, main_~tmp___11~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~7#1;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~4#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~2#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~tmp___10~0#1;havoc main_~tmp___11~0#1; {742#true} is VALID [2022-02-20 21:50:10,746 INFO L272 TraceCheckUtils]: 2: Hoare triple {742#true} call main_#t~ret406#1.base, main_#t~ret406#1.offset := ldv_zalloc(8216); {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:10,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,747 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {742#true} {742#true} #1773#return; {742#true} is VALID [2022-02-20 21:50:10,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {742#true} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret406#1.base, main_#t~ret406#1.offset;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {742#true} is VALID [2022-02-20 21:50:10,748 INFO L272 TraceCheckUtils]: 8: Hoare triple {742#true} call main_#t~ret407#1.base, main_#t~ret407#1.offset := ldv_zalloc(240); {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:10,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,749 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {742#true} {742#true} #1775#return; {742#true} is VALID [2022-02-20 21:50:10,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {742#true} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret407#1.base, main_#t~ret407#1.offset;havoc main_#t~ret407#1.base, main_#t~ret407#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;main_~tmp___1~7#1 := main_#t~nondet408#1;havoc main_#t~nondet408#1;main_~ldvarg0~0#1 := main_~tmp___1~7#1;main_~tmp___2~7#1 := main_#t~nondet409#1;havoc main_#t~nondet409#1;main_~ldvarg5~0#1 := main_~tmp___2~7#1; {742#true} is VALID [2022-02-20 21:50:10,750 INFO L272 TraceCheckUtils]: 14: Hoare triple {742#true} call main_#t~ret410#1.base, main_#t~ret410#1.offset := ldv_zalloc(32); {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:10,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,750 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {742#true} {742#true} #1777#return; {742#true} is VALID [2022-02-20 21:50:10,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {742#true} main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset := main_#t~ret410#1.base, main_#t~ret410#1.offset;havoc main_#t~ret410#1.base, main_#t~ret410#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;main_~tmp___4~4#1 := main_#t~nondet411#1;havoc main_#t~nondet411#1;main_~ldvarg1~0#1 := main_~tmp___4~4#1;main_~tmp___5~2#1 := main_#t~nondet412#1;havoc main_#t~nondet412#1;main_~ldvarg4~0#1 := main_~tmp___5~2#1; {742#true} is VALID [2022-02-20 21:50:10,752 INFO L272 TraceCheckUtils]: 20: Hoare triple {742#true} call main_#t~ret413#1.base, main_#t~ret413#1.offset := ldv_zalloc(1); {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:10,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,752 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {742#true} {742#true} #1779#return; {742#true} is VALID [2022-02-20 21:50:10,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {742#true} main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset := main_#t~ret413#1.base, main_#t~ret413#1.offset;havoc main_#t~ret413#1.base, main_#t~ret413#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset; {742#true} is VALID [2022-02-20 21:50:10,753 INFO L272 TraceCheckUtils]: 26: Hoare triple {742#true} call main_#t~ret414#1.base, main_#t~ret414#1.offset := ldv_zalloc(32); {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:10,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {742#true} is VALID [2022-02-20 21:50:10,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {742#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {742#true} is VALID [2022-02-20 21:50:10,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,754 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {742#true} {742#true} #1781#return; {742#true} is VALID [2022-02-20 21:50:10,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {742#true} main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset := main_#t~ret414#1.base, main_#t~ret414#1.offset;havoc main_#t~ret414#1.base, main_#t~ret414#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;assume { :begin_inline_ldv_initialize } true; {742#true} is VALID [2022-02-20 21:50:10,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {742#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr496#1;#Ultimate.C_memset_#t~loopctr496#1 := 0; {742#true} is VALID [2022-02-20 21:50:10,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {742#true} assume !(#Ultimate.C_memset_#t~loopctr496#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {742#true} is VALID [2022-02-20 21:50:10,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {742#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {764#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:50:10,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {764#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet416#1 && main_#t~nondet416#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet416#1;havoc main_#t~nondet416#1;main_#t~switch417#1 := 0 == main_~tmp___8~0#1; {764#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:50:10,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {764#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch417#1;main_#t~switch417#1 := main_#t~switch417#1 || 1 == main_~tmp___8~0#1; {764#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:50:10,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {764#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch417#1; {764#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:50:10,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {764#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet445#1 && main_#t~nondet445#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet445#1;havoc main_#t~nondet445#1;main_#t~switch446#1 := 0 == main_~tmp___10~0#1; {764#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:50:10,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {764#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch446#1; {764#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:50:10,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {764#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_usb_gigaset_exit } true;havoc usb_gigaset_exit_#t~mem400#1.base, usb_gigaset_exit_#t~mem400#1.offset, usb_gigaset_exit_#t~ret401#1, usb_gigaset_exit_#t~mem402#1, usb_gigaset_exit_~i~0#1;havoc usb_gigaset_exit_~i~0#1;assume { :begin_inline_gigaset_blockdriver } true;gigaset_blockdriver_#in~arg0#1.base, gigaset_blockdriver_#in~arg0#1.offset := ~driver~0.base, ~driver~0.offset;havoc gigaset_blockdriver_~arg0#1.base, gigaset_blockdriver_~arg0#1.offset;gigaset_blockdriver_~arg0#1.base, gigaset_blockdriver_~arg0#1.offset := gigaset_blockdriver_#in~arg0#1.base, gigaset_blockdriver_#in~arg0#1.offset; {743#false} is VALID [2022-02-20 21:50:10,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {743#false} assume { :end_inline_gigaset_blockdriver } true;usb_gigaset_exit_~i~0#1 := 0; {743#false} is VALID [2022-02-20 21:50:10,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {743#false} call usb_gigaset_exit_#t~mem402#1 := read~int(~driver~0.base, 100 + ~driver~0.offset, 4); {743#false} is VALID [2022-02-20 21:50:10,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {743#false} assume !(usb_gigaset_exit_~i~0#1 % 4294967296 < usb_gigaset_exit_#t~mem402#1 % 4294967296);havoc usb_gigaset_exit_#t~mem402#1;assume { :begin_inline_ldv_usb_deregister_26 } true;ldv_usb_deregister_26_#in~arg#1.base, ldv_usb_deregister_26_#in~arg#1.offset := ~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset;havoc ldv_usb_deregister_26_~arg#1.base, ldv_usb_deregister_26_~arg#1.offset;ldv_usb_deregister_26_~arg#1.base, ldv_usb_deregister_26_~arg#1.offset := ldv_usb_deregister_26_#in~arg#1.base, ldv_usb_deregister_26_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_26_~arg#1.base, ldv_usb_deregister_26_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {743#false} is VALID [2022-02-20 21:50:10,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {743#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_2~0 := 0; {743#false} is VALID [2022-02-20 21:50:10,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {743#false} assume { :end_inline_ldv_usb_deregister_26 } true; {743#false} is VALID [2022-02-20 21:50:10,760 INFO L272 TraceCheckUtils]: 46: Hoare triple {743#false} call gigaset_freedriver(~driver~0.base, ~driver~0.offset); {742#true} is VALID [2022-02-20 21:50:10,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {742#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {742#true} is VALID [2022-02-20 21:50:10,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {742#true} assume true; {742#true} is VALID [2022-02-20 21:50:10,761 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {742#true} {743#false} #1861#return; {743#false} is VALID [2022-02-20 21:50:10,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {743#false} ~driver~0.base, ~driver~0.offset := 0, 0; {743#false} is VALID [2022-02-20 21:50:10,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {743#false} assume { :end_inline_usb_gigaset_exit } true;~ldv_state_variable_0~0 := 2; {743#false} is VALID [2022-02-20 21:50:10,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {743#false} assume { :begin_inline_ldv_check_final_state } true; {743#false} is VALID [2022-02-20 21:50:10,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {743#false} assume !(0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {743#false} is VALID [2022-02-20 21:50:10,762 INFO L272 TraceCheckUtils]: 54: Hoare triple {743#false} call ldv_error(); {743#false} is VALID [2022-02-20 21:50:10,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {743#false} assume !false; {743#false} is VALID [2022-02-20 21:50:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:50:10,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:50:10,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239500666] [2022-02-20 21:50:10,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239500666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:50:10,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:50:10,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:50:10,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363295396] [2022-02-20 21:50:10,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:50:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-02-20 21:50:10,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:50:10,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:50:10,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:10,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:50:10,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:50:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:50:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:50:10,865 INFO L87 Difference]: Start difference. First operand has 739 states, 519 states have (on average 1.3737957610789981) internal successors, (713), 543 states have internal predecessors, (713), 167 states have call successors, (167), 53 states have call predecessors, (167), 51 states have return successors, (161), 156 states have call predecessors, (161), 161 states have call successors, (161) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:50:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:18,040 INFO L93 Difference]: Finished difference Result 2258 states and 3253 transitions. [2022-02-20 21:50:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:50:18,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-02-20 21:50:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:50:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:50:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3253 transitions. [2022-02-20 21:50:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:50:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3253 transitions. [2022-02-20 21:50:18,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3253 transitions. [2022-02-20 21:50:20,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3253 edges. 3253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:21,101 INFO L225 Difference]: With dead ends: 2258 [2022-02-20 21:50:21,102 INFO L226 Difference]: Without dead ends: 1502 [2022-02-20 21:50:21,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:50:21,121 INFO L933 BasicCegarLoop]: 1066 mSDtfsCounter, 1423 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:50:21,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 1960 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 21:50:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-02-20 21:50:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1392. [2022-02-20 21:50:21,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:50:21,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1502 states. Second operand has 1392 states, 985 states have (on average 1.3563451776649746) internal successors, (1336), 1012 states have internal predecessors, (1336), 306 states have call successors, (306), 101 states have call predecessors, (306), 100 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) [2022-02-20 21:50:21,291 INFO L74 IsIncluded]: Start isIncluded. First operand 1502 states. Second operand has 1392 states, 985 states have (on average 1.3563451776649746) internal successors, (1336), 1012 states have internal predecessors, (1336), 306 states have call successors, (306), 101 states have call predecessors, (306), 100 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) [2022-02-20 21:50:21,295 INFO L87 Difference]: Start difference. First operand 1502 states. Second operand has 1392 states, 985 states have (on average 1.3563451776649746) internal successors, (1336), 1012 states have internal predecessors, (1336), 306 states have call successors, (306), 101 states have call predecessors, (306), 100 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) [2022-02-20 21:50:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:21,418 INFO L93 Difference]: Finished difference Result 1502 states and 2114 transitions. [2022-02-20 21:50:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2114 transitions. [2022-02-20 21:50:21,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:50:21,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:50:21,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 1392 states, 985 states have (on average 1.3563451776649746) internal successors, (1336), 1012 states have internal predecessors, (1336), 306 states have call successors, (306), 101 states have call predecessors, (306), 100 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) Second operand 1502 states. [2022-02-20 21:50:21,437 INFO L87 Difference]: Start difference. First operand has 1392 states, 985 states have (on average 1.3563451776649746) internal successors, (1336), 1012 states have internal predecessors, (1336), 306 states have call successors, (306), 101 states have call predecessors, (306), 100 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) Second operand 1502 states. [2022-02-20 21:50:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:21,551 INFO L93 Difference]: Finished difference Result 1502 states and 2114 transitions. [2022-02-20 21:50:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2114 transitions. [2022-02-20 21:50:21,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:50:21,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:50:21,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:50:21,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:50:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 985 states have (on average 1.3563451776649746) internal successors, (1336), 1012 states have internal predecessors, (1336), 306 states have call successors, (306), 101 states have call predecessors, (306), 100 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) [2022-02-20 21:50:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1943 transitions. [2022-02-20 21:50:21,688 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1943 transitions. Word has length 56 [2022-02-20 21:50:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:50:21,689 INFO L470 AbstractCegarLoop]: Abstraction has 1392 states and 1943 transitions. [2022-02-20 21:50:21,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:50:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1943 transitions. [2022-02-20 21:50:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 21:50:21,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:50:21,692 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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 21:50:21,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:50:21,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:50:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:50:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 365368980, now seen corresponding path program 1 times [2022-02-20 21:50:21,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:50:21,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077064103] [2022-02-20 21:50:21,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:50:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:50:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:50:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:21,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:21,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:21,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:21,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1773#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:50:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:21,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:21,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:21,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:21,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1775#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:21,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:50:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:21,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:21,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:21,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:21,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1777#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:50:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:21,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:21,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:21,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:21,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1779#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:50:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:22,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:22,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1781#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:50:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:22,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {8784#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~tmp___0~0 := #t~nondet44;havoc #t~nondet44; {8756#true} is VALID [2022-02-20 21:50:22,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {8756#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1863#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {8756#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(90, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(35, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(28, 7);call #Ultimate.allocInit(26, 8);call #Ultimate.allocInit(59, 9);call #Ultimate.allocInit(43, 10);call #Ultimate.allocInit(26, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(42, 14);call #Ultimate.allocInit(40, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(46, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(26, 19);call #Ultimate.allocInit(23, 20);call #Ultimate.allocInit(26, 21);call #Ultimate.allocInit(42, 22);call #Ultimate.allocInit(48, 23);call #Ultimate.allocInit(26, 24);call #Ultimate.allocInit(32, 25);call #Ultimate.allocInit(26, 26);call #Ultimate.allocInit(27, 27);call #Ultimate.allocInit(26, 28);call #Ultimate.allocInit(28, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(32, 31);call #Ultimate.allocInit(28, 32);call #Ultimate.allocInit(47, 33);call #Ultimate.allocInit(38, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(13, 36);call #Ultimate.allocInit(9, 37);call #Ultimate.allocInit(29, 38);call #Ultimate.allocInit(26, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(33, 41);call #Ultimate.allocInit(37, 42);call #Ultimate.allocInit(47, 43);call #Ultimate.allocInit(14, 44);call #Ultimate.allocInit(56, 45);call #Ultimate.allocInit(46, 46);call #Ultimate.allocInit(33, 47);call #Ultimate.allocInit(38, 48);call #Ultimate.allocInit(26, 49);call #Ultimate.allocInit(14, 50);call #Ultimate.allocInit(12, 51);call #Ultimate.allocInit(35, 52);call #Ultimate.allocInit(32, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(26, 55);call #Ultimate.allocInit(33, 56);call #Ultimate.allocInit(35, 57);call #Ultimate.allocInit(32, 58);call #Ultimate.allocInit(38, 59);call #Ultimate.allocInit(31, 60);call #Ultimate.allocInit(12, 61);call #Ultimate.allocInit(6, 62);call write~init~int(116, 62, 0, 1);call write~init~int(116, 62, 1, 1);call write~init~int(121, 62, 2, 1);call write~init~int(71, 62, 3, 1);call write~init~int(85, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(47, 64);call #Ultimate.allocInit(54, 65);~LDV_IN_INTERRUPT~0 := 1;~gigaset_usb_driver_group1~0.base, ~gigaset_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ops_group1~0.base, ~ops_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ops_group0~0.base, ~ops_group0~0.offset := 0, 0;~startmode~0 := 1;~cidmode~0 := 1;~#gigaset_table~0.base, ~#gigaset_table~0.offset := 66, 0;call #Ultimate.allocInit(50, 66);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#gigaset_table~0.base);call write~unchecked~int(3, ~#gigaset_table~0.base, ~#gigaset_table~0.offset, 2);call write~unchecked~int(1665, ~#gigaset_table~0.base, 2 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(9, ~#gigaset_table~0.base, 4 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 6 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 8 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 10 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 11 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 12 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 13 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 14 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 15 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 16 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 17 + ~#gigaset_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~driver~0.base, ~driver~0.offset := 0, 0;~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset := 67, 0;call #Ultimate.allocInit(285, 67);call write~init~$Pointer$(3, 0, ~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_probe.base, #funAddr~gigaset_probe.offset, ~#gigaset_usb_driver~0.base, 8 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_disconnect.base, #funAddr~gigaset_disconnect.offset, ~#gigaset_usb_driver~0.base, 16 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 24 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_suspend.base, #funAddr~gigaset_suspend.offset, ~#gigaset_usb_driver~0.base, 32 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 40 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 48 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_pre_reset.base, #funAddr~gigaset_pre_reset.offset, ~#gigaset_usb_driver~0.base, 56 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 64 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(~#gigaset_table~0.base, ~#gigaset_table~0.offset, ~#gigaset_usb_driver~0.base, 72 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 80 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 84 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 88 + ~#gigaset_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 92 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 100 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 108 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 116 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 124 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 132 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 136 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 148 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 156 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 164 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 172 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 180 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 188 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 196 + ~#gigaset_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 197 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 205 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 213 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 221 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 229 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 237 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 245 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 253 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 261 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 269 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 277 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 281 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 282 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(1, ~#gigaset_usb_driver~0.base, 283 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 284 + ~#gigaset_usb_driver~0.offset, 1);~#ops~0.base, ~#ops~0.offset := 68, 0;call #Ultimate.allocInit(128, 68);call write~init~$Pointer$(#funAddr~gigaset_write_cmd.base, #funAddr~gigaset_write_cmd.offset, ~#ops~0.base, ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_write_room.base, #funAddr~gigaset_write_room.offset, ~#ops~0.base, 8 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_chars_in_buffer.base, #funAddr~gigaset_chars_in_buffer.offset, ~#ops~0.base, 16 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_brkchars.base, #funAddr~gigaset_brkchars.offset, ~#ops~0.base, 24 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_init_bchannel.base, #funAddr~gigaset_init_bchannel.offset, ~#ops~0.base, 32 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_close_bchannel.base, #funAddr~gigaset_close_bchannel.offset, ~#ops~0.base, 40 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initbcshw.base, #funAddr~gigaset_initbcshw.offset, ~#ops~0.base, 48 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freebcshw.base, #funAddr~gigaset_freebcshw.offset, ~#ops~0.base, 56 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_reinitbcshw.base, #funAddr~gigaset_reinitbcshw.offset, ~#ops~0.base, 64 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initcshw.base, #funAddr~gigaset_initcshw.offset, ~#ops~0.base, 72 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freecshw.base, #funAddr~gigaset_freecshw.offset, ~#ops~0.base, 80 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_modem_ctrl.base, #funAddr~gigaset_set_modem_ctrl.offset, ~#ops~0.base, 88 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_baud_rate.base, #funAddr~gigaset_baud_rate.offset, ~#ops~0.base, 96 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_line_ctrl.base, #funAddr~gigaset_set_line_ctrl.offset, ~#ops~0.base, 104 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_send_skb.base, #funAddr~gigaset_m10x_send_skb.offset, ~#ops~0.base, 112 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_input.base, #funAddr~gigaset_m10x_input.offset, ~#ops~0.base, 120 + ~#ops~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset, main_#t~ret407#1.base, main_#t~ret407#1.offset, main_#t~nondet408#1, main_#t~nondet409#1, main_#t~ret410#1.base, main_#t~ret410#1.offset, main_#t~nondet411#1, main_#t~nondet412#1, main_#t~ret413#1.base, main_#t~ret413#1.offset, main_#t~ret414#1.base, main_#t~ret414#1.offset, main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset, main_#t~nondet416#1, main_#t~switch417#1, main_#t~nondet418#1, main_#t~switch419#1, main_#t~ret420#1, main_#t~ret421#1, main_#t~ret422#1, main_#t~ret423#1, main_#t~ret424#1, main_#t~ret425#1, main_#t~ret426#1, main_#t~ret427#1, main_#t~ret428#1, main_#t~ret429#1, main_#t~ret430#1, main_#t~ret431#1, main_#t~ret432#1, main_#t~ret433#1, main_#t~ret434#1, main_#t~ret435#1, main_#t~ret436#1, main_#t~ret437#1, main_#t~ret438#1, main_#t~ret439#1, main_#t~ret440#1, main_#t~ret441#1, main_#t~ret442#1, main_#t~ret443#1, main_#t~ret444#1, main_#t~nondet445#1, main_#t~switch446#1, main_#t~ret447#1, main_#t~nondet448#1, main_#t~switch449#1, main_#t~ret450#1, main_#t~ret451#1, main_#t~mem452#1, main_#t~ret453#1, main_#t~ret454#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~ldvarg0~0#1, main_~tmp___1~7#1, main_~ldvarg5~0#1, main_~tmp___2~7#1, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset, main_~ldvarg1~0#1, main_~tmp___4~4#1, main_~ldvarg4~0#1, main_~tmp___5~2#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~tmp___10~0#1, main_~tmp___11~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~7#1;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~4#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~2#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~tmp___10~0#1;havoc main_~tmp___11~0#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,046 INFO L272 TraceCheckUtils]: 2: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret406#1.base, main_#t~ret406#1.offset := ldv_zalloc(8216); {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:22,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:22,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,049 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1773#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret406#1.base, main_#t~ret406#1.offset;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,059 INFO L272 TraceCheckUtils]: 8: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret407#1.base, main_#t~ret407#1.offset := ldv_zalloc(240); {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:22,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:22,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,063 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1775#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret407#1.base, main_#t~ret407#1.offset;havoc main_#t~ret407#1.base, main_#t~ret407#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;main_~tmp___1~7#1 := main_#t~nondet408#1;havoc main_#t~nondet408#1;main_~ldvarg0~0#1 := main_~tmp___1~7#1;main_~tmp___2~7#1 := main_#t~nondet409#1;havoc main_#t~nondet409#1;main_~ldvarg5~0#1 := main_~tmp___2~7#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,064 INFO L272 TraceCheckUtils]: 14: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret410#1.base, main_#t~ret410#1.offset := ldv_zalloc(32); {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:22,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:22,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,066 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1777#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset := main_#t~ret410#1.base, main_#t~ret410#1.offset;havoc main_#t~ret410#1.base, main_#t~ret410#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;main_~tmp___4~4#1 := main_#t~nondet411#1;havoc main_#t~nondet411#1;main_~ldvarg1~0#1 := main_~tmp___4~4#1;main_~tmp___5~2#1 := main_#t~nondet412#1;havoc main_#t~nondet412#1;main_~ldvarg4~0#1 := main_~tmp___5~2#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,069 INFO L272 TraceCheckUtils]: 20: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret413#1.base, main_#t~ret413#1.offset := ldv_zalloc(1); {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:22,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:22,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,070 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1779#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset := main_#t~ret413#1.base, main_#t~ret413#1.offset;havoc main_#t~ret413#1.base, main_#t~ret413#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,071 INFO L272 TraceCheckUtils]: 26: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret414#1.base, main_#t~ret414#1.offset := ldv_zalloc(32); {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:22,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {8783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {8756#true} is VALID [2022-02-20 21:50:22,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {8756#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,073 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1781#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset := main_#t~ret414#1.base, main_#t~ret414#1.offset;havoc main_#t~ret414#1.base, main_#t~ret414#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;assume { :begin_inline_ldv_initialize } true; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr496#1;#Ultimate.C_memset_#t~loopctr496#1 := 0; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(#Ultimate.C_memset_#t~loopctr496#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume -2147483648 <= main_#t~nondet416#1 && main_#t~nondet416#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet416#1;havoc main_#t~nondet416#1;main_#t~switch417#1 := 0 == main_~tmp___8~0#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch417#1;main_#t~switch417#1 := main_#t~switch417#1 || 1 == main_~tmp___8~0#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch417#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet445#1 && main_#t~nondet445#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet445#1;havoc main_#t~nondet445#1;main_#t~switch446#1 := 0 == main_~tmp___10~0#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch446#1;main_#t~switch446#1 := main_#t~switch446#1 || 1 == main_~tmp___10~0#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch446#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_usb_gigaset_init } true;havoc usb_gigaset_init_#res#1;havoc usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset, usb_gigaset_init_#t~ret397#1, usb_gigaset_init_#t~nondet398#1, usb_gigaset_init_#t~nondet399#1, usb_gigaset_init_~result~0#1;havoc usb_gigaset_init_~result~0#1;assume { :begin_inline_gigaset_initdriver } true;gigaset_initdriver_#in~arg0#1, gigaset_initdriver_#in~arg1#1, gigaset_initdriver_#in~arg2#1.base, gigaset_initdriver_#in~arg2#1.offset, gigaset_initdriver_#in~arg3#1.base, gigaset_initdriver_#in~arg3#1.offset, gigaset_initdriver_#in~arg4#1.base, gigaset_initdriver_#in~arg4#1.offset, gigaset_initdriver_#in~arg5#1.base, gigaset_initdriver_#in~arg5#1.offset := 8, 1, 61, 0, 62, 0, ~#ops~0.base, ~#ops~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset;havoc gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset, gigaset_initdriver_~arg0#1, gigaset_initdriver_~arg1#1, gigaset_initdriver_~arg2#1.base, gigaset_initdriver_~arg2#1.offset, gigaset_initdriver_~arg3#1.base, gigaset_initdriver_~arg3#1.offset, gigaset_initdriver_~arg4#1.base, gigaset_initdriver_~arg4#1.offset, gigaset_initdriver_~arg5#1.base, gigaset_initdriver_~arg5#1.offset;gigaset_initdriver_~arg0#1 := gigaset_initdriver_#in~arg0#1;gigaset_initdriver_~arg1#1 := gigaset_initdriver_#in~arg1#1;gigaset_initdriver_~arg2#1.base, gigaset_initdriver_~arg2#1.offset := gigaset_initdriver_#in~arg2#1.base, gigaset_initdriver_#in~arg2#1.offset;gigaset_initdriver_~arg3#1.base, gigaset_initdriver_~arg3#1.offset := gigaset_initdriver_#in~arg3#1.base, gigaset_initdriver_#in~arg3#1.offset;gigaset_initdriver_~arg4#1.base, gigaset_initdriver_~arg4#1.offset := gigaset_initdriver_#in~arg4#1.base, gigaset_initdriver_#in~arg4#1.offset;gigaset_initdriver_~arg5#1.base, gigaset_initdriver_~arg5#1.offset := gigaset_initdriver_#in~arg5#1.base, gigaset_initdriver_#in~arg5#1.offset; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,079 INFO L272 TraceCheckUtils]: 42: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset := ldv_malloc(132); {8784#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:22,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {8784#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~tmp___0~0 := #t~nondet44;havoc #t~nondet44; {8756#true} is VALID [2022-02-20 21:50:22,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {8756#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8756#true} is VALID [2022-02-20 21:50:22,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {8756#true} assume true; {8756#true} is VALID [2022-02-20 21:50:22,081 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8756#true} {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1863#return; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset := gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset;havoc gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset := gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset;assume { :end_inline_gigaset_initdriver } true;~driver~0.base, ~driver~0.offset := usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset;havoc usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 == (~driver~0.base + ~driver~0.offset) % 18446744073709551616;usb_gigaset_init_~result~0#1 := -12; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 != (~driver~0.base + ~driver~0.offset) % 18446744073709551616); {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} ~driver~0.base, ~driver~0.offset := 0, 0;usb_gigaset_init_#res#1 := usb_gigaset_init_~result~0#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_#t~ret447#1 := usb_gigaset_init_#res#1;assume { :end_inline_usb_gigaset_init } true;assume -2147483648 <= main_#t~ret447#1 && main_#t~ret447#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret447#1;havoc main_#t~ret447#1; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == ~ldv_retval_0~0); {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:50:22,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {8758#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {8757#false} is VALID [2022-02-20 21:50:22,086 INFO L272 TraceCheckUtils]: 57: Hoare triple {8757#false} call ldv_error(); {8757#false} is VALID [2022-02-20 21:50:22,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {8757#false} assume !false; {8757#false} is VALID [2022-02-20 21:50:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:50:22,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:50:22,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077064103] [2022-02-20 21:50:22,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077064103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:50:22,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:50:22,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:50:22,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495962123] [2022-02-20 21:50:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:50:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2022-02-20 21:50:22,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:50:22,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:22,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:22,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:50:22,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:50:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:50:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:50:22,150 INFO L87 Difference]: Start difference. First operand 1392 states and 1943 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:31,323 INFO L93 Difference]: Finished difference Result 4485 states and 6415 transitions. [2022-02-20 21:50:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:50:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2022-02-20 21:50:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:50:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3314 transitions. [2022-02-20 21:50:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3314 transitions. [2022-02-20 21:50:31,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 3314 transitions. [2022-02-20 21:50:34,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3314 edges. 3314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:34,967 INFO L225 Difference]: With dead ends: 4485 [2022-02-20 21:50:34,967 INFO L226 Difference]: Without dead ends: 3108 [2022-02-20 21:50:34,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:50:34,972 INFO L933 BasicCegarLoop]: 1075 mSDtfsCounter, 2116 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1038 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1038 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:50:34,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2240 Valid, 1976 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1038 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 21:50:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2022-02-20 21:50:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2810. [2022-02-20 21:50:35,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:50:35,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3108 states. Second operand has 2810 states, 1991 states have (on average 1.353088900050226) internal successors, (2694), 2041 states have internal predecessors, (2694), 608 states have call successors, (608), 201 states have call predecessors, (608), 210 states have return successors, (659), 593 states have call predecessors, (659), 603 states have call successors, (659) [2022-02-20 21:50:35,085 INFO L74 IsIncluded]: Start isIncluded. First operand 3108 states. Second operand has 2810 states, 1991 states have (on average 1.353088900050226) internal successors, (2694), 2041 states have internal predecessors, (2694), 608 states have call successors, (608), 201 states have call predecessors, (608), 210 states have return successors, (659), 593 states have call predecessors, (659), 603 states have call successors, (659) [2022-02-20 21:50:35,092 INFO L87 Difference]: Start difference. First operand 3108 states. Second operand has 2810 states, 1991 states have (on average 1.353088900050226) internal successors, (2694), 2041 states have internal predecessors, (2694), 608 states have call successors, (608), 201 states have call predecessors, (608), 210 states have return successors, (659), 593 states have call predecessors, (659), 603 states have call successors, (659) [2022-02-20 21:50:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:35,528 INFO L93 Difference]: Finished difference Result 3108 states and 4426 transitions. [2022-02-20 21:50:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4426 transitions. [2022-02-20 21:50:35,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:50:35,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:50:35,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 2810 states, 1991 states have (on average 1.353088900050226) internal successors, (2694), 2041 states have internal predecessors, (2694), 608 states have call successors, (608), 201 states have call predecessors, (608), 210 states have return successors, (659), 593 states have call predecessors, (659), 603 states have call successors, (659) Second operand 3108 states. [2022-02-20 21:50:35,566 INFO L87 Difference]: Start difference. First operand has 2810 states, 1991 states have (on average 1.353088900050226) internal successors, (2694), 2041 states have internal predecessors, (2694), 608 states have call successors, (608), 201 states have call predecessors, (608), 210 states have return successors, (659), 593 states have call predecessors, (659), 603 states have call successors, (659) Second operand 3108 states. [2022-02-20 21:50:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:36,018 INFO L93 Difference]: Finished difference Result 3108 states and 4426 transitions. [2022-02-20 21:50:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4426 transitions. [2022-02-20 21:50:36,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:50:36,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:50:36,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:50:36,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:50:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 1991 states have (on average 1.353088900050226) internal successors, (2694), 2041 states have internal predecessors, (2694), 608 states have call successors, (608), 201 states have call predecessors, (608), 210 states have return successors, (659), 593 states have call predecessors, (659), 603 states have call successors, (659) [2022-02-20 21:50:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3961 transitions. [2022-02-20 21:50:36,505 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3961 transitions. Word has length 59 [2022-02-20 21:50:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:50:36,506 INFO L470 AbstractCegarLoop]: Abstraction has 2810 states and 3961 transitions. [2022-02-20 21:50:36,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3961 transitions. [2022-02-20 21:50:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 21:50:36,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:50:36,510 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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 21:50:36,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:50:36,511 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:50:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:50:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1558877821, now seen corresponding path program 1 times [2022-02-20 21:50:36,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:50:36,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453042478] [2022-02-20 21:50:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:50:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:50:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:50:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1773#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:50:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1775#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:50:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1777#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:50:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1779#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:50:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1781#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:50:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:36,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {24899#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~tmp___0~0 := #t~nondet44;havoc #t~nondet44; {24871#true} is VALID [2022-02-20 21:50:36,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {24871#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1863#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {24871#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(90, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(35, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(28, 7);call #Ultimate.allocInit(26, 8);call #Ultimate.allocInit(59, 9);call #Ultimate.allocInit(43, 10);call #Ultimate.allocInit(26, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(42, 14);call #Ultimate.allocInit(40, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(46, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(26, 19);call #Ultimate.allocInit(23, 20);call #Ultimate.allocInit(26, 21);call #Ultimate.allocInit(42, 22);call #Ultimate.allocInit(48, 23);call #Ultimate.allocInit(26, 24);call #Ultimate.allocInit(32, 25);call #Ultimate.allocInit(26, 26);call #Ultimate.allocInit(27, 27);call #Ultimate.allocInit(26, 28);call #Ultimate.allocInit(28, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(32, 31);call #Ultimate.allocInit(28, 32);call #Ultimate.allocInit(47, 33);call #Ultimate.allocInit(38, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(13, 36);call #Ultimate.allocInit(9, 37);call #Ultimate.allocInit(29, 38);call #Ultimate.allocInit(26, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(33, 41);call #Ultimate.allocInit(37, 42);call #Ultimate.allocInit(47, 43);call #Ultimate.allocInit(14, 44);call #Ultimate.allocInit(56, 45);call #Ultimate.allocInit(46, 46);call #Ultimate.allocInit(33, 47);call #Ultimate.allocInit(38, 48);call #Ultimate.allocInit(26, 49);call #Ultimate.allocInit(14, 50);call #Ultimate.allocInit(12, 51);call #Ultimate.allocInit(35, 52);call #Ultimate.allocInit(32, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(26, 55);call #Ultimate.allocInit(33, 56);call #Ultimate.allocInit(35, 57);call #Ultimate.allocInit(32, 58);call #Ultimate.allocInit(38, 59);call #Ultimate.allocInit(31, 60);call #Ultimate.allocInit(12, 61);call #Ultimate.allocInit(6, 62);call write~init~int(116, 62, 0, 1);call write~init~int(116, 62, 1, 1);call write~init~int(121, 62, 2, 1);call write~init~int(71, 62, 3, 1);call write~init~int(85, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(47, 64);call #Ultimate.allocInit(54, 65);~LDV_IN_INTERRUPT~0 := 1;~gigaset_usb_driver_group1~0.base, ~gigaset_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ops_group1~0.base, ~ops_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ops_group0~0.base, ~ops_group0~0.offset := 0, 0;~startmode~0 := 1;~cidmode~0 := 1;~#gigaset_table~0.base, ~#gigaset_table~0.offset := 66, 0;call #Ultimate.allocInit(50, 66);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#gigaset_table~0.base);call write~unchecked~int(3, ~#gigaset_table~0.base, ~#gigaset_table~0.offset, 2);call write~unchecked~int(1665, ~#gigaset_table~0.base, 2 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(9, ~#gigaset_table~0.base, 4 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 6 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 8 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 10 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 11 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 12 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 13 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 14 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 15 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 16 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 17 + ~#gigaset_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~driver~0.base, ~driver~0.offset := 0, 0;~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset := 67, 0;call #Ultimate.allocInit(285, 67);call write~init~$Pointer$(3, 0, ~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_probe.base, #funAddr~gigaset_probe.offset, ~#gigaset_usb_driver~0.base, 8 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_disconnect.base, #funAddr~gigaset_disconnect.offset, ~#gigaset_usb_driver~0.base, 16 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 24 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_suspend.base, #funAddr~gigaset_suspend.offset, ~#gigaset_usb_driver~0.base, 32 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 40 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 48 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_pre_reset.base, #funAddr~gigaset_pre_reset.offset, ~#gigaset_usb_driver~0.base, 56 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 64 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(~#gigaset_table~0.base, ~#gigaset_table~0.offset, ~#gigaset_usb_driver~0.base, 72 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 80 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 84 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 88 + ~#gigaset_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 92 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 100 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 108 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 116 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 124 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 132 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 136 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 148 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 156 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 164 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 172 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 180 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 188 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 196 + ~#gigaset_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 197 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 205 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 213 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 221 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 229 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 237 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 245 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 253 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 261 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 269 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 277 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 281 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 282 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(1, ~#gigaset_usb_driver~0.base, 283 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 284 + ~#gigaset_usb_driver~0.offset, 1);~#ops~0.base, ~#ops~0.offset := 68, 0;call #Ultimate.allocInit(128, 68);call write~init~$Pointer$(#funAddr~gigaset_write_cmd.base, #funAddr~gigaset_write_cmd.offset, ~#ops~0.base, ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_write_room.base, #funAddr~gigaset_write_room.offset, ~#ops~0.base, 8 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_chars_in_buffer.base, #funAddr~gigaset_chars_in_buffer.offset, ~#ops~0.base, 16 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_brkchars.base, #funAddr~gigaset_brkchars.offset, ~#ops~0.base, 24 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_init_bchannel.base, #funAddr~gigaset_init_bchannel.offset, ~#ops~0.base, 32 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_close_bchannel.base, #funAddr~gigaset_close_bchannel.offset, ~#ops~0.base, 40 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initbcshw.base, #funAddr~gigaset_initbcshw.offset, ~#ops~0.base, 48 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freebcshw.base, #funAddr~gigaset_freebcshw.offset, ~#ops~0.base, 56 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_reinitbcshw.base, #funAddr~gigaset_reinitbcshw.offset, ~#ops~0.base, 64 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initcshw.base, #funAddr~gigaset_initcshw.offset, ~#ops~0.base, 72 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freecshw.base, #funAddr~gigaset_freecshw.offset, ~#ops~0.base, 80 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_modem_ctrl.base, #funAddr~gigaset_set_modem_ctrl.offset, ~#ops~0.base, 88 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_baud_rate.base, #funAddr~gigaset_baud_rate.offset, ~#ops~0.base, 96 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_line_ctrl.base, #funAddr~gigaset_set_line_ctrl.offset, ~#ops~0.base, 104 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_send_skb.base, #funAddr~gigaset_m10x_send_skb.offset, ~#ops~0.base, 112 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_input.base, #funAddr~gigaset_m10x_input.offset, ~#ops~0.base, 120 + ~#ops~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset, main_#t~ret407#1.base, main_#t~ret407#1.offset, main_#t~nondet408#1, main_#t~nondet409#1, main_#t~ret410#1.base, main_#t~ret410#1.offset, main_#t~nondet411#1, main_#t~nondet412#1, main_#t~ret413#1.base, main_#t~ret413#1.offset, main_#t~ret414#1.base, main_#t~ret414#1.offset, main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset, main_#t~nondet416#1, main_#t~switch417#1, main_#t~nondet418#1, main_#t~switch419#1, main_#t~ret420#1, main_#t~ret421#1, main_#t~ret422#1, main_#t~ret423#1, main_#t~ret424#1, main_#t~ret425#1, main_#t~ret426#1, main_#t~ret427#1, main_#t~ret428#1, main_#t~ret429#1, main_#t~ret430#1, main_#t~ret431#1, main_#t~ret432#1, main_#t~ret433#1, main_#t~ret434#1, main_#t~ret435#1, main_#t~ret436#1, main_#t~ret437#1, main_#t~ret438#1, main_#t~ret439#1, main_#t~ret440#1, main_#t~ret441#1, main_#t~ret442#1, main_#t~ret443#1, main_#t~ret444#1, main_#t~nondet445#1, main_#t~switch446#1, main_#t~ret447#1, main_#t~nondet448#1, main_#t~switch449#1, main_#t~ret450#1, main_#t~ret451#1, main_#t~mem452#1, main_#t~ret453#1, main_#t~ret454#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~ldvarg0~0#1, main_~tmp___1~7#1, main_~ldvarg5~0#1, main_~tmp___2~7#1, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset, main_~ldvarg1~0#1, main_~tmp___4~4#1, main_~ldvarg4~0#1, main_~tmp___5~2#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~tmp___10~0#1, main_~tmp___11~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~7#1;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~4#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~2#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~tmp___10~0#1;havoc main_~tmp___11~0#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,781 INFO L272 TraceCheckUtils]: 2: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret406#1.base, main_#t~ret406#1.offset := ldv_zalloc(8216); {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:36,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,782 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1773#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret406#1.base, main_#t~ret406#1.offset;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,784 INFO L272 TraceCheckUtils]: 8: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret407#1.base, main_#t~ret407#1.offset := ldv_zalloc(240); {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:36,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,788 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1775#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret407#1.base, main_#t~ret407#1.offset;havoc main_#t~ret407#1.base, main_#t~ret407#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;main_~tmp___1~7#1 := main_#t~nondet408#1;havoc main_#t~nondet408#1;main_~ldvarg0~0#1 := main_~tmp___1~7#1;main_~tmp___2~7#1 := main_#t~nondet409#1;havoc main_#t~nondet409#1;main_~ldvarg5~0#1 := main_~tmp___2~7#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,790 INFO L272 TraceCheckUtils]: 14: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret410#1.base, main_#t~ret410#1.offset := ldv_zalloc(32); {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:36,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,791 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1777#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset := main_#t~ret410#1.base, main_#t~ret410#1.offset;havoc main_#t~ret410#1.base, main_#t~ret410#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;main_~tmp___4~4#1 := main_#t~nondet411#1;havoc main_#t~nondet411#1;main_~ldvarg1~0#1 := main_~tmp___4~4#1;main_~tmp___5~2#1 := main_#t~nondet412#1;havoc main_#t~nondet412#1;main_~ldvarg4~0#1 := main_~tmp___5~2#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,793 INFO L272 TraceCheckUtils]: 20: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret413#1.base, main_#t~ret413#1.offset := ldv_zalloc(1); {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:36,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,795 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1779#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset := main_#t~ret413#1.base, main_#t~ret413#1.offset;havoc main_#t~ret413#1.base, main_#t~ret413#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,796 INFO L272 TraceCheckUtils]: 26: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret414#1.base, main_#t~ret414#1.offset := ldv_zalloc(32); {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:36,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {24898#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {24871#true} is VALID [2022-02-20 21:50:36,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {24871#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,797 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1781#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset := main_#t~ret414#1.base, main_#t~ret414#1.offset;havoc main_#t~ret414#1.base, main_#t~ret414#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;assume { :begin_inline_ldv_initialize } true; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr496#1;#Ultimate.C_memset_#t~loopctr496#1 := 0; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(#Ultimate.C_memset_#t~loopctr496#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume -2147483648 <= main_#t~nondet416#1 && main_#t~nondet416#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet416#1;havoc main_#t~nondet416#1;main_#t~switch417#1 := 0 == main_~tmp___8~0#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch417#1;main_#t~switch417#1 := main_#t~switch417#1 || 1 == main_~tmp___8~0#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch417#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet445#1 && main_#t~nondet445#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet445#1;havoc main_#t~nondet445#1;main_#t~switch446#1 := 0 == main_~tmp___10~0#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch446#1;main_#t~switch446#1 := main_#t~switch446#1 || 1 == main_~tmp___10~0#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch446#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_usb_gigaset_init } true;havoc usb_gigaset_init_#res#1;havoc usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset, usb_gigaset_init_#t~ret397#1, usb_gigaset_init_#t~nondet398#1, usb_gigaset_init_#t~nondet399#1, usb_gigaset_init_~result~0#1;havoc usb_gigaset_init_~result~0#1;assume { :begin_inline_gigaset_initdriver } true;gigaset_initdriver_#in~arg0#1, gigaset_initdriver_#in~arg1#1, gigaset_initdriver_#in~arg2#1.base, gigaset_initdriver_#in~arg2#1.offset, gigaset_initdriver_#in~arg3#1.base, gigaset_initdriver_#in~arg3#1.offset, gigaset_initdriver_#in~arg4#1.base, gigaset_initdriver_#in~arg4#1.offset, gigaset_initdriver_#in~arg5#1.base, gigaset_initdriver_#in~arg5#1.offset := 8, 1, 61, 0, 62, 0, ~#ops~0.base, ~#ops~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset;havoc gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset, gigaset_initdriver_~arg0#1, gigaset_initdriver_~arg1#1, gigaset_initdriver_~arg2#1.base, gigaset_initdriver_~arg2#1.offset, gigaset_initdriver_~arg3#1.base, gigaset_initdriver_~arg3#1.offset, gigaset_initdriver_~arg4#1.base, gigaset_initdriver_~arg4#1.offset, gigaset_initdriver_~arg5#1.base, gigaset_initdriver_~arg5#1.offset;gigaset_initdriver_~arg0#1 := gigaset_initdriver_#in~arg0#1;gigaset_initdriver_~arg1#1 := gigaset_initdriver_#in~arg1#1;gigaset_initdriver_~arg2#1.base, gigaset_initdriver_~arg2#1.offset := gigaset_initdriver_#in~arg2#1.base, gigaset_initdriver_#in~arg2#1.offset;gigaset_initdriver_~arg3#1.base, gigaset_initdriver_~arg3#1.offset := gigaset_initdriver_#in~arg3#1.base, gigaset_initdriver_#in~arg3#1.offset;gigaset_initdriver_~arg4#1.base, gigaset_initdriver_~arg4#1.offset := gigaset_initdriver_#in~arg4#1.base, gigaset_initdriver_#in~arg4#1.offset;gigaset_initdriver_~arg5#1.base, gigaset_initdriver_~arg5#1.offset := gigaset_initdriver_#in~arg5#1.base, gigaset_initdriver_#in~arg5#1.offset; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,804 INFO L272 TraceCheckUtils]: 42: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset := ldv_malloc(132); {24899#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:36,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {24899#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~tmp___0~0 := #t~nondet44;havoc #t~nondet44; {24871#true} is VALID [2022-02-20 21:50:36,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {24871#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {24871#true} is VALID [2022-02-20 21:50:36,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {24871#true} assume true; {24871#true} is VALID [2022-02-20 21:50:36,805 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24871#true} {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1863#return; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset := gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset;havoc gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset := gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset;assume { :end_inline_gigaset_initdriver } true;~driver~0.base, ~driver~0.offset := usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset;havoc usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 == (~driver~0.base + ~driver~0.offset) % 18446744073709551616;usb_gigaset_init_~result~0#1 := -12; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 != (~driver~0.base + ~driver~0.offset) % 18446744073709551616); {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} ~driver~0.base, ~driver~0.offset := 0, 0;usb_gigaset_init_#res#1 := usb_gigaset_init_~result~0#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_#t~ret447#1 := usb_gigaset_init_#res#1;assume { :end_inline_usb_gigaset_init } true;assume -2147483648 <= main_#t~ret447#1 && main_#t~ret447#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret447#1;havoc main_#t~ret447#1; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == ~ldv_retval_0~0); {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:50:36,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {24873#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616); {24872#false} is VALID [2022-02-20 21:50:36,821 INFO L272 TraceCheckUtils]: 58: Hoare triple {24872#false} call ldv_error(); {24872#false} is VALID [2022-02-20 21:50:36,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {24872#false} assume !false; {24872#false} is VALID [2022-02-20 21:50:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:50:36,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:50:36,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453042478] [2022-02-20 21:50:36,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453042478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:50:36,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:50:36,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:50:36,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125417572] [2022-02-20 21:50:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:50:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2022-02-20 21:50:36,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:50:36,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:36,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:36,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:50:36,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:50:36,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:50:36,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:50:36,875 INFO L87 Difference]: Start difference. First operand 2810 states and 3961 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:47,429 INFO L93 Difference]: Finished difference Result 8967 states and 12975 transitions. [2022-02-20 21:50:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:50:47,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2022-02-20 21:50:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:50:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3299 transitions. [2022-02-20 21:50:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3299 transitions. [2022-02-20 21:50:47,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 3299 transitions. [2022-02-20 21:50:50,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3299 edges. 3299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:51,866 INFO L225 Difference]: With dead ends: 8967 [2022-02-20 21:50:51,866 INFO L226 Difference]: Without dead ends: 6172 [2022-02-20 21:50:51,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:50:51,877 INFO L933 BasicCegarLoop]: 1129 mSDtfsCounter, 2087 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1010 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:50:51,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2212 Valid, 2064 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1010 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 21:50:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2022-02-20 21:50:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 5639. [2022-02-20 21:50:52,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:50:52,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6172 states. Second operand has 5639 states, 3996 states have (on average 1.3488488488488488) internal successors, (5390), 4092 states have internal predecessors, (5390), 1212 states have call successors, (1212), 401 states have call predecessors, (1212), 430 states have return successors, (1423), 1197 states have call predecessors, (1423), 1207 states have call successors, (1423) [2022-02-20 21:50:52,102 INFO L74 IsIncluded]: Start isIncluded. First operand 6172 states. Second operand has 5639 states, 3996 states have (on average 1.3488488488488488) internal successors, (5390), 4092 states have internal predecessors, (5390), 1212 states have call successors, (1212), 401 states have call predecessors, (1212), 430 states have return successors, (1423), 1197 states have call predecessors, (1423), 1207 states have call successors, (1423) [2022-02-20 21:50:52,114 INFO L87 Difference]: Start difference. First operand 6172 states. Second operand has 5639 states, 3996 states have (on average 1.3488488488488488) internal successors, (5390), 4092 states have internal predecessors, (5390), 1212 states have call successors, (1212), 401 states have call predecessors, (1212), 430 states have return successors, (1423), 1197 states have call predecessors, (1423), 1207 states have call successors, (1423) [2022-02-20 21:50:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:53,421 INFO L93 Difference]: Finished difference Result 6172 states and 8868 transitions. [2022-02-20 21:50:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 8868 transitions. [2022-02-20 21:50:53,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:50:53,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:50:53,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 5639 states, 3996 states have (on average 1.3488488488488488) internal successors, (5390), 4092 states have internal predecessors, (5390), 1212 states have call successors, (1212), 401 states have call predecessors, (1212), 430 states have return successors, (1423), 1197 states have call predecessors, (1423), 1207 states have call successors, (1423) Second operand 6172 states. [2022-02-20 21:50:53,475 INFO L87 Difference]: Start difference. First operand has 5639 states, 3996 states have (on average 1.3488488488488488) internal successors, (5390), 4092 states have internal predecessors, (5390), 1212 states have call successors, (1212), 401 states have call predecessors, (1212), 430 states have return successors, (1423), 1197 states have call predecessors, (1423), 1207 states have call successors, (1423) Second operand 6172 states. [2022-02-20 21:50:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:50:54,792 INFO L93 Difference]: Finished difference Result 6172 states and 8868 transitions. [2022-02-20 21:50:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 8868 transitions. [2022-02-20 21:50:54,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:50:54,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:50:54,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:50:54,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:50:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5639 states, 3996 states have (on average 1.3488488488488488) internal successors, (5390), 4092 states have internal predecessors, (5390), 1212 states have call successors, (1212), 401 states have call predecessors, (1212), 430 states have return successors, (1423), 1197 states have call predecessors, (1423), 1207 states have call successors, (1423) [2022-02-20 21:50:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 8025 transitions. [2022-02-20 21:50:56,186 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 8025 transitions. Word has length 60 [2022-02-20 21:50:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:50:56,186 INFO L470 AbstractCegarLoop]: Abstraction has 5639 states and 8025 transitions. [2022-02-20 21:50:56,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 8025 transitions. [2022-02-20 21:50:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 21:50:56,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:50:56,188 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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 21:50:56,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:50:56,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:50:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:50:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1080981641, now seen corresponding path program 1 times [2022-02-20 21:50:56,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:50:56,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559683422] [2022-02-20 21:50:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:50:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:50:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:50:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1773#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:50:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1775#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:50:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1777#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:50:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1779#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:50:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1781#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:50:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:50:56,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {57000#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~tmp___0~0 := #t~nondet44;havoc #t~nondet44; {56972#true} is VALID [2022-02-20 21:50:56,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {56972#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1863#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {56972#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(90, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(49, 4);call #Ultimate.allocInit(35, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(28, 7);call #Ultimate.allocInit(26, 8);call #Ultimate.allocInit(59, 9);call #Ultimate.allocInit(43, 10);call #Ultimate.allocInit(26, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(42, 14);call #Ultimate.allocInit(40, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(46, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(26, 19);call #Ultimate.allocInit(23, 20);call #Ultimate.allocInit(26, 21);call #Ultimate.allocInit(42, 22);call #Ultimate.allocInit(48, 23);call #Ultimate.allocInit(26, 24);call #Ultimate.allocInit(32, 25);call #Ultimate.allocInit(26, 26);call #Ultimate.allocInit(27, 27);call #Ultimate.allocInit(26, 28);call #Ultimate.allocInit(28, 29);call #Ultimate.allocInit(34, 30);call #Ultimate.allocInit(32, 31);call #Ultimate.allocInit(28, 32);call #Ultimate.allocInit(47, 33);call #Ultimate.allocInit(38, 34);call #Ultimate.allocInit(33, 35);call #Ultimate.allocInit(13, 36);call #Ultimate.allocInit(9, 37);call #Ultimate.allocInit(29, 38);call #Ultimate.allocInit(26, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(33, 41);call #Ultimate.allocInit(37, 42);call #Ultimate.allocInit(47, 43);call #Ultimate.allocInit(14, 44);call #Ultimate.allocInit(56, 45);call #Ultimate.allocInit(46, 46);call #Ultimate.allocInit(33, 47);call #Ultimate.allocInit(38, 48);call #Ultimate.allocInit(26, 49);call #Ultimate.allocInit(14, 50);call #Ultimate.allocInit(12, 51);call #Ultimate.allocInit(35, 52);call #Ultimate.allocInit(32, 53);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(26, 55);call #Ultimate.allocInit(33, 56);call #Ultimate.allocInit(35, 57);call #Ultimate.allocInit(32, 58);call #Ultimate.allocInit(38, 59);call #Ultimate.allocInit(31, 60);call #Ultimate.allocInit(12, 61);call #Ultimate.allocInit(6, 62);call write~init~int(116, 62, 0, 1);call write~init~int(116, 62, 1, 1);call write~init~int(121, 62, 2, 1);call write~init~int(71, 62, 3, 1);call write~init~int(85, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(12, 63);call #Ultimate.allocInit(47, 64);call #Ultimate.allocInit(54, 65);~LDV_IN_INTERRUPT~0 := 1;~gigaset_usb_driver_group1~0.base, ~gigaset_usb_driver_group1~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~ops_group1~0.base, ~ops_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ops_group0~0.base, ~ops_group0~0.offset := 0, 0;~startmode~0 := 1;~cidmode~0 := 1;~#gigaset_table~0.base, ~#gigaset_table~0.offset := 66, 0;call #Ultimate.allocInit(50, 66);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#gigaset_table~0.base);call write~unchecked~int(3, ~#gigaset_table~0.base, ~#gigaset_table~0.offset, 2);call write~unchecked~int(1665, ~#gigaset_table~0.base, 2 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(9, ~#gigaset_table~0.base, 4 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 6 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 8 + ~#gigaset_table~0.offset, 2);call write~unchecked~int(0, ~#gigaset_table~0.base, 10 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 11 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 12 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 13 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 14 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 15 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 16 + ~#gigaset_table~0.offset, 1);call write~unchecked~int(0, ~#gigaset_table~0.base, 17 + ~#gigaset_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~driver~0.base, ~driver~0.offset := 0, 0;~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset := 67, 0;call #Ultimate.allocInit(285, 67);call write~init~$Pointer$(3, 0, ~#gigaset_usb_driver~0.base, ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_probe.base, #funAddr~gigaset_probe.offset, ~#gigaset_usb_driver~0.base, 8 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_disconnect.base, #funAddr~gigaset_disconnect.offset, ~#gigaset_usb_driver~0.base, 16 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 24 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_suspend.base, #funAddr~gigaset_suspend.offset, ~#gigaset_usb_driver~0.base, 32 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 40 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 48 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_pre_reset.base, #funAddr~gigaset_pre_reset.offset, ~#gigaset_usb_driver~0.base, 56 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_resume.base, #funAddr~gigaset_resume.offset, ~#gigaset_usb_driver~0.base, 64 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(~#gigaset_table~0.base, ~#gigaset_table~0.offset, ~#gigaset_usb_driver~0.base, 72 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 80 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 84 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 88 + ~#gigaset_usb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 92 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 100 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 108 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 116 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 124 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 132 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 136 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 148 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 156 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 164 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 172 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 180 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 188 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 196 + ~#gigaset_usb_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 197 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 205 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 213 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 221 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 229 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 237 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 245 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 253 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 261 + ~#gigaset_usb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#gigaset_usb_driver~0.base, 269 + ~#gigaset_usb_driver~0.offset, 8);call write~init~int(0, ~#gigaset_usb_driver~0.base, 277 + ~#gigaset_usb_driver~0.offset, 4);call write~init~int(0, ~#gigaset_usb_driver~0.base, 281 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 282 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(1, ~#gigaset_usb_driver~0.base, 283 + ~#gigaset_usb_driver~0.offset, 1);call write~init~int(0, ~#gigaset_usb_driver~0.base, 284 + ~#gigaset_usb_driver~0.offset, 1);~#ops~0.base, ~#ops~0.offset := 68, 0;call #Ultimate.allocInit(128, 68);call write~init~$Pointer$(#funAddr~gigaset_write_cmd.base, #funAddr~gigaset_write_cmd.offset, ~#ops~0.base, ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_write_room.base, #funAddr~gigaset_write_room.offset, ~#ops~0.base, 8 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_chars_in_buffer.base, #funAddr~gigaset_chars_in_buffer.offset, ~#ops~0.base, 16 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_brkchars.base, #funAddr~gigaset_brkchars.offset, ~#ops~0.base, 24 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_init_bchannel.base, #funAddr~gigaset_init_bchannel.offset, ~#ops~0.base, 32 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_close_bchannel.base, #funAddr~gigaset_close_bchannel.offset, ~#ops~0.base, 40 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initbcshw.base, #funAddr~gigaset_initbcshw.offset, ~#ops~0.base, 48 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freebcshw.base, #funAddr~gigaset_freebcshw.offset, ~#ops~0.base, 56 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_reinitbcshw.base, #funAddr~gigaset_reinitbcshw.offset, ~#ops~0.base, 64 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_initcshw.base, #funAddr~gigaset_initcshw.offset, ~#ops~0.base, 72 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_freecshw.base, #funAddr~gigaset_freecshw.offset, ~#ops~0.base, 80 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_modem_ctrl.base, #funAddr~gigaset_set_modem_ctrl.offset, ~#ops~0.base, 88 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_baud_rate.base, #funAddr~gigaset_baud_rate.offset, ~#ops~0.base, 96 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_set_line_ctrl.base, #funAddr~gigaset_set_line_ctrl.offset, ~#ops~0.base, 104 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_send_skb.base, #funAddr~gigaset_m10x_send_skb.offset, ~#ops~0.base, 112 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~gigaset_m10x_input.base, #funAddr~gigaset_m10x_input.offset, ~#ops~0.base, 120 + ~#ops~0.offset, 8);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {56974#(= ~dev_counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset, main_#t~ret407#1.base, main_#t~ret407#1.offset, main_#t~nondet408#1, main_#t~nondet409#1, main_#t~ret410#1.base, main_#t~ret410#1.offset, main_#t~nondet411#1, main_#t~nondet412#1, main_#t~ret413#1.base, main_#t~ret413#1.offset, main_#t~ret414#1.base, main_#t~ret414#1.offset, main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset, main_#t~nondet416#1, main_#t~switch417#1, main_#t~nondet418#1, main_#t~switch419#1, main_#t~ret420#1, main_#t~ret421#1, main_#t~ret422#1, main_#t~ret423#1, main_#t~ret424#1, main_#t~ret425#1, main_#t~ret426#1, main_#t~ret427#1, main_#t~ret428#1, main_#t~ret429#1, main_#t~ret430#1, main_#t~ret431#1, main_#t~ret432#1, main_#t~ret433#1, main_#t~ret434#1, main_#t~ret435#1, main_#t~ret436#1, main_#t~ret437#1, main_#t~ret438#1, main_#t~ret439#1, main_#t~ret440#1, main_#t~ret441#1, main_#t~ret442#1, main_#t~ret443#1, main_#t~ret444#1, main_#t~nondet445#1, main_#t~switch446#1, main_#t~ret447#1, main_#t~nondet448#1, main_#t~switch449#1, main_#t~ret450#1, main_#t~ret451#1, main_#t~mem452#1, main_#t~ret453#1, main_#t~ret454#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset, main_~ldvarg0~0#1, main_~tmp___1~7#1, main_~ldvarg5~0#1, main_~tmp___2~7#1, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset, main_~ldvarg1~0#1, main_~tmp___4~4#1, main_~ldvarg4~0#1, main_~tmp___5~2#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset, main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~tmp___10~0#1, main_~tmp___11~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~7#1;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~4#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~2#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset;call main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~tmp___10~0#1;havoc main_~tmp___11~0#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,409 INFO L272 TraceCheckUtils]: 2: Hoare triple {56974#(= ~dev_counter~0 0)} call main_#t~ret406#1.base, main_#t~ret406#1.offset := ldv_zalloc(8216); {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:56,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,410 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1773#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {56974#(= ~dev_counter~0 0)} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret406#1.base, main_#t~ret406#1.offset;havoc main_#t~ret406#1.base, main_#t~ret406#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,411 INFO L272 TraceCheckUtils]: 8: Hoare triple {56974#(= ~dev_counter~0 0)} call main_#t~ret407#1.base, main_#t~ret407#1.offset := ldv_zalloc(240); {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:56,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,412 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1775#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {56974#(= ~dev_counter~0 0)} main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset := main_#t~ret407#1.base, main_#t~ret407#1.offset;havoc main_#t~ret407#1.base, main_#t~ret407#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~16#1.base, main_~tmp___0~16#1.offset;main_~tmp___1~7#1 := main_#t~nondet408#1;havoc main_#t~nondet408#1;main_~ldvarg0~0#1 := main_~tmp___1~7#1;main_~tmp___2~7#1 := main_#t~nondet409#1;havoc main_#t~nondet409#1;main_~ldvarg5~0#1 := main_~tmp___2~7#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,413 INFO L272 TraceCheckUtils]: 14: Hoare triple {56974#(= ~dev_counter~0 0)} call main_#t~ret410#1.base, main_#t~ret410#1.offset := ldv_zalloc(32); {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:56,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,414 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1777#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {56974#(= ~dev_counter~0 0)} main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset := main_#t~ret410#1.base, main_#t~ret410#1.offset;havoc main_#t~ret410#1.base, main_#t~ret410#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___3~5#1.base, main_~tmp___3~5#1.offset;main_~tmp___4~4#1 := main_#t~nondet411#1;havoc main_#t~nondet411#1;main_~ldvarg1~0#1 := main_~tmp___4~4#1;main_~tmp___5~2#1 := main_#t~nondet412#1;havoc main_#t~nondet412#1;main_~ldvarg4~0#1 := main_~tmp___5~2#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,415 INFO L272 TraceCheckUtils]: 20: Hoare triple {56974#(= ~dev_counter~0 0)} call main_#t~ret413#1.base, main_#t~ret413#1.offset := ldv_zalloc(1); {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:56,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,416 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1779#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {56974#(= ~dev_counter~0 0)} main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset := main_#t~ret413#1.base, main_#t~ret413#1.offset;havoc main_#t~ret413#1.base, main_#t~ret413#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___6~2#1.base, main_~tmp___6~2#1.offset; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,417 INFO L272 TraceCheckUtils]: 26: Hoare triple {56974#(= ~dev_counter~0 0)} call main_#t~ret414#1.base, main_#t~ret414#1.offset := ldv_zalloc(32); {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:56,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {56999#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet46#1 && #t~nondet46#1 <= 2147483647;~tmp___0~1#1 := #t~nondet46#1;havoc #t~nondet46#1; {56972#true} is VALID [2022-02-20 21:50:56,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {56972#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,418 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1781#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {56974#(= ~dev_counter~0 0)} main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset := main_#t~ret414#1.base, main_#t~ret414#1.offset;havoc main_#t~ret414#1.base, main_#t~ret414#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___7~2#1.base, main_~tmp___7~2#1.offset;assume { :begin_inline_ldv_initialize } true; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {56974#(= ~dev_counter~0 0)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset, 0, 4;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr496#1;#Ultimate.C_memset_#t~loopctr496#1 := 0; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {56974#(= ~dev_counter~0 0)} assume !(#Ultimate.C_memset_#t~loopctr496#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {56974#(= ~dev_counter~0 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res415#1.base, main_#t~memset~res415#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {56974#(= ~dev_counter~0 0)} assume -2147483648 <= main_#t~nondet416#1 && main_#t~nondet416#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet416#1;havoc main_#t~nondet416#1;main_#t~switch417#1 := 0 == main_~tmp___8~0#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {56974#(= ~dev_counter~0 0)} assume !main_#t~switch417#1;main_#t~switch417#1 := main_#t~switch417#1 || 1 == main_~tmp___8~0#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {56974#(= ~dev_counter~0 0)} assume main_#t~switch417#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {56974#(= ~dev_counter~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet445#1 && main_#t~nondet445#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet445#1;havoc main_#t~nondet445#1;main_#t~switch446#1 := 0 == main_~tmp___10~0#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {56974#(= ~dev_counter~0 0)} assume !main_#t~switch446#1;main_#t~switch446#1 := main_#t~switch446#1 || 1 == main_~tmp___10~0#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {56974#(= ~dev_counter~0 0)} assume main_#t~switch446#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {56974#(= ~dev_counter~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_usb_gigaset_init } true;havoc usb_gigaset_init_#res#1;havoc usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset, usb_gigaset_init_#t~ret397#1, usb_gigaset_init_#t~nondet398#1, usb_gigaset_init_#t~nondet399#1, usb_gigaset_init_~result~0#1;havoc usb_gigaset_init_~result~0#1;assume { :begin_inline_gigaset_initdriver } true;gigaset_initdriver_#in~arg0#1, gigaset_initdriver_#in~arg1#1, gigaset_initdriver_#in~arg2#1.base, gigaset_initdriver_#in~arg2#1.offset, gigaset_initdriver_#in~arg3#1.base, gigaset_initdriver_#in~arg3#1.offset, gigaset_initdriver_#in~arg4#1.base, gigaset_initdriver_#in~arg4#1.offset, gigaset_initdriver_#in~arg5#1.base, gigaset_initdriver_#in~arg5#1.offset := 8, 1, 61, 0, 62, 0, ~#ops~0.base, ~#ops~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset;havoc gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset, gigaset_initdriver_~arg0#1, gigaset_initdriver_~arg1#1, gigaset_initdriver_~arg2#1.base, gigaset_initdriver_~arg2#1.offset, gigaset_initdriver_~arg3#1.base, gigaset_initdriver_~arg3#1.offset, gigaset_initdriver_~arg4#1.base, gigaset_initdriver_~arg4#1.offset, gigaset_initdriver_~arg5#1.base, gigaset_initdriver_~arg5#1.offset;gigaset_initdriver_~arg0#1 := gigaset_initdriver_#in~arg0#1;gigaset_initdriver_~arg1#1 := gigaset_initdriver_#in~arg1#1;gigaset_initdriver_~arg2#1.base, gigaset_initdriver_~arg2#1.offset := gigaset_initdriver_#in~arg2#1.base, gigaset_initdriver_#in~arg2#1.offset;gigaset_initdriver_~arg3#1.base, gigaset_initdriver_~arg3#1.offset := gigaset_initdriver_#in~arg3#1.base, gigaset_initdriver_#in~arg3#1.offset;gigaset_initdriver_~arg4#1.base, gigaset_initdriver_~arg4#1.offset := gigaset_initdriver_#in~arg4#1.base, gigaset_initdriver_#in~arg4#1.offset;gigaset_initdriver_~arg5#1.base, gigaset_initdriver_~arg5#1.offset := gigaset_initdriver_#in~arg5#1.base, gigaset_initdriver_#in~arg5#1.offset; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,423 INFO L272 TraceCheckUtils]: 42: Hoare triple {56974#(= ~dev_counter~0 0)} call gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset := ldv_malloc(132); {57000#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:50:56,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {57000#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~tmp___0~0 := #t~nondet44;havoc #t~nondet44; {56972#true} is VALID [2022-02-20 21:50:56,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {56972#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {56972#true} is VALID [2022-02-20 21:50:56,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {56972#true} assume true; {56972#true} is VALID [2022-02-20 21:50:56,424 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {56972#true} {56974#(= ~dev_counter~0 0)} #1863#return; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {56974#(= ~dev_counter~0 0)} gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset := gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset;havoc gigaset_initdriver_#t~ret483#1.base, gigaset_initdriver_#t~ret483#1.offset; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {56974#(= ~dev_counter~0 0)} usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset := gigaset_initdriver_#res#1.base, gigaset_initdriver_#res#1.offset;assume { :end_inline_gigaset_initdriver } true;~driver~0.base, ~driver~0.offset := usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset;havoc usb_gigaset_init_#t~ret396#1.base, usb_gigaset_init_#t~ret396#1.offset; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {56974#(= ~dev_counter~0 0)} assume 0 == (~driver~0.base + ~driver~0.offset) % 18446744073709551616;usb_gigaset_init_~result~0#1 := -12; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {56974#(= ~dev_counter~0 0)} assume !(0 != (~driver~0.base + ~driver~0.offset) % 18446744073709551616); {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {56974#(= ~dev_counter~0 0)} ~driver~0.base, ~driver~0.offset := 0, 0;usb_gigaset_init_#res#1 := usb_gigaset_init_~result~0#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {56974#(= ~dev_counter~0 0)} main_#t~ret447#1 := usb_gigaset_init_#res#1;assume { :end_inline_usb_gigaset_init } true;assume -2147483648 <= main_#t~ret447#1 && main_#t~ret447#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret447#1;havoc main_#t~ret447#1; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {56974#(= ~dev_counter~0 0)} assume !(0 == ~ldv_retval_0~0); {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {56974#(= ~dev_counter~0 0)} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {56974#(= ~dev_counter~0 0)} assume { :begin_inline_ldv_check_final_state } true; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {56974#(= ~dev_counter~0 0)} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,433 INFO L290 TraceCheckUtils]: 57: Hoare triple {56974#(= ~dev_counter~0 0)} assume 0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {56974#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:50:56,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {56974#(= ~dev_counter~0 0)} assume !(0 == ~dev_counter~0); {56973#false} is VALID [2022-02-20 21:50:56,433 INFO L272 TraceCheckUtils]: 59: Hoare triple {56973#false} call ldv_error(); {56973#false} is VALID [2022-02-20 21:50:56,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {56973#false} assume !false; {56973#false} is VALID [2022-02-20 21:50:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:50:56,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:50:56,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559683422] [2022-02-20 21:50:56,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559683422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:50:56,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:50:56,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:50:56,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258910398] [2022-02-20 21:50:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:50:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-02-20 21:50:56,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:50:56,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 21:50:56,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:50:56,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:50:56,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:50:56,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:50:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:50:56,493 INFO L87 Difference]: Start difference. First operand 5639 states and 8025 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)