./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.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.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.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 23b299466df567728bd01cdd7606fd8853010375cabd6f3e05e43d9cfc96a45f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:58:45,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:58:45,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:58:45,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:58:45,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:58:45,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:58:45,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:58:45,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:58:45,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:58:45,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:58:45,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:58:45,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:58:45,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:58:45,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:58:45,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:58:45,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:58:45,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:58:45,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:58:45,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:58:45,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:58:45,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:58:45,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:58:45,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:58:45,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:58:45,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:58:45,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:58:45,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:58:45,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:58:45,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:58:45,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:58:45,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:58:45,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:58:45,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:58:45,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:58:45,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:58:45,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:58:45,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:58:45,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:58:45,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:58:45,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:58:45,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:58:45,951 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:58:45,980 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:58:45,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:58:45,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:58:45,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:58:45,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:58:45,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:58:45,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:58:45,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:58:45,983 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:58:45,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:58:45,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:58:45,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:58:45,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:58:45,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:58:45,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:58:45,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:58:45,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:58:45,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:58:45,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:58:45,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:58:45,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:58:45,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:58:45,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:58:45,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:58:45,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:58:45,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:58:45,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:58:45,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:58:45,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:58:45,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:58:45,989 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 -> 23b299466df567728bd01cdd7606fd8853010375cabd6f3e05e43d9cfc96a45f [2022-02-20 21:58:46,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:58:46,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:58:46,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:58:46,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:58:46,255 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:58:46,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.ko-entry_point.cil.out.i [2022-02-20 21:58:46,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cb818b2/ffceec9e928c4131b3ebed04c8b5d301/FLAG2448b0eff [2022-02-20 21:58:46,864 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:58:46,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.ko-entry_point.cil.out.i [2022-02-20 21:58:46,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cb818b2/ffceec9e928c4131b3ebed04c8b5d301/FLAG2448b0eff [2022-02-20 21:58:47,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cb818b2/ffceec9e928c4131b3ebed04c8b5d301 [2022-02-20 21:58:47,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:58:47,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:58:47,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:58:47,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:58:47,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:58:47,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:47,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b29ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47, skipping insertion in model container [2022-02-20 21:58:47,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:47,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:58:47,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:58:47,501 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2395] [2022-02-20 21:58:47,502 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2396-2397] [2022-02-20 21:58:47,581 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.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.ko-entry_point.cil.out.i[74571,74584] [2022-02-20 21:58:47,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:58:47,743 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:58:47,841 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2395] [2022-02-20 21:58:47,844 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2396-2397] [2022-02-20 21:58:47,855 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.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.ko-entry_point.cil.out.i[74571,74584] [2022-02-20 21:58:47,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:58:47,928 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:58:47,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47 WrapperNode [2022-02-20 21:58:47,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:58:47,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:58:47,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:58:47,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:58:47,937 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:58:47" (1/1) ... [2022-02-20 21:58:47,966 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:58:47" (1/1) ... [2022-02-20 21:58:48,020 INFO L137 Inliner]: procedures = 76, calls = 196, calls flagged for inlining = 30, calls inlined = 26, statements flattened = 526 [2022-02-20 21:58:48,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:58:48,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:58:48,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:58:48,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:58:48,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:58:48,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:58:48,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:58:48,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:58:48,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (1/1) ... [2022-02-20 21:58:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:58:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:58:48,095 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:58:48,121 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:58:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:58:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_request [2022-02-20 21:58:48,144 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_request [2022-02-20 21:58:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:58:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:58:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:58:48,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:58:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:58:48,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:58:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:58:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-02-20 21:58:48,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-02-20 21:58:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:58:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_stop [2022-02-20 21:58:48,146 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_stop [2022-02-20 21:58:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure ax_remove [2022-02-20 21:58:48,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ax_remove [2022-02-20 21:58:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:58:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:58:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure hid_hw_close [2022-02-20 21:58:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_hw_close [2022-02-20 21:58:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:58:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:58:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:58:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:58:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:58:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:58:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:58:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:58:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:58:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:58:48,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:58:48,369 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:58:48,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:58:48,457 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:58:48,988 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:58:48,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:58:48,996 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:58:48,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:58:48 BoogieIcfgContainer [2022-02-20 21:58:48,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:58:48,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:58:49,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:58:49,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:58:49,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:58:47" (1/3) ... [2022-02-20 21:58:49,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5496982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:58:49, skipping insertion in model container [2022-02-20 21:58:49,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:58:47" (2/3) ... [2022-02-20 21:58:49,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5496982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:58:49, skipping insertion in model container [2022-02-20 21:58:49,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:58:48" (3/3) ... [2022-02-20 21:58:49,005 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--hid--hid-axff.ko-entry_point.cil.out.i [2022-02-20 21:58:49,009 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:58:49,009 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:58:49,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:58:49,050 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:58:49,054 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:58:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 112 states have internal predecessors, (144), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 21:58:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 21:58:49,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:49,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,081 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 945939342, now seen corresponding path program 1 times [2022-02-20 21:58:49,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:49,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072992107] [2022-02-20 21:58:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:49,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet11#1 && #t~nondet11#1 <= 2147483647;~tmp___0~1#1 := #t~nondet11#1;havoc #t~nondet11#1; {139#true} is VALID [2022-02-20 21:58:49,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {139#true} is VALID [2022-02-20 21:58:49,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-02-20 21:58:49,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #331#return; {139#true} is VALID [2022-02-20 21:58:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:58:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:49,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#true} #~57.base, #~57.offset := #in~57.base, #in~57.offset; {139#true} is VALID [2022-02-20 21:58:49,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2022-02-20 21:58:49,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139#true} {140#false} #333#return; {140#false} is VALID [2022-02-20 21:58:49,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#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(94, 2);call #Ultimate.allocInit(31, 3);call #Ultimate.allocInit(212, 4);call #Ultimate.allocInit(32, 5);call #Ultimate.allocInit(212, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(37, 8);call #Ultimate.allocInit(77, 9);call #Ultimate.allocInit(9, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(212, 12);call #Ultimate.allocInit(29, 13);call #Ultimate.allocInit(29, 14);call #Ultimate.allocInit(14, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(52, 17);call #Ultimate.allocInit(16, 18);call #Ultimate.allocInit(6, 19);call write~init~int(97, 19, 0, 1);call write~init~int(99, 19, 1, 1);call write~init~int(114, 19, 2, 1);call write~init~int(117, 19, 3, 1);call write~init~int(120, 19, 4, 1);call write~init~int(0, 19, 5, 1);call #Ultimate.allocInit(9, 20);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~ax_driver_group0~0.base, ~ax_driver_group0~0.offset := 0, 0;~#ax_devices~0.base, ~#ax_devices~0.offset := 21, 0;call #Ultimate.allocInit(60, 21);call write~init~int(3, ~#ax_devices~0.base, ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 2 + ~#ax_devices~0.offset, 2);call write~init~int(6708, ~#ax_devices~0.base, 4 + ~#ax_devices~0.offset, 4);call write~init~int(2050, ~#ax_devices~0.base, 8 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 12 + ~#ax_devices~0.offset, 8);call write~init~int(3, ~#ax_devices~0.base, 20 + ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 22 + ~#ax_devices~0.offset, 2);call write~init~int(6708, ~#ax_devices~0.base, 24 + ~#ax_devices~0.offset, 4);call write~init~int(63237, ~#ax_devices~0.base, 28 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 32 + ~#ax_devices~0.offset, 8);call write~init~int(0, ~#ax_devices~0.base, 40 + ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 42 + ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 44 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 48 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 52 + ~#ax_devices~0.offset, 8);~__mod_hid__ax_devices_device_table~0.bus := 0;~__mod_hid__ax_devices_device_table~0.group := 0;~__mod_hid__ax_devices_device_table~0.vendor := 0;~__mod_hid__ax_devices_device_table~0.product := 0;~__mod_hid__ax_devices_device_table~0.driver_data := 0;~#ax_driver~0.base, ~#ax_driver~0.offset := 22, 0;call #Ultimate.allocInit(333, 22);call write~init~$Pointer$(19, 0, ~#ax_driver~0.base, ~#ax_driver~0.offset, 8);call write~init~$Pointer$(~#ax_devices~0.base, ~#ax_devices~0.offset, ~#ax_driver~0.base, 8 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 16 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 24 + ~#ax_driver~0.offset, 8);call write~init~int(0, ~#ax_driver~0.base, 32 + ~#ax_driver~0.offset, 4);call write~init~int(0, ~#ax_driver~0.base, 36 + ~#ax_driver~0.offset, 4);call write~init~int(0, ~#ax_driver~0.base, 40 + ~#ax_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 44 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 52 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 60 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 68 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 76 + ~#ax_driver~0.offset, 8);call write~init~int(0, ~#ax_driver~0.base, 84 + ~#ax_driver~0.offset, 4);call write~init~int(0, ~#ax_driver~0.base, 88 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ax_probe.base, #funAddr~ax_probe.offset, ~#ax_driver~0.base, 100 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ax_remove.base, #funAddr~ax_remove.offset, ~#ax_driver~0.base, 108 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 116 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 124 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 132 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 140 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 148 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 156 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 164 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 172 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 180 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 188 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 196 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 204 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 212 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 220 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 228 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 236 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 244 + ~#ax_driver~0.offset, 8);call write~init~int(0, ~#ax_driver~0.base, 252 + ~#ax_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 253 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 261 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 269 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 277 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 285 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 293 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 301 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 309 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 317 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 325 + ~#ax_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {139#true} is VALID [2022-02-20 21:58:49,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret111#1.base, main_#t~ret111#1.offset, main_#t~nondet112#1, main_#t~switch113#1, main_#t~nondet114#1, main_#t~switch115#1, main_#t~ret116#1, main_#t~nondet117#1, main_#t~switch118#1, main_#t~ret119#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~tmp___0~3#1, main_~tmp___1~0#1, main_~tmp___2~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~tmp___0~3#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1; {139#true} is VALID [2022-02-20 21:58:49,455 INFO L272 TraceCheckUtils]: 2: Hoare triple {139#true} call main_#t~ret111#1.base, main_#t~ret111#1.offset := ldv_zalloc(24); {149#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:49,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet11#1 && #t~nondet11#1 <= 2147483647;~tmp___0~1#1 := #t~nondet11#1;havoc #t~nondet11#1; {139#true} is VALID [2022-02-20 21:58:49,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {139#true} is VALID [2022-02-20 21:58:49,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} assume true; {139#true} is VALID [2022-02-20 21:58:49,456 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {139#true} {139#true} #331#return; {139#true} is VALID [2022-02-20 21:58:49,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret111#1.base, main_#t~ret111#1.offset;havoc main_#t~ret111#1.base, main_#t~ret111#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset;assume { :begin_inline_ldv_initialize } true; {139#true} is VALID [2022-02-20 21:58:49,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {145#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:58:49,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet112#1 && main_#t~nondet112#1 <= 2147483647;main_~tmp___0~3#1 := main_#t~nondet112#1;havoc main_#t~nondet112#1;main_#t~switch113#1 := 0 == main_~tmp___0~3#1; {145#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:58:49,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {145#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch113#1; {145#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:58:49,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {145#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet114#1 && main_#t~nondet114#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet114#1;havoc main_#t~nondet114#1;main_#t~switch115#1 := 0 == main_~tmp___1~0#1; {140#false} is VALID [2022-02-20 21:58:49,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#false} assume main_#t~switch115#1; {140#false} is VALID [2022-02-20 21:58:49,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_ax_probe } true;ax_probe_#in~hdev#1.base, ax_probe_#in~hdev#1.offset, ax_probe_#in~id#1.base, ax_probe_#in~id#1.offset := ~ax_driver_group0~0.base, ~ax_driver_group0~0.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc ax_probe_#res#1;havoc ax_probe_#t~mem98#1, ax_probe_#t~ret99#1, ax_probe_#t~nondet100#1, ax_probe_#t~ret101#1, ax_probe_#t~nondet102#1, ax_probe_#t~ret103#1, ax_probe_#t~nondet104#1, ax_probe_#t~ret105#1, ax_probe_#t~nondet106#1, ax_probe_#t~ret107#1, ax_probe_#t~nondet108#1, ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset, ax_probe_~id#1.base, ax_probe_~id#1.offset, ax_probe_~error~1#1, ax_probe_~#descriptor~0#1.base, ax_probe_~#descriptor~0#1.offset, ax_probe_~tmp~10#1;ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset := ax_probe_#in~hdev#1.base, ax_probe_#in~hdev#1.offset;ax_probe_~id#1.base, ax_probe_~id#1.offset := ax_probe_#in~id#1.base, ax_probe_#in~id#1.offset;havoc ax_probe_~error~1#1;call ax_probe_~#descriptor~0#1.base, ax_probe_~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ax_probe_~tmp~10#1;call write~$Pointer$(10, 0, ax_probe_~#descriptor~0#1.base, ax_probe_~#descriptor~0#1.offset, 8);call write~$Pointer$(11, 0, ax_probe_~#descriptor~0#1.base, 8 + ax_probe_~#descriptor~0#1.offset, 8);call write~$Pointer$(12, 0, ax_probe_~#descriptor~0#1.base, 16 + ax_probe_~#descriptor~0#1.offset, 8);call write~$Pointer$(13, 0, ax_probe_~#descriptor~0#1.base, 24 + ax_probe_~#descriptor~0#1.offset, 8);call write~int(162, ax_probe_~#descriptor~0#1.base, 32 + ax_probe_~#descriptor~0#1.offset, 4);call write~int(0, ax_probe_~#descriptor~0#1.base, 36 + ax_probe_~#descriptor~0#1.offset, 1);call ax_probe_#t~mem98#1 := read~int(ax_probe_~#descriptor~0#1.base, 36 + ax_probe_~#descriptor~0#1.offset, 1);assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ax_probe_#t~mem98#1 % 256, 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; {140#false} is VALID [2022-02-20 21:58:49,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {140#false} ax_probe_#t~ret99#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= ax_probe_#t~ret99#1 && ax_probe_#t~ret99#1 <= 9223372036854775807;ax_probe_~tmp~10#1 := ax_probe_#t~ret99#1;havoc ax_probe_#t~mem98#1;havoc ax_probe_#t~ret99#1; {140#false} is VALID [2022-02-20 21:58:49,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {140#false} assume 0 != ax_probe_~tmp~10#1;havoc ax_probe_#t~nondet100#1; {140#false} is VALID [2022-02-20 21:58:49,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {140#false} assume { :begin_inline_hid_parse } true;hid_parse_#in~hdev#1.base, hid_parse_#in~hdev#1.offset := ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset;havoc hid_parse_#res#1;havoc hid_parse_#t~ret37#1, hid_parse_~hdev#1.base, hid_parse_~hdev#1.offset, hid_parse_~tmp~5#1;hid_parse_~hdev#1.base, hid_parse_~hdev#1.offset := hid_parse_#in~hdev#1.base, hid_parse_#in~hdev#1.offset;havoc hid_parse_~tmp~5#1;assume { :begin_inline_hid_open_report } true;hid_open_report_#in~arg0#1.base, hid_open_report_#in~arg0#1.offset := hid_parse_~hdev#1.base, hid_parse_~hdev#1.offset;havoc hid_open_report_#res#1;havoc hid_open_report_#t~nondet128#1, hid_open_report_~arg0#1.base, hid_open_report_~arg0#1.offset;hid_open_report_~arg0#1.base, hid_open_report_~arg0#1.offset := hid_open_report_#in~arg0#1.base, hid_open_report_#in~arg0#1.offset;assume -2147483648 <= hid_open_report_#t~nondet128#1 && hid_open_report_#t~nondet128#1 <= 2147483647;hid_open_report_#res#1 := hid_open_report_#t~nondet128#1;havoc hid_open_report_#t~nondet128#1; {140#false} is VALID [2022-02-20 21:58:49,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {140#false} hid_parse_#t~ret37#1 := hid_open_report_#res#1;assume { :end_inline_hid_open_report } true;assume -2147483648 <= hid_parse_#t~ret37#1 && hid_parse_#t~ret37#1 <= 2147483647;hid_parse_~tmp~5#1 := hid_parse_#t~ret37#1;havoc hid_parse_#t~ret37#1;hid_parse_#res#1 := hid_parse_~tmp~5#1; {140#false} is VALID [2022-02-20 21:58:49,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {140#false} ax_probe_#t~ret101#1 := hid_parse_#res#1;assume { :end_inline_hid_parse } true;assume -2147483648 <= ax_probe_#t~ret101#1 && ax_probe_#t~ret101#1 <= 2147483647;ax_probe_~error~1#1 := ax_probe_#t~ret101#1;havoc ax_probe_#t~ret101#1; {140#false} is VALID [2022-02-20 21:58:49,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {140#false} assume !(0 != ax_probe_~error~1#1);assume { :begin_inline_hid_hw_start } true;hid_hw_start_#in~hdev#1.base, hid_hw_start_#in~hdev#1.offset, hid_hw_start_#in~connect_mask#1 := ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset, 13;havoc hid_hw_start_#res#1;havoc hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset, hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset, hid_hw_start_#t~ret43#1, hid_hw_start_#t~ret44#1, hid_hw_start_#t~mem48#1.base, hid_hw_start_#t~mem48#1.offset, hid_hw_start_#t~mem49#1.base, hid_hw_start_#t~mem49#1.offset, hid_hw_start_~hdev#1.base, hid_hw_start_~hdev#1.offset, hid_hw_start_~connect_mask#1, hid_hw_start_~ret~0#1, hid_hw_start_~tmp~6#1;hid_hw_start_~hdev#1.base, hid_hw_start_~hdev#1.offset := hid_hw_start_#in~hdev#1.base, hid_hw_start_#in~hdev#1.offset;hid_hw_start_~connect_mask#1 := hid_hw_start_#in~connect_mask#1;havoc hid_hw_start_~ret~0#1;havoc hid_hw_start_~tmp~6#1;call hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset := read~$Pointer$(hid_hw_start_~hdev#1.base, 7869 + hid_hw_start_~hdev#1.offset, 8);call hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset := read~$Pointer$(hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset, 8); {140#false} is VALID [2022-02-20 21:58:49,461 INFO L272 TraceCheckUtils]: 20: Hoare triple {140#false} call hid_hw_start_#t~ret43#1 := ##fun~$Pointer$~TO~int(hid_hw_start_~hdev#1.base, hid_hw_start_~hdev#1.offset, hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset); {139#true} is VALID [2022-02-20 21:58:49,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {139#true} #~57.base, #~57.offset := #in~57.base, #in~57.offset; {139#true} is VALID [2022-02-20 21:58:49,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {139#true} assume true; {139#true} is VALID [2022-02-20 21:58:49,462 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {139#true} {140#false} #333#return; {140#false} is VALID [2022-02-20 21:58:49,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {140#false} assume -2147483648 <= hid_hw_start_#t~ret43#1 && hid_hw_start_#t~ret43#1 <= 2147483647;hid_hw_start_~tmp~6#1 := hid_hw_start_#t~ret43#1;havoc hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset;havoc hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset;havoc hid_hw_start_#t~ret43#1;hid_hw_start_~ret~0#1 := hid_hw_start_~tmp~6#1; {140#false} is VALID [2022-02-20 21:58:49,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {140#false} assume 0 != hid_hw_start_~ret~0#1 || 0 == hid_hw_start_~connect_mask#1 % 4294967296;hid_hw_start_#res#1 := hid_hw_start_~ret~0#1; {140#false} is VALID [2022-02-20 21:58:49,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {140#false} ax_probe_#t~ret103#1 := hid_hw_start_#res#1;assume { :end_inline_hid_hw_start } true;assume -2147483648 <= ax_probe_#t~ret103#1 && ax_probe_#t~ret103#1 <= 2147483647;ax_probe_~error~1#1 := ax_probe_#t~ret103#1;havoc ax_probe_#t~ret103#1; {140#false} is VALID [2022-02-20 21:58:49,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {140#false} assume !(0 != ax_probe_~error~1#1);assume { :begin_inline_axff_init } true;axff_init_#in~hid#1.base, axff_init_#in~hid#1.offset := ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset;havoc axff_init_#res#1;havoc axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset, axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset, axff_init_#t~ret83#1, axff_init_#t~nondet84#1, axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset, axff_init_#t~mem86#1.base, axff_init_#t~mem86#1.offset, axff_init_#t~mem87#1.base, axff_init_#t~mem87#1.offset, axff_init_#t~mem88#1.base, axff_init_#t~mem88#1.offset, axff_init_#t~mem89#1, axff_init_#t~mem90#1, axff_init_#t~mem91#1, axff_init_#t~short92#1, axff_init_#t~nondet93#1, axff_init_#t~ret94#1.base, axff_init_#t~ret94#1.offset, axff_init_#t~ret95#1, axff_init_#t~mem96#1.base, axff_init_#t~mem96#1.offset, axff_init_#t~nondet97#1, axff_init_~hid#1.base, axff_init_~hid#1.offset, axff_init_~axff~1#1.base, axff_init_~axff~1#1.offset, axff_init_~report~1#1.base, axff_init_~report~1#1.offset, axff_init_~hidinput~0#1.base, axff_init_~hidinput~0#1.offset, axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset, axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset, axff_init_~dev~0#1.base, axff_init_~dev~0#1.offset, axff_init_~field_count~1#1, axff_init_~i~1#1, axff_init_~j~1#1, axff_init_~error~0#1, axff_init_~tmp~9#1, axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset, axff_init_~tmp___0~2#1.base, axff_init_~tmp___0~2#1.offset;axff_init_~hid#1.base, axff_init_~hid#1.offset := axff_init_#in~hid#1.base, axff_init_#in~hid#1.offset;havoc axff_init_~axff~1#1.base, axff_init_~axff~1#1.offset;havoc axff_init_~report~1#1.base, axff_init_~report~1#1.offset;havoc axff_init_~hidinput~0#1.base, axff_init_~hidinput~0#1.offset;havoc axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset;havoc axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset;havoc axff_init_~dev~0#1.base, axff_init_~dev~0#1.offset;havoc axff_init_~field_count~1#1;havoc axff_init_~i~1#1;havoc axff_init_~j~1#1;havoc axff_init_~error~0#1;havoc axff_init_~tmp~9#1;havoc axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset;havoc axff_init_~tmp___0~2#1.base, axff_init_~tmp___0~2#1.offset;call axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset := read~$Pointer$(axff_init_~hid#1.base, 7890 + axff_init_~hid#1.offset, 8);axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset := axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset;havoc axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset;axff_init_~hidinput~0#1.base, axff_init_~hidinput~0#1.offset := axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset;axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset := axff_init_~hid#1.base, 2140 + axff_init_~hid#1.offset;call axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset := read~$Pointer$(axff_init_~hidinput~0#1.base, 24 + axff_init_~hidinput~0#1.offset, 8);axff_init_~dev~0#1.base, axff_init_~dev~0#1.offset := axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset;havoc axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset;axff_init_~field_count~1#1 := 0;assume { :begin_inline_list_empty } true;list_empty_#in~head#1.base, list_empty_#in~head#1.offset := axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset;havoc list_empty_#res#1;havoc list_empty_#t~mem5#1.base, list_empty_#t~mem5#1.offset, list_empty_~head#1.base, list_empty_~head#1.offset;list_empty_~head#1.base, list_empty_~head#1.offset := list_empty_#in~head#1.base, list_empty_#in~head#1.offset;call list_empty_#t~mem5#1.base, list_empty_#t~mem5#1.offset := read~$Pointer$(list_empty_~head#1.base, list_empty_~head#1.offset, 8);list_empty_#res#1 := (if (list_empty_#t~mem5#1.base + list_empty_#t~mem5#1.offset) % 18446744073709551616 == (list_empty_~head#1.base + list_empty_~head#1.offset) % 18446744073709551616 then 1 else 0);havoc list_empty_#t~mem5#1.base, list_empty_#t~mem5#1.offset; {140#false} is VALID [2022-02-20 21:58:49,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {140#false} axff_init_#t~ret83#1 := list_empty_#res#1;assume { :end_inline_list_empty } true;assume -2147483648 <= axff_init_#t~ret83#1 && axff_init_#t~ret83#1 <= 2147483647;axff_init_~tmp~9#1 := axff_init_#t~ret83#1;havoc axff_init_#t~ret83#1; {140#false} is VALID [2022-02-20 21:58:49,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {140#false} assume !(0 != axff_init_~tmp~9#1);call axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset := read~$Pointer$(axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset, 8);axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset := axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset;havoc axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset;axff_init_~report~1#1.base, axff_init_~report~1#1.offset := axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset;axff_init_~i~1#1 := 0; {140#false} is VALID [2022-02-20 21:58:49,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {140#false} call axff_init_#t~mem90#1 := read~int(axff_init_~report~1#1.base, 2072 + axff_init_~report~1#1.offset, 4); {140#false} is VALID [2022-02-20 21:58:49,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {140#false} assume !(axff_init_~i~1#1 % 4294967296 < axff_init_#t~mem90#1 % 4294967296);havoc axff_init_#t~mem90#1;axff_init_#t~short92#1 := axff_init_~field_count~1#1 <= 3; {140#false} is VALID [2022-02-20 21:58:49,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {140#false} assume axff_init_#t~short92#1;call axff_init_#t~mem91#1 := read~int(axff_init_~hid#1.base, 52 + axff_init_~hid#1.offset, 4);axff_init_#t~short92#1 := 63237 != axff_init_#t~mem91#1 % 4294967296; {140#false} is VALID [2022-02-20 21:58:49,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {140#false} assume !axff_init_#t~short92#1;havoc axff_init_#t~mem91#1;havoc axff_init_#t~short92#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_~size#1, kzalloc_~flags#1;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := kzalloc_~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {140#false} is VALID [2022-02-20 21:58:49,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {140#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296); {140#false} is VALID [2022-02-20 21:58:49,465 INFO L272 TraceCheckUtils]: 35: Hoare triple {140#false} call ldv_error(); {140#false} is VALID [2022-02-20 21:58:49,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-02-20 21:58:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:58:49,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:49,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072992107] [2022-02-20 21:58:49,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072992107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:49,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:49,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:58:49,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222097635] [2022-02-20 21:58:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-02-20 21:58:49,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:49,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:58:49,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:49,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:58:49,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:58:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:58:49,565 INFO L87 Difference]: Start difference. First operand has 136 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 112 states have internal predecessors, (144), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:58:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:50,183 INFO L93 Difference]: Finished difference Result 281 states and 371 transitions. [2022-02-20 21:58:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:58:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-02-20 21:58:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:58:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-02-20 21:58:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:58:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-02-20 21:58:50,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-02-20 21:58:50,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:50,588 INFO L225 Difference]: With dead ends: 281 [2022-02-20 21:58:50,588 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 21:58:50,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:58:50,594 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 75 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:50,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 369 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:58:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 21:58:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-02-20 21:58:50,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:50,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 125 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 21:58:50,635 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 125 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 21:58:50,636 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 125 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 21:58:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:50,652 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2022-02-20 21:58:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 164 transitions. [2022-02-20 21:58:50,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:50,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:50,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 129 states. [2022-02-20 21:58:50,659 INFO L87 Difference]: Start difference. First operand has 125 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 129 states. [2022-02-20 21:58:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:50,671 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2022-02-20 21:58:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 164 transitions. [2022-02-20 21:58:50,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:50,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:50,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:50,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 21:58:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2022-02-20 21:58:50,683 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 37 [2022-02-20 21:58:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:50,684 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2022-02-20 21:58:50,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 21:58:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2022-02-20 21:58:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 21:58:50,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:58:50,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:58:50,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:58:50,690 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:58:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:58:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash 808416082, now seen corresponding path program 1 times [2022-02-20 21:58:50,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:58:50,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560175375] [2022-02-20 21:58:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:58:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:58:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:50,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:58:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:50,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet11#1 && #t~nondet11#1 <= 2147483647;~tmp___0~1#1 := #t~nondet11#1;havoc #t~nondet11#1; {988#true} is VALID [2022-02-20 21:58:50,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {988#true} is VALID [2022-02-20 21:58:50,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {988#true} assume true; {988#true} is VALID [2022-02-20 21:58:50,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {988#true} {990#(= ~ldv_spin~0 0)} #331#return; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 21:58:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:50,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet11#1 && #t~nondet11#1 <= 2147483647;~tmp___0~1#1 := #t~nondet11#1;havoc #t~nondet11#1; {988#true} is VALID [2022-02-20 21:58:50,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {988#true} is VALID [2022-02-20 21:58:50,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {988#true} assume true; {988#true} is VALID [2022-02-20 21:58:50,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {988#true} {990#(= ~ldv_spin~0 0)} #349#return; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:58:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:58:50,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {988#true} #~57.base, #~57.offset := #in~57.base, #in~57.offset; {988#true} is VALID [2022-02-20 21:58:50,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#true} assume true; {988#true} is VALID [2022-02-20 21:58:50,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {988#true} {990#(= ~ldv_spin~0 0)} #333#return; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {988#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(94, 2);call #Ultimate.allocInit(31, 3);call #Ultimate.allocInit(212, 4);call #Ultimate.allocInit(32, 5);call #Ultimate.allocInit(212, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(37, 8);call #Ultimate.allocInit(77, 9);call #Ultimate.allocInit(9, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(212, 12);call #Ultimate.allocInit(29, 13);call #Ultimate.allocInit(29, 14);call #Ultimate.allocInit(14, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(52, 17);call #Ultimate.allocInit(16, 18);call #Ultimate.allocInit(6, 19);call write~init~int(97, 19, 0, 1);call write~init~int(99, 19, 1, 1);call write~init~int(114, 19, 2, 1);call write~init~int(117, 19, 3, 1);call write~init~int(120, 19, 4, 1);call write~init~int(0, 19, 5, 1);call #Ultimate.allocInit(9, 20);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~ax_driver_group0~0.base, ~ax_driver_group0~0.offset := 0, 0;~#ax_devices~0.base, ~#ax_devices~0.offset := 21, 0;call #Ultimate.allocInit(60, 21);call write~init~int(3, ~#ax_devices~0.base, ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 2 + ~#ax_devices~0.offset, 2);call write~init~int(6708, ~#ax_devices~0.base, 4 + ~#ax_devices~0.offset, 4);call write~init~int(2050, ~#ax_devices~0.base, 8 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 12 + ~#ax_devices~0.offset, 8);call write~init~int(3, ~#ax_devices~0.base, 20 + ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 22 + ~#ax_devices~0.offset, 2);call write~init~int(6708, ~#ax_devices~0.base, 24 + ~#ax_devices~0.offset, 4);call write~init~int(63237, ~#ax_devices~0.base, 28 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 32 + ~#ax_devices~0.offset, 8);call write~init~int(0, ~#ax_devices~0.base, 40 + ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 42 + ~#ax_devices~0.offset, 2);call write~init~int(0, ~#ax_devices~0.base, 44 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 48 + ~#ax_devices~0.offset, 4);call write~init~int(0, ~#ax_devices~0.base, 52 + ~#ax_devices~0.offset, 8);~__mod_hid__ax_devices_device_table~0.bus := 0;~__mod_hid__ax_devices_device_table~0.group := 0;~__mod_hid__ax_devices_device_table~0.vendor := 0;~__mod_hid__ax_devices_device_table~0.product := 0;~__mod_hid__ax_devices_device_table~0.driver_data := 0;~#ax_driver~0.base, ~#ax_driver~0.offset := 22, 0;call #Ultimate.allocInit(333, 22);call write~init~$Pointer$(19, 0, ~#ax_driver~0.base, ~#ax_driver~0.offset, 8);call write~init~$Pointer$(~#ax_devices~0.base, ~#ax_devices~0.offset, ~#ax_driver~0.base, 8 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 16 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 24 + ~#ax_driver~0.offset, 8);call write~init~int(0, ~#ax_driver~0.base, 32 + ~#ax_driver~0.offset, 4);call write~init~int(0, ~#ax_driver~0.base, 36 + ~#ax_driver~0.offset, 4);call write~init~int(0, ~#ax_driver~0.base, 40 + ~#ax_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 44 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 52 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 60 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 68 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 76 + ~#ax_driver~0.offset, 8);call write~init~int(0, ~#ax_driver~0.base, 84 + ~#ax_driver~0.offset, 4);call write~init~int(0, ~#ax_driver~0.base, 88 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ax_probe.base, #funAddr~ax_probe.offset, ~#ax_driver~0.base, 100 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~ax_remove.base, #funAddr~ax_remove.offset, ~#ax_driver~0.base, 108 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 116 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 124 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 132 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 140 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 148 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 156 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 164 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 172 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 180 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 188 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 196 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 204 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 212 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 220 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 228 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 236 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 244 + ~#ax_driver~0.offset, 8);call write~init~int(0, ~#ax_driver~0.base, 252 + ~#ax_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 253 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 261 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 269 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 277 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 285 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 293 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 301 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 309 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 317 + ~#ax_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ax_driver~0.base, 325 + ~#ax_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(= ~ldv_spin~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret111#1.base, main_#t~ret111#1.offset, main_#t~nondet112#1, main_#t~switch113#1, main_#t~nondet114#1, main_#t~switch115#1, main_#t~ret116#1, main_#t~nondet117#1, main_#t~switch118#1, main_#t~ret119#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~tmp___0~3#1, main_~tmp___1~0#1, main_~tmp___2~0#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~tmp___0~3#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,956 INFO L272 TraceCheckUtils]: 2: Hoare triple {990#(= ~ldv_spin~0 0)} call main_#t~ret111#1.base, main_#t~ret111#1.offset := ldv_zalloc(24); {1002#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:50,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {1002#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet11#1 && #t~nondet11#1 <= 2147483647;~tmp___0~1#1 := #t~nondet11#1;havoc #t~nondet11#1; {988#true} is VALID [2022-02-20 21:58:50,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {988#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {988#true} is VALID [2022-02-20 21:58:50,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {988#true} assume true; {988#true} is VALID [2022-02-20 21:58:50,958 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {988#true} {990#(= ~ldv_spin~0 0)} #331#return; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {990#(= ~ldv_spin~0 0)} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret111#1.base, main_#t~ret111#1.offset;havoc main_#t~ret111#1.base, main_#t~ret111#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset;assume { :begin_inline_ldv_initialize } true; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {990#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {990#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet112#1 && main_#t~nondet112#1 <= 2147483647;main_~tmp___0~3#1 := main_#t~nondet112#1;havoc main_#t~nondet112#1;main_#t~switch113#1 := 0 == main_~tmp___0~3#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {990#(= ~ldv_spin~0 0)} assume !main_#t~switch113#1;main_#t~switch113#1 := main_#t~switch113#1 || 1 == main_~tmp___0~3#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {990#(= ~ldv_spin~0 0)} assume main_#t~switch113#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {990#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet117#1 && main_#t~nondet117#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet117#1;havoc main_#t~nondet117#1;main_#t~switch118#1 := 0 == main_~tmp___2~0#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {990#(= ~ldv_spin~0 0)} assume !main_#t~switch118#1;main_#t~switch118#1 := main_#t~switch118#1 || 1 == main_~tmp___2~0#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {990#(= ~ldv_spin~0 0)} assume main_#t~switch118#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {990#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ax_driver_init } true;havoc ax_driver_init_#res#1;havoc ax_driver_init_#t~ret109#1, ax_driver_init_~tmp~11#1;havoc ax_driver_init_~tmp~11#1;assume { :begin_inline___hid_register_driver } true;__hid_register_driver_#in~arg0#1.base, __hid_register_driver_#in~arg0#1.offset, __hid_register_driver_#in~arg1#1.base, __hid_register_driver_#in~arg1#1.offset, __hid_register_driver_#in~arg2#1.base, __hid_register_driver_#in~arg2#1.offset := ~#ax_driver~0.base, ~#ax_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 20, 0;havoc __hid_register_driver_#res#1;havoc __hid_register_driver_#t~nondet123#1, __hid_register_driver_~arg0#1.base, __hid_register_driver_~arg0#1.offset, __hid_register_driver_~arg1#1.base, __hid_register_driver_~arg1#1.offset, __hid_register_driver_~arg2#1.base, __hid_register_driver_~arg2#1.offset;__hid_register_driver_~arg0#1.base, __hid_register_driver_~arg0#1.offset := __hid_register_driver_#in~arg0#1.base, __hid_register_driver_#in~arg0#1.offset;__hid_register_driver_~arg1#1.base, __hid_register_driver_~arg1#1.offset := __hid_register_driver_#in~arg1#1.base, __hid_register_driver_#in~arg1#1.offset;__hid_register_driver_~arg2#1.base, __hid_register_driver_~arg2#1.offset := __hid_register_driver_#in~arg2#1.base, __hid_register_driver_#in~arg2#1.offset;assume -2147483648 <= __hid_register_driver_#t~nondet123#1 && __hid_register_driver_#t~nondet123#1 <= 2147483647;__hid_register_driver_#res#1 := __hid_register_driver_#t~nondet123#1;havoc __hid_register_driver_#t~nondet123#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {990#(= ~ldv_spin~0 0)} ax_driver_init_#t~ret109#1 := __hid_register_driver_#res#1;assume { :end_inline___hid_register_driver } true;assume -2147483648 <= ax_driver_init_#t~ret109#1 && ax_driver_init_#t~ret109#1 <= 2147483647;ax_driver_init_~tmp~11#1 := ax_driver_init_#t~ret109#1;havoc ax_driver_init_#t~ret109#1;ax_driver_init_#res#1 := ax_driver_init_~tmp~11#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {990#(= ~ldv_spin~0 0)} main_#t~ret119#1 := ax_driver_init_#res#1;assume { :end_inline_ax_driver_init } true;assume -2147483648 <= main_#t~ret119#1 && main_#t~ret119#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret119#1;havoc main_#t~ret119#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {990#(= ~ldv_spin~0 0)} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_hid_driver_1 } true;havoc ldv_initialize_hid_driver_1_#t~ret110#1.base, ldv_initialize_hid_driver_1_#t~ret110#1.offset, ldv_initialize_hid_driver_1_~tmp~12#1.base, ldv_initialize_hid_driver_1_~tmp~12#1.offset;havoc ldv_initialize_hid_driver_1_~tmp~12#1.base, ldv_initialize_hid_driver_1_~tmp~12#1.offset; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,966 INFO L272 TraceCheckUtils]: 19: Hoare triple {990#(= ~ldv_spin~0 0)} call ldv_initialize_hid_driver_1_#t~ret110#1.base, ldv_initialize_hid_driver_1_#t~ret110#1.offset := ldv_zalloc(8568); {1002#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:58:50,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {1002#(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~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet11#1 && #t~nondet11#1 <= 2147483647;~tmp___0~1#1 := #t~nondet11#1;havoc #t~nondet11#1; {988#true} is VALID [2022-02-20 21:58:50,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {988#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {988#true} is VALID [2022-02-20 21:58:50,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {988#true} assume true; {988#true} is VALID [2022-02-20 21:58:50,967 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {988#true} {990#(= ~ldv_spin~0 0)} #349#return; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#(= ~ldv_spin~0 0)} ldv_initialize_hid_driver_1_~tmp~12#1.base, ldv_initialize_hid_driver_1_~tmp~12#1.offset := ldv_initialize_hid_driver_1_#t~ret110#1.base, ldv_initialize_hid_driver_1_#t~ret110#1.offset;havoc ldv_initialize_hid_driver_1_#t~ret110#1.base, ldv_initialize_hid_driver_1_#t~ret110#1.offset;~ax_driver_group0~0.base, ~ax_driver_group0~0.offset := ldv_initialize_hid_driver_1_~tmp~12#1.base, ldv_initialize_hid_driver_1_~tmp~12#1.offset; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize_hid_driver_1 } true; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {990#(= ~ldv_spin~0 0)} assume !(0 != ~ldv_retval_1~0); {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet112#1 && main_#t~nondet112#1 <= 2147483647;main_~tmp___0~3#1 := main_#t~nondet112#1;havoc main_#t~nondet112#1;main_#t~switch113#1 := 0 == main_~tmp___0~3#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#(= ~ldv_spin~0 0)} assume main_#t~switch113#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {990#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet114#1 && main_#t~nondet114#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet114#1;havoc main_#t~nondet114#1;main_#t~switch115#1 := 0 == main_~tmp___1~0#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {990#(= ~ldv_spin~0 0)} assume main_#t~switch115#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {990#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_ax_probe } true;ax_probe_#in~hdev#1.base, ax_probe_#in~hdev#1.offset, ax_probe_#in~id#1.base, ax_probe_#in~id#1.offset := ~ax_driver_group0~0.base, ~ax_driver_group0~0.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc ax_probe_#res#1;havoc ax_probe_#t~mem98#1, ax_probe_#t~ret99#1, ax_probe_#t~nondet100#1, ax_probe_#t~ret101#1, ax_probe_#t~nondet102#1, ax_probe_#t~ret103#1, ax_probe_#t~nondet104#1, ax_probe_#t~ret105#1, ax_probe_#t~nondet106#1, ax_probe_#t~ret107#1, ax_probe_#t~nondet108#1, ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset, ax_probe_~id#1.base, ax_probe_~id#1.offset, ax_probe_~error~1#1, ax_probe_~#descriptor~0#1.base, ax_probe_~#descriptor~0#1.offset, ax_probe_~tmp~10#1;ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset := ax_probe_#in~hdev#1.base, ax_probe_#in~hdev#1.offset;ax_probe_~id#1.base, ax_probe_~id#1.offset := ax_probe_#in~id#1.base, ax_probe_#in~id#1.offset;havoc ax_probe_~error~1#1;call ax_probe_~#descriptor~0#1.base, ax_probe_~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ax_probe_~tmp~10#1;call write~$Pointer$(10, 0, ax_probe_~#descriptor~0#1.base, ax_probe_~#descriptor~0#1.offset, 8);call write~$Pointer$(11, 0, ax_probe_~#descriptor~0#1.base, 8 + ax_probe_~#descriptor~0#1.offset, 8);call write~$Pointer$(12, 0, ax_probe_~#descriptor~0#1.base, 16 + ax_probe_~#descriptor~0#1.offset, 8);call write~$Pointer$(13, 0, ax_probe_~#descriptor~0#1.base, 24 + ax_probe_~#descriptor~0#1.offset, 8);call write~int(162, ax_probe_~#descriptor~0#1.base, 32 + ax_probe_~#descriptor~0#1.offset, 4);call write~int(0, ax_probe_~#descriptor~0#1.base, 36 + ax_probe_~#descriptor~0#1.offset, 1);call ax_probe_#t~mem98#1 := read~int(ax_probe_~#descriptor~0#1.base, 36 + ax_probe_~#descriptor~0#1.offset, 1);assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ax_probe_#t~mem98#1 % 256, 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {990#(= ~ldv_spin~0 0)} ax_probe_#t~ret99#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= ax_probe_#t~ret99#1 && ax_probe_#t~ret99#1 <= 9223372036854775807;ax_probe_~tmp~10#1 := ax_probe_#t~ret99#1;havoc ax_probe_#t~mem98#1;havoc ax_probe_#t~ret99#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {990#(= ~ldv_spin~0 0)} assume 0 != ax_probe_~tmp~10#1;havoc ax_probe_#t~nondet100#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {990#(= ~ldv_spin~0 0)} assume { :begin_inline_hid_parse } true;hid_parse_#in~hdev#1.base, hid_parse_#in~hdev#1.offset := ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset;havoc hid_parse_#res#1;havoc hid_parse_#t~ret37#1, hid_parse_~hdev#1.base, hid_parse_~hdev#1.offset, hid_parse_~tmp~5#1;hid_parse_~hdev#1.base, hid_parse_~hdev#1.offset := hid_parse_#in~hdev#1.base, hid_parse_#in~hdev#1.offset;havoc hid_parse_~tmp~5#1;assume { :begin_inline_hid_open_report } true;hid_open_report_#in~arg0#1.base, hid_open_report_#in~arg0#1.offset := hid_parse_~hdev#1.base, hid_parse_~hdev#1.offset;havoc hid_open_report_#res#1;havoc hid_open_report_#t~nondet128#1, hid_open_report_~arg0#1.base, hid_open_report_~arg0#1.offset;hid_open_report_~arg0#1.base, hid_open_report_~arg0#1.offset := hid_open_report_#in~arg0#1.base, hid_open_report_#in~arg0#1.offset;assume -2147483648 <= hid_open_report_#t~nondet128#1 && hid_open_report_#t~nondet128#1 <= 2147483647;hid_open_report_#res#1 := hid_open_report_#t~nondet128#1;havoc hid_open_report_#t~nondet128#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {990#(= ~ldv_spin~0 0)} hid_parse_#t~ret37#1 := hid_open_report_#res#1;assume { :end_inline_hid_open_report } true;assume -2147483648 <= hid_parse_#t~ret37#1 && hid_parse_#t~ret37#1 <= 2147483647;hid_parse_~tmp~5#1 := hid_parse_#t~ret37#1;havoc hid_parse_#t~ret37#1;hid_parse_#res#1 := hid_parse_~tmp~5#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {990#(= ~ldv_spin~0 0)} ax_probe_#t~ret101#1 := hid_parse_#res#1;assume { :end_inline_hid_parse } true;assume -2147483648 <= ax_probe_#t~ret101#1 && ax_probe_#t~ret101#1 <= 2147483647;ax_probe_~error~1#1 := ax_probe_#t~ret101#1;havoc ax_probe_#t~ret101#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {990#(= ~ldv_spin~0 0)} assume !(0 != ax_probe_~error~1#1);assume { :begin_inline_hid_hw_start } true;hid_hw_start_#in~hdev#1.base, hid_hw_start_#in~hdev#1.offset, hid_hw_start_#in~connect_mask#1 := ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset, 13;havoc hid_hw_start_#res#1;havoc hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset, hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset, hid_hw_start_#t~ret43#1, hid_hw_start_#t~ret44#1, hid_hw_start_#t~mem48#1.base, hid_hw_start_#t~mem48#1.offset, hid_hw_start_#t~mem49#1.base, hid_hw_start_#t~mem49#1.offset, hid_hw_start_~hdev#1.base, hid_hw_start_~hdev#1.offset, hid_hw_start_~connect_mask#1, hid_hw_start_~ret~0#1, hid_hw_start_~tmp~6#1;hid_hw_start_~hdev#1.base, hid_hw_start_~hdev#1.offset := hid_hw_start_#in~hdev#1.base, hid_hw_start_#in~hdev#1.offset;hid_hw_start_~connect_mask#1 := hid_hw_start_#in~connect_mask#1;havoc hid_hw_start_~ret~0#1;havoc hid_hw_start_~tmp~6#1;call hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset := read~$Pointer$(hid_hw_start_~hdev#1.base, 7869 + hid_hw_start_~hdev#1.offset, 8);call hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset := read~$Pointer$(hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset, 8); {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,977 INFO L272 TraceCheckUtils]: 38: Hoare triple {990#(= ~ldv_spin~0 0)} call hid_hw_start_#t~ret43#1 := ##fun~$Pointer$~TO~int(hid_hw_start_~hdev#1.base, hid_hw_start_~hdev#1.offset, hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset); {988#true} is VALID [2022-02-20 21:58:50,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {988#true} #~57.base, #~57.offset := #in~57.base, #in~57.offset; {988#true} is VALID [2022-02-20 21:58:50,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {988#true} assume true; {988#true} is VALID [2022-02-20 21:58:50,978 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {988#true} {990#(= ~ldv_spin~0 0)} #333#return; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {990#(= ~ldv_spin~0 0)} assume -2147483648 <= hid_hw_start_#t~ret43#1 && hid_hw_start_#t~ret43#1 <= 2147483647;hid_hw_start_~tmp~6#1 := hid_hw_start_#t~ret43#1;havoc hid_hw_start_#t~mem41#1.base, hid_hw_start_#t~mem41#1.offset;havoc hid_hw_start_#t~mem42#1.base, hid_hw_start_#t~mem42#1.offset;havoc hid_hw_start_#t~ret43#1;hid_hw_start_~ret~0#1 := hid_hw_start_~tmp~6#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {990#(= ~ldv_spin~0 0)} assume 0 != hid_hw_start_~ret~0#1 || 0 == hid_hw_start_~connect_mask#1 % 4294967296;hid_hw_start_#res#1 := hid_hw_start_~ret~0#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {990#(= ~ldv_spin~0 0)} ax_probe_#t~ret103#1 := hid_hw_start_#res#1;assume { :end_inline_hid_hw_start } true;assume -2147483648 <= ax_probe_#t~ret103#1 && ax_probe_#t~ret103#1 <= 2147483647;ax_probe_~error~1#1 := ax_probe_#t~ret103#1;havoc ax_probe_#t~ret103#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {990#(= ~ldv_spin~0 0)} assume !(0 != ax_probe_~error~1#1);assume { :begin_inline_axff_init } true;axff_init_#in~hid#1.base, axff_init_#in~hid#1.offset := ax_probe_~hdev#1.base, ax_probe_~hdev#1.offset;havoc axff_init_#res#1;havoc axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset, axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset, axff_init_#t~ret83#1, axff_init_#t~nondet84#1, axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset, axff_init_#t~mem86#1.base, axff_init_#t~mem86#1.offset, axff_init_#t~mem87#1.base, axff_init_#t~mem87#1.offset, axff_init_#t~mem88#1.base, axff_init_#t~mem88#1.offset, axff_init_#t~mem89#1, axff_init_#t~mem90#1, axff_init_#t~mem91#1, axff_init_#t~short92#1, axff_init_#t~nondet93#1, axff_init_#t~ret94#1.base, axff_init_#t~ret94#1.offset, axff_init_#t~ret95#1, axff_init_#t~mem96#1.base, axff_init_#t~mem96#1.offset, axff_init_#t~nondet97#1, axff_init_~hid#1.base, axff_init_~hid#1.offset, axff_init_~axff~1#1.base, axff_init_~axff~1#1.offset, axff_init_~report~1#1.base, axff_init_~report~1#1.offset, axff_init_~hidinput~0#1.base, axff_init_~hidinput~0#1.offset, axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset, axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset, axff_init_~dev~0#1.base, axff_init_~dev~0#1.offset, axff_init_~field_count~1#1, axff_init_~i~1#1, axff_init_~j~1#1, axff_init_~error~0#1, axff_init_~tmp~9#1, axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset, axff_init_~tmp___0~2#1.base, axff_init_~tmp___0~2#1.offset;axff_init_~hid#1.base, axff_init_~hid#1.offset := axff_init_#in~hid#1.base, axff_init_#in~hid#1.offset;havoc axff_init_~axff~1#1.base, axff_init_~axff~1#1.offset;havoc axff_init_~report~1#1.base, axff_init_~report~1#1.offset;havoc axff_init_~hidinput~0#1.base, axff_init_~hidinput~0#1.offset;havoc axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset;havoc axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset;havoc axff_init_~dev~0#1.base, axff_init_~dev~0#1.offset;havoc axff_init_~field_count~1#1;havoc axff_init_~i~1#1;havoc axff_init_~j~1#1;havoc axff_init_~error~0#1;havoc axff_init_~tmp~9#1;havoc axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset;havoc axff_init_~tmp___0~2#1.base, axff_init_~tmp___0~2#1.offset;call axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset := read~$Pointer$(axff_init_~hid#1.base, 7890 + axff_init_~hid#1.offset, 8);axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset := axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset;havoc axff_init_#t~mem81#1.base, axff_init_#t~mem81#1.offset;axff_init_~hidinput~0#1.base, axff_init_~hidinput~0#1.offset := axff_init_~__mptr~0#1.base, axff_init_~__mptr~0#1.offset;axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset := axff_init_~hid#1.base, 2140 + axff_init_~hid#1.offset;call axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset := read~$Pointer$(axff_init_~hidinput~0#1.base, 24 + axff_init_~hidinput~0#1.offset, 8);axff_init_~dev~0#1.base, axff_init_~dev~0#1.offset := axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset;havoc axff_init_#t~mem82#1.base, axff_init_#t~mem82#1.offset;axff_init_~field_count~1#1 := 0;assume { :begin_inline_list_empty } true;list_empty_#in~head#1.base, list_empty_#in~head#1.offset := axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset;havoc list_empty_#res#1;havoc list_empty_#t~mem5#1.base, list_empty_#t~mem5#1.offset, list_empty_~head#1.base, list_empty_~head#1.offset;list_empty_~head#1.base, list_empty_~head#1.offset := list_empty_#in~head#1.base, list_empty_#in~head#1.offset;call list_empty_#t~mem5#1.base, list_empty_#t~mem5#1.offset := read~$Pointer$(list_empty_~head#1.base, list_empty_~head#1.offset, 8);list_empty_#res#1 := (if (list_empty_#t~mem5#1.base + list_empty_#t~mem5#1.offset) % 18446744073709551616 == (list_empty_~head#1.base + list_empty_~head#1.offset) % 18446744073709551616 then 1 else 0);havoc list_empty_#t~mem5#1.base, list_empty_#t~mem5#1.offset; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {990#(= ~ldv_spin~0 0)} axff_init_#t~ret83#1 := list_empty_#res#1;assume { :end_inline_list_empty } true;assume -2147483648 <= axff_init_#t~ret83#1 && axff_init_#t~ret83#1 <= 2147483647;axff_init_~tmp~9#1 := axff_init_#t~ret83#1;havoc axff_init_#t~ret83#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {990#(= ~ldv_spin~0 0)} assume !(0 != axff_init_~tmp~9#1);call axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset := read~$Pointer$(axff_init_~report_list~0#1.base, axff_init_~report_list~0#1.offset, 8);axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset := axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset;havoc axff_init_#t~mem85#1.base, axff_init_#t~mem85#1.offset;axff_init_~report~1#1.base, axff_init_~report~1#1.offset := axff_init_~__mptr___0~0#1.base, axff_init_~__mptr___0~0#1.offset;axff_init_~i~1#1 := 0; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {990#(= ~ldv_spin~0 0)} call axff_init_#t~mem90#1 := read~int(axff_init_~report~1#1.base, 2072 + axff_init_~report~1#1.offset, 4); {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {990#(= ~ldv_spin~0 0)} assume !(axff_init_~i~1#1 % 4294967296 < axff_init_#t~mem90#1 % 4294967296);havoc axff_init_#t~mem90#1;axff_init_#t~short92#1 := axff_init_~field_count~1#1 <= 3; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {990#(= ~ldv_spin~0 0)} assume axff_init_#t~short92#1;call axff_init_#t~mem91#1 := read~int(axff_init_~hid#1.base, 52 + axff_init_~hid#1.offset, 4);axff_init_#t~short92#1 := 63237 != axff_init_#t~mem91#1 % 4294967296; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {990#(= ~ldv_spin~0 0)} assume !axff_init_#t~short92#1;havoc axff_init_#t~mem91#1;havoc axff_init_#t~short92#1;assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 8, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_~size#1, kzalloc_~flags#1;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := kzalloc_~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {990#(= ~ldv_spin~0 0)} is VALID [2022-02-20 21:58:50,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {990#(= ~ldv_spin~0 0)} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296); {989#false} is VALID [2022-02-20 21:58:50,985 INFO L272 TraceCheckUtils]: 53: Hoare triple {989#false} call ldv_error(); {989#false} is VALID [2022-02-20 21:58:50,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {989#false} assume !false; {989#false} is VALID [2022-02-20 21:58:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 21:58:50,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:58:50,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560175375] [2022-02-20 21:58:50,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560175375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:58:50,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:58:50,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:58:50,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85938621] [2022-02-20 21:58:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:58:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-20 21:58:50,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:58:50,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:58:51,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:51,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:58:51,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:58:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:58:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:58:51,038 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:58:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:51,329 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2022-02-20 21:58:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:58:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-20 21:58:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:58:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:58:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-02-20 21:58:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:58:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-02-20 21:58:51,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 128 transitions. [2022-02-20 21:58:51,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:58:51,473 INFO L225 Difference]: With dead ends: 129 [2022-02-20 21:58:51,473 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 21:58:51,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:58:51,475 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 92 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:58:51,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 205 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:58:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 21:58:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 21:58:51,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:58:51,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:58:51,476 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:58:51,476 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:58:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:51,477 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:58:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:58:51,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:51,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:51,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:58:51,477 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:58:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:58:51,478 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:58:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:58:51,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:51,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:58:51,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:58:51,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:58:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:58:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 21:58:51,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-02-20 21:58:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:58:51,480 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 21:58:51,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:58:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:58:51,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:58:51,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:58:51,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:58:51,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 21:58:51,611 INFO L858 garLoopResultBuilder]: For program point hid_hw_requestEXIT(lines 2662 2675) no Hoare annotation was computed. [2022-02-20 21:58:51,611 INFO L858 garLoopResultBuilder]: For program point L2666(lines 2666 2671) no Hoare annotation was computed. [2022-02-20 21:58:51,611 INFO L861 garLoopResultBuilder]: At program point L3077(lines 3076 3078) the Hoare annotation is: true [2022-02-20 21:58:51,612 INFO L861 garLoopResultBuilder]: At program point hid_hw_requestENTRY(lines 2662 2675) the Hoare annotation is: true [2022-02-20 21:58:51,612 INFO L858 garLoopResultBuilder]: For program point hid_hw_requestFINAL(lines 2662 2675) no Hoare annotation was computed. [2022-02-20 21:58:51,612 INFO L858 garLoopResultBuilder]: For program point hid_hw_stopFINAL(lines 2639 2646) no Hoare annotation was computed. [2022-02-20 21:58:51,612 INFO L861 garLoopResultBuilder]: At program point L3096(lines 3095 3097) the Hoare annotation is: true [2022-02-20 21:58:51,612 INFO L861 garLoopResultBuilder]: At program point hid_hw_stopENTRY(lines 2639 2646) the Hoare annotation is: true [2022-02-20 21:58:51,613 INFO L858 garLoopResultBuilder]: For program point hid_hw_stopEXIT(lines 2639 2646) no Hoare annotation was computed. [2022-02-20 21:58:51,613 INFO L858 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-02-20 21:58:51,613 INFO L861 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: true [2022-02-20 21:58:51,613 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 2499 2501) the Hoare annotation is: true [2022-02-20 21:58:51,613 INFO L858 garLoopResultBuilder]: For program point L2500(line 2500) no Hoare annotation was computed. [2022-02-20 21:58:51,614 INFO L858 garLoopResultBuilder]: For program point L2500-2(lines 2499 2501) no Hoare annotation was computed. [2022-02-20 21:58:51,614 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 2499 2501) no Hoare annotation was computed. [2022-02-20 21:58:51,614 INFO L861 garLoopResultBuilder]: At program point hid_hw_closeENTRY(lines 2655 2661) the Hoare annotation is: true [2022-02-20 21:58:51,615 INFO L858 garLoopResultBuilder]: For program point L2658-1(line 2658) no Hoare annotation was computed. [2022-02-20 21:58:51,615 INFO L858 garLoopResultBuilder]: For program point hid_hw_closeEXIT(lines 2655 2661) no Hoare annotation was computed. [2022-02-20 21:58:51,615 INFO L858 garLoopResultBuilder]: For program point hid_hw_closeFINAL(lines 2655 2661) no Hoare annotation was computed. [2022-02-20 21:58:51,615 INFO L861 garLoopResultBuilder]: At program point L2658(line 2658) the Hoare annotation is: true [2022-02-20 21:58:51,616 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2552 2558) no Hoare annotation was computed. [2022-02-20 21:58:51,616 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2552 2558) the Hoare annotation is: true [2022-02-20 21:58:51,616 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2556) no Hoare annotation was computed. [2022-02-20 21:58:51,616 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2552 2558) no Hoare annotation was computed. [2022-02-20 21:58:51,616 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,617 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-20 21:58:51,617 INFO L861 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-02-20 21:58:51,617 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,617 INFO L858 garLoopResultBuilder]: For program point L2526(lines 2526 2533) no Hoare annotation was computed. [2022-02-20 21:58:51,617 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,617 INFO L858 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 2519 2535) no Hoare annotation was computed. [2022-02-20 21:58:51,617 INFO L854 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 2519 2535) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2022-02-20 21:58:51,618 INFO L858 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 2519 2535) no Hoare annotation was computed. [2022-02-20 21:58:51,618 INFO L858 garLoopResultBuilder]: For program point L2531-1(line 2531) no Hoare annotation was computed. [2022-02-20 21:58:51,618 INFO L861 garLoopResultBuilder]: At program point L2531(line 2531) the Hoare annotation is: true [2022-02-20 21:58:51,618 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2559 2565) no Hoare annotation was computed. [2022-02-20 21:58:51,618 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2559 2565) the Hoare annotation is: true [2022-02-20 21:58:51,619 INFO L861 garLoopResultBuilder]: At program point L2975(lines 2912 2996) the Hoare annotation is: true [2022-02-20 21:58:51,619 INFO L858 garLoopResultBuilder]: For program point L2843(lines 2843 2848) no Hoare annotation was computed. [2022-02-20 21:58:51,619 INFO L854 garLoopResultBuilder]: At program point L2777(lines 2746 2805) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,619 INFO L858 garLoopResultBuilder]: For program point L2926(line 2926) no Hoare annotation was computed. [2022-02-20 21:58:51,619 INFO L858 garLoopResultBuilder]: For program point L2794(lines 2794 2797) no Hoare annotation was computed. [2022-02-20 21:58:51,619 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,620 INFO L858 garLoopResultBuilder]: For program point L2927(lines 2927 2935) no Hoare annotation was computed. [2022-02-20 21:58:51,620 INFO L854 garLoopResultBuilder]: At program point L2795(lines 2746 2805) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,620 INFO L858 garLoopResultBuilder]: For program point L2845-1(line 2845) no Hoare annotation was computed. [2022-02-20 21:58:51,620 INFO L861 garLoopResultBuilder]: At program point L2845(line 2845) the Hoare annotation is: true [2022-02-20 21:58:51,620 INFO L858 garLoopResultBuilder]: For program point L3126(lines 3126 3128) no Hoare annotation was computed. [2022-02-20 21:58:51,621 INFO L854 garLoopResultBuilder]: At program point L3093(lines 3092 3094) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,621 INFO L858 garLoopResultBuilder]: For program point L3011(lines 3011 3014) no Hoare annotation was computed. [2022-02-20 21:58:51,622 INFO L858 garLoopResultBuilder]: For program point L2945(line 2945) no Hoare annotation was computed. [2022-02-20 21:58:51,623 INFO L858 garLoopResultBuilder]: For program point L2780(line 2780) no Hoare annotation was computed. [2022-02-20 21:58:51,623 INFO L858 garLoopResultBuilder]: For program point L2780-2(lines 2780 2785) no Hoare annotation was computed. [2022-02-20 21:58:51,623 INFO L861 garLoopResultBuilder]: At program point L2995(lines 2905 2997) the Hoare annotation is: true [2022-02-20 21:58:51,624 INFO L858 garLoopResultBuilder]: For program point L2929(lines 2929 2933) no Hoare annotation was computed. [2022-02-20 21:58:51,624 INFO L858 garLoopResultBuilder]: For program point L2632(lines 2632 2635) no Hoare annotation was computed. [2022-02-20 21:58:51,624 INFO L858 garLoopResultBuilder]: For program point L2632-2(lines 2632 2635) no Hoare annotation was computed. [2022-02-20 21:58:51,624 INFO L861 garLoopResultBuilder]: At program point L2946(line 2946) the Hoare annotation is: true [2022-02-20 21:58:51,624 INFO L858 garLoopResultBuilder]: For program point L2913-1(line 2913) no Hoare annotation was computed. [2022-02-20 21:58:51,629 INFO L854 garLoopResultBuilder]: At program point L2913(line 2913) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0)) [2022-02-20 21:58:51,629 INFO L858 garLoopResultBuilder]: For program point L2831(lines 2831 2835) no Hoare annotation was computed. [2022-02-20 21:58:51,631 INFO L858 garLoopResultBuilder]: For program point L2633-1(line 2633) no Hoare annotation was computed. [2022-02-20 21:58:51,631 INFO L861 garLoopResultBuilder]: At program point L2633(line 2633) the Hoare annotation is: true [2022-02-20 21:58:51,634 INFO L854 garLoopResultBuilder]: At program point L3013-1(lines 3008 3017) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,635 INFO L854 garLoopResultBuilder]: At program point L3013(line 3013) the Hoare annotation is: false [2022-02-20 21:58:51,635 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2612 2619) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,635 INFO L858 garLoopResultBuilder]: For program point L2964(line 2964) no Hoare annotation was computed. [2022-02-20 21:58:51,635 INFO L858 garLoopResultBuilder]: For program point L2799-1(line 2799) no Hoare annotation was computed. [2022-02-20 21:58:51,636 INFO L854 garLoopResultBuilder]: At program point L2799(line 2799) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,636 INFO L861 garLoopResultBuilder]: At program point L3113(lines 3112 3114) the Hoare annotation is: true [2022-02-20 21:58:51,636 INFO L858 garLoopResultBuilder]: For program point L2981(line 2981) no Hoare annotation was computed. [2022-02-20 21:58:51,636 INFO L854 garLoopResultBuilder]: At program point L2882(lines 2877 2884) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,636 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,636 INFO L854 garLoopResultBuilder]: At program point L2849(lines 2807 2851) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,637 INFO L858 garLoopResultBuilder]: For program point L2651-1(line 2651) no Hoare annotation was computed. [2022-02-20 21:58:51,637 INFO L854 garLoopResultBuilder]: At program point L2651(line 2651) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,637 INFO L858 garLoopResultBuilder]: For program point L2965(lines 2965 2979) no Hoare annotation was computed. [2022-02-20 21:58:51,637 INFO L854 garLoopResultBuilder]: At program point L2569(lines 2566 2571) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,637 INFO L861 garLoopResultBuilder]: At program point L2982(line 2982) the Hoare annotation is: true [2022-02-20 21:58:51,637 INFO L854 garLoopResultBuilder]: At program point L2652(lines 2647 2654) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,638 INFO L854 garLoopResultBuilder]: At program point L2487(lines 2484 2489) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,638 INFO L854 garLoopResultBuilder]: At program point L2900(line 2900) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,638 INFO L858 garLoopResultBuilder]: For program point L2900-1(line 2900) no Hoare annotation was computed. [2022-02-20 21:58:51,638 INFO L854 garLoopResultBuilder]: At program point L2636(lines 2620 2638) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,639 INFO L858 garLoopResultBuilder]: For program point L2967(lines 2967 2972) no Hoare annotation was computed. [2022-02-20 21:58:51,639 INFO L858 garLoopResultBuilder]: For program point L2967-2(lines 2965 2978) no Hoare annotation was computed. [2022-02-20 21:58:51,639 INFO L854 garLoopResultBuilder]: At program point L2769(lines 2746 2805) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,639 INFO L854 garLoopResultBuilder]: At program point L3116(lines 3115 3117) the Hoare annotation is: (and (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0)) [2022-02-20 21:58:51,640 INFO L858 garLoopResultBuilder]: For program point L2753(lines 2753 2757) no Hoare annotation was computed. [2022-02-20 21:58:51,640 INFO L854 garLoopResultBuilder]: At program point L3100(lines 3099 3101) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,640 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,641 INFO L854 garLoopResultBuilder]: At program point L2902(lines 2896 2904) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,641 INFO L858 garLoopResultBuilder]: For program point L2770(lines 2770 2773) no Hoare annotation was computed. [2022-02-20 21:58:51,641 INFO L858 garLoopResultBuilder]: For program point L2952(line 2952) no Hoare annotation was computed. [2022-02-20 21:58:51,641 INFO L858 garLoopResultBuilder]: For program point L2820(lines 2820 2823) no Hoare annotation was computed. [2022-02-20 21:58:51,641 INFO L858 garLoopResultBuilder]: For program point L2820-2(lines 2820 2823) no Hoare annotation was computed. [2022-02-20 21:58:51,641 INFO L854 garLoopResultBuilder]: At program point L2804(lines 2731 2806) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,641 INFO L858 garLoopResultBuilder]: For program point L2837(lines 2837 2841) no Hoare annotation was computed. [2022-02-20 21:58:51,642 INFO L854 garLoopResultBuilder]: At program point L2771(lines 2746 2805) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,642 INFO L858 garLoopResultBuilder]: For program point L2837-2(lines 2837 2841) no Hoare annotation was computed. [2022-02-20 21:58:51,642 INFO L858 garLoopResultBuilder]: For program point L2953(lines 2953 2986) no Hoare annotation was computed. [2022-02-20 21:58:51,642 INFO L858 garLoopResultBuilder]: For program point L2788(lines 2788 2791) no Hoare annotation was computed. [2022-02-20 21:58:51,642 INFO L854 garLoopResultBuilder]: At program point L3003(lines 2999 3005) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,642 INFO L858 garLoopResultBuilder]: For program point L2937(line 2937) no Hoare annotation was computed. [2022-02-20 21:58:51,643 INFO L858 garLoopResultBuilder]: For program point L2921(lines 2921 2990) no Hoare annotation was computed. [2022-02-20 21:58:51,643 INFO L861 garLoopResultBuilder]: At program point L3103(lines 3102 3104) the Hoare annotation is: true [2022-02-20 21:58:51,643 INFO L858 garLoopResultBuilder]: For program point L2938(lines 2938 2943) no Hoare annotation was computed. [2022-02-20 21:58:51,643 INFO L858 garLoopResultBuilder]: For program point L2988(line 2988) no Hoare annotation was computed. [2022-02-20 21:58:51,643 INFO L858 garLoopResultBuilder]: For program point L2922(line 2922) no Hoare annotation was computed. [2022-02-20 21:58:51,643 INFO L858 garLoopResultBuilder]: For program point L2955(lines 2955 2983) no Hoare annotation was computed. [2022-02-20 21:58:51,643 INFO L861 garLoopResultBuilder]: At program point L2889(lines 2885 2891) the Hoare annotation is: true [2022-02-20 21:58:51,644 INFO L858 garLoopResultBuilder]: For program point L2625-1(line 2625) no Hoare annotation was computed. [2022-02-20 21:58:51,644 INFO L854 garLoopResultBuilder]: At program point L2625(line 2625) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,644 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,644 INFO L858 garLoopResultBuilder]: For program point L2939-1(line 2939) no Hoare annotation was computed. [2022-02-20 21:58:51,644 INFO L861 garLoopResultBuilder]: At program point L2939(line 2939) the Hoare annotation is: true [2022-02-20 21:58:51,644 INFO L858 garLoopResultBuilder]: For program point L2956(line 2956) no Hoare annotation was computed. [2022-02-20 21:58:51,645 INFO L861 garLoopResultBuilder]: At program point L2989(line 2989) the Hoare annotation is: true [2022-02-20 21:58:51,645 INFO L858 garLoopResultBuilder]: For program point L2923(lines 2923 2950) no Hoare annotation was computed. [2022-02-20 21:58:51,645 INFO L854 garLoopResultBuilder]: At program point L2775(lines 2746 2805) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,645 INFO L854 garLoopResultBuilder]: At program point L2478(lines 2474 2480) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,645 INFO L858 garLoopResultBuilder]: For program point L2957(lines 2957 2962) no Hoare annotation was computed. [2022-02-20 21:58:51,646 INFO L858 garLoopResultBuilder]: For program point L2825(lines 2825 2829) no Hoare annotation was computed. [2022-02-20 21:58:51,646 INFO L858 garLoopResultBuilder]: For program point L2627(lines 2627 2630) no Hoare annotation was computed. [2022-02-20 21:58:51,646 INFO L858 garLoopResultBuilder]: For program point L2776(lines 2776 2779) no Hoare annotation was computed. [2022-02-20 21:58:51,646 INFO L854 garLoopResultBuilder]: At program point L2991(lines 2912 2996) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,646 INFO L858 garLoopResultBuilder]: For program point L2925(lines 2925 2947) no Hoare annotation was computed. [2022-02-20 21:58:51,646 INFO L854 garLoopResultBuilder]: At program point L3074(lines 3073 3075) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,647 INFO L854 garLoopResultBuilder]: At program point L3107(lines 3106 3108) the Hoare annotation is: (= ~ldv_spin~0 0) [2022-02-20 21:58:51,647 INFO L858 garLoopResultBuilder]: For program point ax_removeFINAL(lines 2852 2859) no Hoare annotation was computed. [2022-02-20 21:58:51,647 INFO L858 garLoopResultBuilder]: For program point L2855-1(line 2855) no Hoare annotation was computed. [2022-02-20 21:58:51,647 INFO L861 garLoopResultBuilder]: At program point ax_removeENTRY(lines 2852 2859) the Hoare annotation is: true [2022-02-20 21:58:51,647 INFO L861 garLoopResultBuilder]: At program point L2855(line 2855) the Hoare annotation is: true [2022-02-20 21:58:51,647 INFO L858 garLoopResultBuilder]: For program point ax_removeEXIT(lines 2852 2859) no Hoare annotation was computed. [2022-02-20 21:58:51,647 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,648 INFO L861 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2022-02-20 21:58:51,648 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:58:51,651 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 21:58:51,652 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:58:51,660 WARN L170 areAnnotationChecker]: ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 21:58:51,660 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 21:58:51,660 WARN L170 areAnnotationChecker]: L2666 has no Hoare annotation [2022-02-20 21:58:51,660 WARN L170 areAnnotationChecker]: L2526 has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: L2500 has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~intFINAL has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: L2666 has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: L2666 has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~VOIDFINAL has no Hoare annotation [2022-02-20 21:58:51,661 WARN L170 areAnnotationChecker]: L2526 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: L2526 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: L2855-1 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: L2500 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: L2500 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: L2658-1 has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~intFINAL has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:58:51,662 WARN L170 areAnnotationChecker]: hid_hw_requestFINAL has no Hoare annotation [2022-02-20 21:58:51,663 WARN L170 areAnnotationChecker]: hid_hw_requestFINAL has no Hoare annotation [2022-02-20 21:58:51,663 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~VOIDFINAL has no Hoare annotation [2022-02-20 21:58:51,663 WARN L170 areAnnotationChecker]: ldv_zallocFINAL has no Hoare annotation [2022-02-20 21:58:51,663 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:58:51,663 WARN L170 areAnnotationChecker]: L2913-1 has no Hoare annotation [2022-02-20 21:58:51,664 WARN L170 areAnnotationChecker]: L2643-1 has no Hoare annotation [2022-02-20 21:58:51,664 WARN L170 areAnnotationChecker]: L2855-1 has no Hoare annotation [2022-02-20 21:58:51,665 WARN L170 areAnnotationChecker]: L2855-1 has no Hoare annotation [2022-02-20 21:58:51,665 WARN L170 areAnnotationChecker]: L2500-2 has no Hoare annotation [2022-02-20 21:58:51,665 WARN L170 areAnnotationChecker]: L2658-1 has no Hoare annotation [2022-02-20 21:58:51,665 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~intEXIT has no Hoare annotation [2022-02-20 21:58:51,665 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~intEXIT has no Hoare annotation [2022-02-20 21:58:51,666 WARN L170 areAnnotationChecker]: hid_hw_requestEXIT has no Hoare annotation [2022-02-20 21:58:51,666 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~VOIDEXIT has no Hoare annotation [2022-02-20 21:58:51,666 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~VOIDEXIT has no Hoare annotation [2022-02-20 21:58:51,666 WARN L170 areAnnotationChecker]: ##fun~$Pointer$~TO~VOIDEXIT has no Hoare annotation [2022-02-20 21:58:51,666 WARN L170 areAnnotationChecker]: ldv_zallocEXIT has no Hoare annotation [2022-02-20 21:58:51,668 WARN L170 areAnnotationChecker]: ldv_zallocEXIT has no Hoare annotation [2022-02-20 21:58:51,668 WARN L170 areAnnotationChecker]: L2531-1 has no Hoare annotation [2022-02-20 21:58:51,668 WARN L170 areAnnotationChecker]: L2913-1 has no Hoare annotation [2022-02-20 21:58:51,669 WARN L170 areAnnotationChecker]: L2643-1 has no Hoare annotation [2022-02-20 21:58:51,669 WARN L170 areAnnotationChecker]: ax_removeFINAL has no Hoare annotation [2022-02-20 21:58:51,669 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:58:51,669 WARN L170 areAnnotationChecker]: hid_hw_closeFINAL has no Hoare annotation [2022-02-20 21:58:51,669 WARN L170 areAnnotationChecker]: L2625-1 has no Hoare annotation [2022-02-20 21:58:51,669 WARN L170 areAnnotationChecker]: L2651-1 has no Hoare annotation [2022-02-20 21:58:51,670 WARN L170 areAnnotationChecker]: L2788 has no Hoare annotation [2022-02-20 21:58:51,670 WARN L170 areAnnotationChecker]: L2799-1 has no Hoare annotation [2022-02-20 21:58:51,670 WARN L170 areAnnotationChecker]: L2633-1 has no Hoare annotation [2022-02-20 21:58:51,670 WARN L170 areAnnotationChecker]: L2900-1 has no Hoare annotation [2022-02-20 21:58:51,670 WARN L170 areAnnotationChecker]: L2531-1 has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: hid_hw_stopFINAL has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: ax_removeEXIT has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: ax_removeEXIT has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: hid_hw_closeEXIT has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: L2627 has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: L2627 has no Hoare annotation [2022-02-20 21:58:51,671 WARN L170 areAnnotationChecker]: L2843 has no Hoare annotation [2022-02-20 21:58:51,672 WARN L170 areAnnotationChecker]: L2788 has no Hoare annotation [2022-02-20 21:58:51,672 WARN L170 areAnnotationChecker]: L2788 has no Hoare annotation [2022-02-20 21:58:51,672 WARN L170 areAnnotationChecker]: L2837 has no Hoare annotation [2022-02-20 21:58:51,672 WARN L170 areAnnotationChecker]: L2632-2 has no Hoare annotation [2022-02-20 21:58:51,672 WARN L170 areAnnotationChecker]: L2967-2 has no Hoare annotation [2022-02-20 21:58:51,672 WARN L170 areAnnotationChecker]: L2922 has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: hid_hw_stopEXIT has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: hid_hw_stopEXIT has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: L2939-1 has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: L2831 has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: L2632 has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: L2843 has no Hoare annotation [2022-02-20 21:58:51,673 WARN L170 areAnnotationChecker]: L2843 has no Hoare annotation [2022-02-20 21:58:51,674 WARN L170 areAnnotationChecker]: L2837 has no Hoare annotation [2022-02-20 21:58:51,674 WARN L170 areAnnotationChecker]: L2837 has no Hoare annotation [2022-02-20 21:58:51,674 WARN L170 areAnnotationChecker]: L2967-2 has no Hoare annotation [2022-02-20 21:58:51,674 WARN L170 areAnnotationChecker]: L2967-2 has no Hoare annotation [2022-02-20 21:58:51,674 WARN L170 areAnnotationChecker]: L2922 has no Hoare annotation [2022-02-20 21:58:51,674 WARN L170 areAnnotationChecker]: L2922 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2845-1 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2831 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2831 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2632 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2632 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2845-1 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2929 has no Hoare annotation [2022-02-20 21:58:51,675 WARN L170 areAnnotationChecker]: L2794 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2837-2 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2923 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2923 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2952 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2952 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2753 has no Hoare annotation [2022-02-20 21:58:51,676 WARN L170 areAnnotationChecker]: L2633-1 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2929 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2929 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2794 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2794 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2651-1 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2926 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2926 has no Hoare annotation [2022-02-20 21:58:51,677 WARN L170 areAnnotationChecker]: L2953 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2953 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2988 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2988 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2753 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2753 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L3126 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2799-1 has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:58:51,678 WARN L170 areAnnotationChecker]: L2927 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2927 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2937 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2937 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2956 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2956 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2921 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2921 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L2776 has no Hoare annotation [2022-02-20 21:58:51,679 WARN L170 areAnnotationChecker]: L3126 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2820 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2938 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2938 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2945 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2945 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2957 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2957 has no Hoare annotation [2022-02-20 21:58:51,680 WARN L170 areAnnotationChecker]: L2964 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2964 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2776 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2776 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2820 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2820 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2939-1 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2925 has no Hoare annotation [2022-02-20 21:58:51,681 WARN L170 areAnnotationChecker]: L2925 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2965 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2965 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2981 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2981 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2780 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2780 has no Hoare annotation [2022-02-20 21:58:51,682 WARN L170 areAnnotationChecker]: L2820-2 has no Hoare annotation [2022-02-20 21:58:51,683 WARN L170 areAnnotationChecker]: L2955 has no Hoare annotation [2022-02-20 21:58:51,683 WARN L170 areAnnotationChecker]: L2955 has no Hoare annotation [2022-02-20 21:58:51,683 WARN L170 areAnnotationChecker]: L2770 has no Hoare annotation [2022-02-20 21:58:51,683 WARN L170 areAnnotationChecker]: L2780-2 has no Hoare annotation [2022-02-20 21:58:51,683 WARN L170 areAnnotationChecker]: L2780-2 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L2967 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L2770 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L2770 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L3011 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L3011 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L2825 has no Hoare annotation [2022-02-20 21:58:51,684 WARN L170 areAnnotationChecker]: L2967 has no Hoare annotation [2022-02-20 21:58:51,685 WARN L170 areAnnotationChecker]: L2967 has no Hoare annotation [2022-02-20 21:58:51,685 WARN L170 areAnnotationChecker]: L2825 has no Hoare annotation [2022-02-20 21:58:51,686 WARN L170 areAnnotationChecker]: L2825 has no Hoare annotation [2022-02-20 21:58:51,686 WARN L170 areAnnotationChecker]: L2900-1 has no Hoare annotation [2022-02-20 21:58:51,686 WARN L170 areAnnotationChecker]: L2625-1 has no Hoare annotation [2022-02-20 21:58:51,687 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 21:58:51,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 09:58:51 BoogieIcfgContainer [2022-02-20 21:58:51,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 21:58:51,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 21:58:51,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 21:58:51,703 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 21:58:51,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:58:48" (3/4) ... [2022-02-20 21:58:51,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 21:58:51,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-02-20 21:58:51,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hid_hw_request [2022-02-20 21:58:51,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:58:51,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-02-20 21:58:51,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-02-20 21:58:51,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hid_hw_stop [2022-02-20 21:58:51,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ax_remove [2022-02-20 21:58:51,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 21:58:51,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hid_hw_close [2022-02-20 21:58:51,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~int [2022-02-20 21:58:51,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 75 nodes and edges [2022-02-20 21:58:51,728 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 21:58:51,728 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 21:58:51,729 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 21:58:51,730 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:58:51,730 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:58:51,830 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 21:58:51,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 21:58:51,832 INFO L158 Benchmark]: Toolchain (without parser) took 4714.95ms. Allocated memory was 111.1MB in the beginning and 211.8MB in the end (delta: 100.7MB). Free memory was 77.0MB in the beginning and 131.7MB in the end (delta: -54.7MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,832 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:58:51,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.03ms. Allocated memory was 111.1MB in the beginning and 144.7MB in the end (delta: 33.6MB). Free memory was 76.8MB in the beginning and 99.0MB in the end (delta: -22.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.88ms. Allocated memory is still 144.7MB. Free memory was 99.0MB in the beginning and 93.4MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,833 INFO L158 Benchmark]: Boogie Preprocessor took 45.35ms. Allocated memory is still 144.7MB. Free memory was 93.4MB in the beginning and 88.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,833 INFO L158 Benchmark]: RCFGBuilder took 930.39ms. Allocated memory is still 144.7MB. Free memory was 88.5MB in the beginning and 80.4MB in the end (delta: 8.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,834 INFO L158 Benchmark]: TraceAbstraction took 2702.83ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 79.6MB in the beginning and 141.2MB in the end (delta: -61.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,834 INFO L158 Benchmark]: Witness Printer took 127.86ms. Allocated memory is still 211.8MB. Free memory was 141.2MB in the beginning and 131.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 21:58:51,836 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.03ms. Allocated memory was 111.1MB in the beginning and 144.7MB in the end (delta: 33.6MB). Free memory was 76.8MB in the beginning and 99.0MB in the end (delta: -22.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.88ms. Allocated memory is still 144.7MB. Free memory was 99.0MB in the beginning and 93.4MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.35ms. Allocated memory is still 144.7MB. Free memory was 93.4MB in the beginning and 88.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 930.39ms. Allocated memory is still 144.7MB. Free memory was 88.5MB in the beginning and 80.4MB in the end (delta: 8.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2702.83ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 79.6MB in the beginning and 141.2MB in the end (delta: -61.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Witness Printer took 127.86ms. Allocated memory is still 211.8MB. Free memory was 141.2MB in the beginning and 131.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2556]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 574 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 274 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 97 PreInvPairs, 145 NumberOfFragments, 135 HoareAnnotationTreeSize, 97 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 57 FomulaSimplificationsInter, 59 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 2877]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2612]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2905]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2484]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3106]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3115]: Loop Invariant Derived loop invariant: ldv_spin == 0 && ldv_state_variable_1 == 0 - InvariantResult [Line: 2912]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2746]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2474]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2912]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2746]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2559]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2807]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2746]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3076]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2999]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3092]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2896]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3073]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2620]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2885]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3008]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3099]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2647]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2746]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 3112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2746]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2566]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2731]: Loop Invariant Derived loop invariant: ldv_spin == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 21:58:51,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE