./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.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 c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:07:57,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:07:57,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:07:57,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:07:57,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:07:57,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:07:57,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:07:57,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:07:57,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:07:57,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:07:57,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:07:57,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:07:57,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:07:58,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:07:58,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:07:58,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:07:58,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:07:58,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:07:58,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:07:58,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:07:58,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:07:58,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:07:58,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:07:58,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:07:58,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:07:58,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:07:58,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:07:58,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:07:58,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:07:58,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:07:58,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:07:58,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:07:58,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:07:58,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:07:58,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:07:58,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:07:58,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:07:58,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:07:58,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:07:58,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:07:58,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:07:58,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:07:58,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:07:58,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:07:58,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:07:58,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:07:58,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:07:58,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:07:58,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:07:58,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:07:58,069 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:07:58,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:07:58,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:07:58,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:07:58,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:07:58,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:07:58,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:07:58,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:07:58,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:07:58,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:07:58,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:07:58,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:07:58,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:07:58,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:07:58,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:07:58,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:07:58,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:07:58,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:07:58,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:07:58,073 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:07:58,073 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:07:58,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:07:58,073 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 -> c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 [2022-02-20 22:07:58,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:07:58,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:07:58,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:07:58,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:07:58,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:07:58,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2022-02-20 22:07:58,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c7ad9f0/c5282530a73b444db70da5634b551545/FLAGa84a09295 [2022-02-20 22:07:58,772 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:07:58,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2022-02-20 22:07:58,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c7ad9f0/c5282530a73b444db70da5634b551545/FLAGa84a09295 [2022-02-20 22:07:59,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c7ad9f0/c5282530a73b444db70da5634b551545 [2022-02-20 22:07:59,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:07:59,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:07:59,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:07:59,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:07:59,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:07:59,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8eae34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59, skipping insertion in model container [2022-02-20 22:07:59,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:07:59,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:07:59,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2022-02-20 22:07:59,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:07:59,664 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:07:59,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2022-02-20 22:07:59,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:07:59,836 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:07:59,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59 WrapperNode [2022-02-20 22:07:59,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:07:59,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:07:59,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:07:59,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:07:59,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,926 INFO L137 Inliner]: procedures = 88, calls = 127, calls flagged for inlining = 39, calls inlined = 34, statements flattened = 554 [2022-02-20 22:07:59,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:07:59,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:07:59,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:07:59,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:07:59,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:07:59,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:08:00,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:08:00,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:08:00,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:08:00,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:08:00,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (1/1) ... [2022-02-20 22:08:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:08:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:08:00,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 22:08:00,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:08:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:08:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-02-20 22:08:00,063 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-02-20 22:08:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2022-02-20 22:08:00,064 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2022-02-20 22:08:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:08:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-02-20 22:08:00,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-02-20 22:08:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:08:00,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:08:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:08:00,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:08:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:08:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:08:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:08:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:08:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2022-02-20 22:08:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2022-02-20 22:08:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-02-20 22:08:00,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-02-20 22:08:00,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:08:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-02-20 22:08:00,066 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-02-20 22:08:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:08:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:08:00,066 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:08:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-02-20 22:08:00,066 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-02-20 22:08:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:08:00,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:08:00,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:08:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2022-02-20 22:08:00,067 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2022-02-20 22:08:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:08:00,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:08:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:08:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:08:00,067 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2022-02-20 22:08:00,068 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2022-02-20 22:08:00,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:08:00,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:08:00,248 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:08:00,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:08:00,526 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:08:00,689 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:08:00,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:08:00,696 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:08:00,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:08:00 BoogieIcfgContainer [2022-02-20 22:08:00,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:08:00,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:08:00,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:08:00,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:08:00,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:07:59" (1/3) ... [2022-02-20 22:08:00,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3dd5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:08:00, skipping insertion in model container [2022-02-20 22:08:00,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:07:59" (2/3) ... [2022-02-20 22:08:00,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3dd5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:08:00, skipping insertion in model container [2022-02-20 22:08:00,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:08:00" (3/3) ... [2022-02-20 22:08:00,703 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2022-02-20 22:08:00,707 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:08:00,707 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:08:00,746 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:08:00,751 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:08:00,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:08:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 159 states have internal predecessors, (206), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 22:08:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 22:08:00,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:00,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:00,774 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1405935903, now seen corresponding path program 1 times [2022-02-20 22:08:00,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:00,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458769059] [2022-02-20 22:08:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:00,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:01,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {200#true} is VALID [2022-02-20 22:08:01,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {200#true} is VALID [2022-02-20 22:08:01,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {202#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:08:01,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {202#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {202#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:08:01,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {202#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {202#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:08:01,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch75#1; {202#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:08:01,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {202#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:08:01,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch77#1; {202#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:08:01,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_iio_interrupt_trigger_driver_exit } true;assume { :begin_inline_ldv_platform_driver_unregister_11 } true;ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset;havoc ldv_platform_driver_unregister_11_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_~ldv_func_arg1#1.offset;ldv_platform_driver_unregister_11_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_~ldv_func_arg1#1.offset := ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.offset;assume { :begin_inline_platform_driver_unregister } true;platform_driver_unregister_#in~arg0#1.base, platform_driver_unregister_#in~arg0#1.offset := ldv_platform_driver_unregister_11_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_~ldv_func_arg1#1.offset;havoc platform_driver_unregister_~arg0#1.base, platform_driver_unregister_~arg0#1.offset;platform_driver_unregister_~arg0#1.base, platform_driver_unregister_~arg0#1.offset := platform_driver_unregister_#in~arg0#1.base, platform_driver_unregister_#in~arg0#1.offset; {201#false} is VALID [2022-02-20 22:08:01,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#false} assume { :end_inline_platform_driver_unregister } true;~ldv_state_variable_2~0 := 0; {201#false} is VALID [2022-02-20 22:08:01,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#false} assume { :end_inline_ldv_platform_driver_unregister_11 } true; {201#false} is VALID [2022-02-20 22:08:01,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#false} assume { :end_inline_iio_interrupt_trigger_driver_exit } true;~ldv_state_variable_0~0 := 2; {201#false} is VALID [2022-02-20 22:08:01,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#false} assume { :begin_inline_ldv_check_final_state } true; {201#false} is VALID [2022-02-20 22:08:01,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {201#false} assume 1 != ~ldv_module_refcounter~0; {201#false} is VALID [2022-02-20 22:08:01,117 INFO L272 TraceCheckUtils]: 14: Hoare triple {201#false} call ldv_error(); {201#false} is VALID [2022-02-20 22:08:01,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {201#false} assume !false; {201#false} is VALID [2022-02-20 22:08:01,118 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 22:08:01,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:08:01,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458769059] [2022-02-20 22:08:01,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458769059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:01,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:01,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 22:08:01,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193811555] [2022-02-20 22:08:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 22:08:01,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:01,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:01,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:01,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:08:01,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:08:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:08:01,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:01,178 INFO L87 Difference]: Start difference. First operand has 197 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 159 states have internal predecessors, (206), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:01,680 INFO L93 Difference]: Finished difference Result 558 states and 780 transitions. [2022-02-20 22:08:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:08:01,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 22:08:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2022-02-20 22:08:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2022-02-20 22:08:01,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 780 transitions. [2022-02-20 22:08:02,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:02,257 INFO L225 Difference]: With dead ends: 558 [2022-02-20 22:08:02,259 INFO L226 Difference]: Without dead ends: 348 [2022-02-20 22:08:02,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:02,271 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 234 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:02,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-02-20 22:08:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 345. [2022-02-20 22:08:02,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:02,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 345 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 274 states have internal predecessors, (357), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:02,338 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 345 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 274 states have internal predecessors, (357), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:02,342 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 345 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 274 states have internal predecessors, (357), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:02,375 INFO L93 Difference]: Finished difference Result 348 states and 457 transitions. [2022-02-20 22:08:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 457 transitions. [2022-02-20 22:08:02,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:02,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:02,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 274 states have internal predecessors, (357), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 348 states. [2022-02-20 22:08:02,387 INFO L87 Difference]: Start difference. First operand has 345 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 274 states have internal predecessors, (357), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 348 states. [2022-02-20 22:08:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:02,402 INFO L93 Difference]: Finished difference Result 348 states and 457 transitions. [2022-02-20 22:08:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 457 transitions. [2022-02-20 22:08:02,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:02,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:02,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:02,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 274 states have internal predecessors, (357), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 455 transitions. [2022-02-20 22:08:02,423 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 455 transitions. Word has length 16 [2022-02-20 22:08:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:02,423 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 455 transitions. [2022-02-20 22:08:02,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 455 transitions. [2022-02-20 22:08:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 22:08:02,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:02,426 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] [2022-02-20 22:08:02,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:08:02,427 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1615512074, now seen corresponding path program 1 times [2022-02-20 22:08:02,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:02,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701707144] [2022-02-20 22:08:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 22:08:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:02,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2180#true} is VALID [2022-02-20 22:08:02,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {2180#true} assume true; {2180#true} is VALID [2022-02-20 22:08:02,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2180#true} {2180#true} #513#return; {2180#true} is VALID [2022-02-20 22:08:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 22:08:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:02,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {2180#true} ~cond := #in~cond; {2180#true} is VALID [2022-02-20 22:08:02,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {2180#true} assume !(0 == ~cond); {2180#true} is VALID [2022-02-20 22:08:02,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2180#true} assume true; {2180#true} is VALID [2022-02-20 22:08:02,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2180#true} {2180#true} #515#return; {2180#true} is VALID [2022-02-20 22:08:02,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {2180#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {2180#true} is VALID [2022-02-20 22:08:02,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {2180#true} is VALID [2022-02-20 22:08:02,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2180#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {2180#true} is VALID [2022-02-20 22:08:02,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {2180#true} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {2180#true} is VALID [2022-02-20 22:08:02,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {2180#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {2180#true} is VALID [2022-02-20 22:08:02,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {2180#true} assume main_#t~switch75#1; {2180#true} is VALID [2022-02-20 22:08:02,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {2180#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {2180#true} is VALID [2022-02-20 22:08:02,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {2180#true} assume !main_#t~switch77#1;main_#t~switch77#1 := main_#t~switch77#1 || 1 == main_~tmp___0~4#1; {2180#true} is VALID [2022-02-20 22:08:02,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {2180#true} assume main_#t~switch77#1; {2180#true} is VALID [2022-02-20 22:08:02,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {2180#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret86#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet92#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;assume -2147483648 <= __platform_driver_register_#t~nondet92#1 && __platform_driver_register_#t~nondet92#1 <= 2147483647;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet92#1;havoc __platform_driver_register_#t~nondet92#1; {2180#true} is VALID [2022-02-20 22:08:02,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {2180#true} ldv___platform_driver_register_10_#t~ret86#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;assume -2147483648 <= ldv___platform_driver_register_10_#t~ret86#1 && ldv___platform_driver_register_10_#t~ret86#1 <= 2147483647;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret86#1;havoc ldv___platform_driver_register_10_#t~ret86#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {2180#true} is VALID [2022-02-20 22:08:02,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {2180#true} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {2190#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:08:02,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {2190#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2180#true} is VALID [2022-02-20 22:08:02,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2180#true} assume true; {2180#true} is VALID [2022-02-20 22:08:02,545 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2180#true} {2180#true} #513#return; {2180#true} is VALID [2022-02-20 22:08:02,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2180#true} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {2180#true} is VALID [2022-02-20 22:08:02,545 INFO L272 TraceCheckUtils]: 16: Hoare triple {2180#true} call assume_abort_if_not((if 0 != (ldv_init_zalloc_~p~2#1.base + ldv_init_zalloc_~p~2#1.offset) % 18446744073709551616 then 1 else 0)); {2180#true} is VALID [2022-02-20 22:08:02,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {2180#true} ~cond := #in~cond; {2180#true} is VALID [2022-02-20 22:08:02,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {2180#true} assume !(0 == ~cond); {2180#true} is VALID [2022-02-20 22:08:02,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {2180#true} assume true; {2180#true} is VALID [2022-02-20 22:08:02,546 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2180#true} {2180#true} #515#return; {2180#true} is VALID [2022-02-20 22:08:02,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {2180#true} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {2180#true} is VALID [2022-02-20 22:08:02,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {2180#true} ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {2180#true} is VALID [2022-02-20 22:08:02,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {2180#true} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {2180#true} is VALID [2022-02-20 22:08:02,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {2180#true} iio_interrupt_trigger_driver_init_#t~ret60#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;assume -2147483648 <= iio_interrupt_trigger_driver_init_#t~ret60#1 && iio_interrupt_trigger_driver_init_#t~ret60#1 <= 2147483647;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret60#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {2180#true} is VALID [2022-02-20 22:08:02,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {2180#true} main_#t~ret78#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;assume -2147483648 <= main_#t~ret78#1 && main_#t~ret78#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret78#1;havoc main_#t~ret78#1; {2180#true} is VALID [2022-02-20 22:08:02,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {2180#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {2189#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 22:08:02,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {2189#(= ~ldv_retval_0~0 0)} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {2181#false} is VALID [2022-02-20 22:08:02,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {2181#false} assume { :begin_inline_ldv_check_final_state } true; {2181#false} is VALID [2022-02-20 22:08:02,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {2181#false} assume 1 != ~ldv_module_refcounter~0; {2181#false} is VALID [2022-02-20 22:08:02,551 INFO L272 TraceCheckUtils]: 30: Hoare triple {2181#false} call ldv_error(); {2181#false} is VALID [2022-02-20 22:08:02,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {2181#false} assume !false; {2181#false} is VALID [2022-02-20 22:08:02,551 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 22:08:02,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:08:02,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701707144] [2022-02-20 22:08:02,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701707144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:02,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:02,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:08:02,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619927869] [2022-02-20 22:08:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:02,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:02,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:02,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:02,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:08:02,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:08:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:08:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:08:02,578 INFO L87 Difference]: Start difference. First operand 345 states and 455 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:03,008 INFO L93 Difference]: Finished difference Result 363 states and 473 transitions. [2022-02-20 22:08:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:08:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 22:08:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 22:08:03,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 257 transitions. [2022-02-20 22:08:03,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:03,206 INFO L225 Difference]: With dead ends: 363 [2022-02-20 22:08:03,207 INFO L226 Difference]: Without dead ends: 358 [2022-02-20 22:08:03,207 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 22:08:03,212 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 284 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:03,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 343 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 22:08:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-20 22:08:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 345. [2022-02-20 22:08:03,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:03,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 345 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 274 states have internal predecessors, (356), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:03,244 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 345 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 274 states have internal predecessors, (356), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:03,244 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 345 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 274 states have internal predecessors, (356), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:03,255 INFO L93 Difference]: Finished difference Result 358 states and 468 transitions. [2022-02-20 22:08:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 468 transitions. [2022-02-20 22:08:03,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:03,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:03,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 274 states have internal predecessors, (356), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 358 states. [2022-02-20 22:08:03,258 INFO L87 Difference]: Start difference. First operand has 345 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 274 states have internal predecessors, (356), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 358 states. [2022-02-20 22:08:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:03,268 INFO L93 Difference]: Finished difference Result 358 states and 468 transitions. [2022-02-20 22:08:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 468 transitions. [2022-02-20 22:08:03,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:03,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:03,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:03,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 274 states have internal predecessors, (356), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 454 transitions. [2022-02-20 22:08:03,280 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 454 transitions. Word has length 32 [2022-02-20 22:08:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:03,281 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 454 transitions. [2022-02-20 22:08:03,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 454 transitions. [2022-02-20 22:08:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 22:08:03,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:03,282 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] [2022-02-20 22:08:03,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:08:03,282 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1672770376, now seen corresponding path program 1 times [2022-02-20 22:08:03,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:03,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442553543] [2022-02-20 22:08:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 22:08:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:03,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {3916#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3906#true} is VALID [2022-02-20 22:08:03,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 22:08:03,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3906#true} {3908#(= ~ldv_module_refcounter~0 1)} #513#return; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 22:08:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:03,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#true} ~cond := #in~cond; {3906#true} is VALID [2022-02-20 22:08:03,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume !(0 == ~cond); {3906#true} is VALID [2022-02-20 22:08:03,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 22:08:03,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {3908#(= ~ldv_module_refcounter~0 1)} #515#return; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {3906#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume main_#t~switch75#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume !main_#t~switch77#1;main_#t~switch77#1 := main_#t~switch77#1 || 1 == main_~tmp___0~4#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume main_#t~switch77#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret86#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet92#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;assume -2147483648 <= __platform_driver_register_#t~nondet92#1 && __platform_driver_register_#t~nondet92#1 <= 2147483647;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet92#1;havoc __platform_driver_register_#t~nondet92#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} ldv___platform_driver_register_10_#t~ret86#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;assume -2147483648 <= ldv___platform_driver_register_10_#t~ret86#1 && ldv___platform_driver_register_10_#t~ret86#1 <= 2147483647;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret86#1;havoc ldv___platform_driver_register_10_#t~ret86#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,407 INFO L272 TraceCheckUtils]: 11: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {3916#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:08:03,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {3916#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3906#true} is VALID [2022-02-20 22:08:03,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 22:08:03,408 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3906#true} {3908#(= ~ldv_module_refcounter~0 1)} #513#return; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,409 INFO L272 TraceCheckUtils]: 16: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} call assume_abort_if_not((if 0 != (ldv_init_zalloc_~p~2#1.base + ldv_init_zalloc_~p~2#1.offset) % 18446744073709551616 then 1 else 0)); {3906#true} is VALID [2022-02-20 22:08:03,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {3906#true} ~cond := #in~cond; {3906#true} is VALID [2022-02-20 22:08:03,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {3906#true} assume !(0 == ~cond); {3906#true} is VALID [2022-02-20 22:08:03,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-02-20 22:08:03,410 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3906#true} {3908#(= ~ldv_module_refcounter~0 1)} #515#return; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} iio_interrupt_trigger_driver_init_#t~ret60#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;assume -2147483648 <= iio_interrupt_trigger_driver_init_#t~ret60#1 && iio_interrupt_trigger_driver_init_#t~ret60#1 <= 2147483647;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret60#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} main_#t~ret78#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;assume -2147483648 <= main_#t~ret78#1 && main_#t~ret78#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret78#1;havoc main_#t~ret78#1; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume !(0 == ~ldv_retval_0~0); {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume { :begin_inline_ldv_check_final_state } true; {3908#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 22:08:03,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {3908#(= ~ldv_module_refcounter~0 1)} assume 1 != ~ldv_module_refcounter~0; {3907#false} is VALID [2022-02-20 22:08:03,413 INFO L272 TraceCheckUtils]: 30: Hoare triple {3907#false} call ldv_error(); {3907#false} is VALID [2022-02-20 22:08:03,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-02-20 22:08:03,413 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 22:08:03,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:08:03,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442553543] [2022-02-20 22:08:03,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442553543] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:03,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:03,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:08:03,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473811046] [2022-02-20 22:08:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:03,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:03,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:03,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:03,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:08:03,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:08:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:08:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:08:03,452 INFO L87 Difference]: Start difference. First operand 345 states and 454 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:03,910 INFO L93 Difference]: Finished difference Result 692 states and 926 transitions. [2022-02-20 22:08:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:08:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2022-02-20 22:08:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2022-02-20 22:08:03,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 491 transitions. [2022-02-20 22:08:04,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:04,313 INFO L225 Difference]: With dead ends: 692 [2022-02-20 22:08:04,314 INFO L226 Difference]: Without dead ends: 345 [2022-02-20 22:08:04,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 22:08:04,315 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 261 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:04,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 331 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 22:08:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-20 22:08:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 336. [2022-02-20 22:08:04,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:04,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 336 states, 261 states have (on average 1.318007662835249) internal successors, (344), 265 states have internal predecessors, (344), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:04,332 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 336 states, 261 states have (on average 1.318007662835249) internal successors, (344), 265 states have internal predecessors, (344), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:04,333 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 336 states, 261 states have (on average 1.318007662835249) internal successors, (344), 265 states have internal predecessors, (344), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:04,348 INFO L93 Difference]: Finished difference Result 345 states and 452 transitions. [2022-02-20 22:08:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 452 transitions. [2022-02-20 22:08:04,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:04,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:04,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 336 states, 261 states have (on average 1.318007662835249) internal successors, (344), 265 states have internal predecessors, (344), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 345 states. [2022-02-20 22:08:04,352 INFO L87 Difference]: Start difference. First operand has 336 states, 261 states have (on average 1.318007662835249) internal successors, (344), 265 states have internal predecessors, (344), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 345 states. [2022-02-20 22:08:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:04,362 INFO L93 Difference]: Finished difference Result 345 states and 452 transitions. [2022-02-20 22:08:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 452 transitions. [2022-02-20 22:08:04,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:04,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:04,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:04,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 261 states have (on average 1.318007662835249) internal successors, (344), 265 states have internal predecessors, (344), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 441 transitions. [2022-02-20 22:08:04,374 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 441 transitions. Word has length 32 [2022-02-20 22:08:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:04,374 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 441 transitions. [2022-02-20 22:08:04,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 441 transitions. [2022-02-20 22:08:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 22:08:04,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:04,377 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 22:08:04,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:08:04,380 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1261620505, now seen corresponding path program 1 times [2022-02-20 22:08:04,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:04,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096959948] [2022-02-20 22:08:04,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 22:08:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:04,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {6062#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {6051#true} is VALID [2022-02-20 22:08:04,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {6051#true} is VALID [2022-02-20 22:08:04,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {6051#true} assume true; {6051#true} is VALID [2022-02-20 22:08:04,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6051#true} {6052#false} #469#return; {6052#false} is VALID [2022-02-20 22:08:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:08:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:04,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {6062#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {6051#true} is VALID [2022-02-20 22:08:04,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {6051#true} is VALID [2022-02-20 22:08:04,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {6051#true} assume true; {6051#true} is VALID [2022-02-20 22:08:04,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6051#true} {6052#false} #471#return; {6052#false} is VALID [2022-02-20 22:08:04,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {6051#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {6051#true} is VALID [2022-02-20 22:08:04,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {6051#true} is VALID [2022-02-20 22:08:04,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {6051#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {6053#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:08:04,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {6053#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {6053#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:08:04,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {6053#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {6053#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:08:04,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {6053#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 2 == main_~tmp~16#1; {6053#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:08:04,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {6053#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch75#1; {6053#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:08:04,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {6053#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet79#1 && main_#t~nondet79#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet79#1;havoc main_#t~nondet79#1;main_#t~switch80#1 := 0 == main_~tmp___1~0#1; {6052#false} is VALID [2022-02-20 22:08:04,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {6052#false} assume main_#t~switch80#1; {6052#false} is VALID [2022-02-20 22:08:04,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#false} assume 1 == ~ldv_state_variable_2~0; {6052#false} is VALID [2022-02-20 22:08:04,456 INFO L272 TraceCheckUtils]: 10: Hoare triple {6052#false} call main_#t~ret81#1 := iio_interrupt_trigger_probe(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {6052#false} is VALID [2022-02-20 22:08:04,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {6052#false} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig_info~0#1.base, ~trig_info~0#1.offset;havoc ~trig~0#1.base, ~trig~0#1.offset;havoc ~irqflags~0#1;havoc ~irq_res~0#1.base, ~irq_res~0#1.offset;havoc ~irq~0#1;havoc ~ret~0#1;havoc ~tmp~10#1.base, ~tmp~10#1.offset;~ret~0#1 := 0;assume { :begin_inline_platform_get_resource } true;platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset, platform_get_resource_#in~arg1#1, platform_get_resource_#in~arg2#1 := ~pdev#1.base, ~pdev#1.offset, 1024, 0;havoc platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset, platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset, platform_get_resource_~arg1#1, platform_get_resource_~arg2#1;platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset := platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset;platform_get_resource_~arg1#1 := platform_get_resource_#in~arg1#1;platform_get_resource_~arg2#1 := platform_get_resource_#in~arg2#1; {6052#false} is VALID [2022-02-20 22:08:04,457 INFO L272 TraceCheckUtils]: 12: Hoare triple {6052#false} call platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset := ldv_malloc(56); {6062#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:08:04,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {6062#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {6051#true} is VALID [2022-02-20 22:08:04,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {6051#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {6051#true} is VALID [2022-02-20 22:08:04,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {6051#true} assume true; {6051#true} is VALID [2022-02-20 22:08:04,457 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6051#true} {6052#false} #469#return; {6052#false} is VALID [2022-02-20 22:08:04,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {6052#false} platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset := platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset;havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {6052#false} #t~ret47#1.base, #t~ret47#1.offset := platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;assume { :end_inline_platform_get_resource } true;~irq_res~0#1.base, ~irq_res~0#1.offset := #t~ret47#1.base, #t~ret47#1.offset;havoc #t~ret47#1.base, #t~ret47#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {6052#false} assume !(0 == (~irq_res~0#1.base + ~irq_res~0#1.offset) % 18446744073709551616);call #t~mem49#1 := read~int(~irq_res~0#1.base, 24 + ~irq_res~0#1.offset, 8); {6052#false} is VALID [2022-02-20 22:08:04,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {6052#false} assume !false; {6052#false} is VALID [2022-02-20 22:08:04,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {6052#false} assume !false; {6052#false} is VALID [2022-02-20 22:08:04,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {6052#false} assume !false; {6052#false} is VALID [2022-02-20 22:08:04,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {6052#false} assume (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) >= 0;abs_2898 := (if (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) < 128 then 128 else (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))));assume (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) >= 0;assume ~irqflags~0#1 >= abs_2898; {6052#false} is VALID [2022-02-20 22:08:04,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {6052#false} havoc #t~mem49#1;call #t~mem51#1 := read~int(~irq_res~0#1.base, ~irq_res~0#1.offset, 8);~irq~0#1 := (if #t~mem51#1 % 18446744073709551616 % 4294967296 <= 2147483647 then #t~mem51#1 % 18446744073709551616 % 4294967296 else #t~mem51#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem51#1;havoc #t~nondet52#1.base, #t~nondet52#1.offset;~trig~0#1.base, ~trig~0#1.offset := #t~nondet52#1.base, #t~nondet52#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {6052#false} assume !(0 == (~trig~0#1.base + ~trig~0#1.offset) % 18446744073709551616);assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 4, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;assume { :begin_inline_kmalloc } true;kmalloc_#in~size#1, kmalloc_#in~flags#1 := kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768);havoc kmalloc_#res#1.base, kmalloc_#res#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset, kmalloc_~size#1, kmalloc_~flags#1, kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;kmalloc_~size#1 := kmalloc_#in~size#1;kmalloc_~flags#1 := kmalloc_#in~flags#1;havoc kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := kmalloc_~size#1, kmalloc_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {6052#false} is VALID [2022-02-20 22:08:04,459 INFO L272 TraceCheckUtils]: 26: Hoare triple {6052#false} call __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset := ldv_malloc(__kmalloc_~size#1); {6062#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:08:04,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {6062#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {6051#true} is VALID [2022-02-20 22:08:04,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {6051#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {6051#true} is VALID [2022-02-20 22:08:04,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {6051#true} assume true; {6051#true} is VALID [2022-02-20 22:08:04,460 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6051#true} {6052#false} #471#return; {6052#false} is VALID [2022-02-20 22:08:04,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {6052#false} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {6052#false} kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset := kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;kmalloc_#res#1.base, kmalloc_#res#1.offset := kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {6052#false} kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset := kmalloc_#res#1.base, kmalloc_#res#1.offset;assume { :end_inline_kmalloc } true;kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset := kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {6052#false} #t~ret53#1.base, #t~ret53#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;~tmp~10#1.base, ~tmp~10#1.offset := #t~ret53#1.base, #t~ret53#1.offset;havoc #t~ret53#1.base, #t~ret53#1.offset;~trig_info~0#1.base, ~trig_info~0#1.offset := ~tmp~10#1.base, ~tmp~10#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {6052#false} assume 0 == (~trig_info~0#1.base + ~trig_info~0#1.offset) % 18446744073709551616;~ret~0#1 := -12; {6052#false} is VALID [2022-02-20 22:08:04,461 INFO L272 TraceCheckUtils]: 36: Hoare triple {6052#false} call iio_trigger_put(~trig~0#1.base, ~trig~0#1.offset); {6052#false} is VALID [2022-02-20 22:08:04,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {6052#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {6052#false} is VALID [2022-02-20 22:08:04,461 INFO L272 TraceCheckUtils]: 38: Hoare triple {6052#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {6052#false} is VALID [2022-02-20 22:08:04,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {6052#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {6052#false} is VALID [2022-02-20 22:08:04,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {6052#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {6052#false} is VALID [2022-02-20 22:08:04,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {6052#false} assume ~ldv_module_refcounter~0 <= 1; {6052#false} is VALID [2022-02-20 22:08:04,462 INFO L272 TraceCheckUtils]: 42: Hoare triple {6052#false} call ldv_error(); {6052#false} is VALID [2022-02-20 22:08:04,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {6052#false} assume !false; {6052#false} is VALID [2022-02-20 22:08:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 22:08:04,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:08:04,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096959948] [2022-02-20 22:08:04,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096959948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:04,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:04,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:08:04,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716963612] [2022-02-20 22:08:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-02-20 22:08:04,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:04,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:04,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:04,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:08:04,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:08:04,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:08:04,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:08:04,503 INFO L87 Difference]: Start difference. First operand 336 states and 441 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:05,137 INFO L93 Difference]: Finished difference Result 842 states and 1130 transitions. [2022-02-20 22:08:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:08:05,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-02-20 22:08:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-02-20 22:08:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-02-20 22:08:05,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-02-20 22:08:05,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:05,572 INFO L225 Difference]: With dead ends: 842 [2022-02-20 22:08:05,573 INFO L226 Difference]: Without dead ends: 509 [2022-02-20 22:08:05,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 22:08:05,574 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 167 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:05,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 572 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 22:08:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-02-20 22:08:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 417. [2022-02-20 22:08:05,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:05,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 417 states, 332 states have (on average 1.3343373493975903) internal successors, (443), 336 states have internal predecessors, (443), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:05,600 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 417 states, 332 states have (on average 1.3343373493975903) internal successors, (443), 336 states have internal predecessors, (443), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:05,601 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 417 states, 332 states have (on average 1.3343373493975903) internal successors, (443), 336 states have internal predecessors, (443), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:05,618 INFO L93 Difference]: Finished difference Result 509 states and 690 transitions. [2022-02-20 22:08:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 690 transitions. [2022-02-20 22:08:05,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:05,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:05,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 417 states, 332 states have (on average 1.3343373493975903) internal successors, (443), 336 states have internal predecessors, (443), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 509 states. [2022-02-20 22:08:05,621 INFO L87 Difference]: Start difference. First operand has 417 states, 332 states have (on average 1.3343373493975903) internal successors, (443), 336 states have internal predecessors, (443), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 509 states. [2022-02-20 22:08:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:05,635 INFO L93 Difference]: Finished difference Result 509 states and 690 transitions. [2022-02-20 22:08:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 690 transitions. [2022-02-20 22:08:05,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:05,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:05,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:05,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 332 states have (on average 1.3343373493975903) internal successors, (443), 336 states have internal predecessors, (443), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 556 transitions. [2022-02-20 22:08:05,651 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 556 transitions. Word has length 44 [2022-02-20 22:08:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:05,651 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 556 transitions. [2022-02-20 22:08:05,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 556 transitions. [2022-02-20 22:08:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 22:08:05,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:05,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:05,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 22:08:05,653 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2105893758, now seen corresponding path program 1 times [2022-02-20 22:08:05,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:05,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806298556] [2022-02-20 22:08:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 22:08:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:05,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {8847#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8827#true} is VALID [2022-02-20 22:08:05,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:05,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8827#true} {8827#true} #513#return; {8827#true} is VALID [2022-02-20 22:08:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 22:08:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:05,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {8827#true} ~cond := #in~cond; {8827#true} is VALID [2022-02-20 22:08:05,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {8827#true} assume !(0 == ~cond); {8827#true} is VALID [2022-02-20 22:08:05,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:05,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8827#true} {8827#true} #515#return; {8827#true} is VALID [2022-02-20 22:08:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 22:08:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:05,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {8848#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8827#true} is VALID [2022-02-20 22:08:05,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {8827#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} is VALID [2022-02-20 22:08:05,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} assume true; {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} is VALID [2022-02-20 22:08:05,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} {8827#true} #469#return; {8840#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.offset| 0))} is VALID [2022-02-20 22:08:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:08:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:05,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {8848#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8827#true} is VALID [2022-02-20 22:08:05,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {8827#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8827#true} is VALID [2022-02-20 22:08:05,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:05,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8827#true} {8828#false} #471#return; {8828#false} is VALID [2022-02-20 22:08:05,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {8827#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {8827#true} is VALID [2022-02-20 22:08:05,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {8827#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {8827#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {8827#true} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {8827#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {8827#true} assume main_#t~switch75#1; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {8827#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {8827#true} assume !main_#t~switch77#1;main_#t~switch77#1 := main_#t~switch77#1 || 1 == main_~tmp___0~4#1; {8827#true} is VALID [2022-02-20 22:08:05,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {8827#true} assume main_#t~switch77#1; {8827#true} is VALID [2022-02-20 22:08:05,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {8827#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret86#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet92#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;assume -2147483648 <= __platform_driver_register_#t~nondet92#1 && __platform_driver_register_#t~nondet92#1 <= 2147483647;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet92#1;havoc __platform_driver_register_#t~nondet92#1; {8827#true} is VALID [2022-02-20 22:08:05,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {8827#true} ldv___platform_driver_register_10_#t~ret86#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;assume -2147483648 <= ldv___platform_driver_register_10_#t~ret86#1 && ldv___platform_driver_register_10_#t~ret86#1 <= 2147483647;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret86#1;havoc ldv___platform_driver_register_10_#t~ret86#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {8827#true} is VALID [2022-02-20 22:08:05,829 INFO L272 TraceCheckUtils]: 11: Hoare triple {8827#true} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {8847#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:08:05,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {8847#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8827#true} is VALID [2022-02-20 22:08:05,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:05,829 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8827#true} {8827#true} #513#return; {8827#true} is VALID [2022-02-20 22:08:05,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {8827#true} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {8827#true} is VALID [2022-02-20 22:08:05,829 INFO L272 TraceCheckUtils]: 16: Hoare triple {8827#true} call assume_abort_if_not((if 0 != (ldv_init_zalloc_~p~2#1.base + ldv_init_zalloc_~p~2#1.offset) % 18446744073709551616 then 1 else 0)); {8827#true} is VALID [2022-02-20 22:08:05,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {8827#true} ~cond := #in~cond; {8827#true} is VALID [2022-02-20 22:08:05,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {8827#true} assume !(0 == ~cond); {8827#true} is VALID [2022-02-20 22:08:05,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:05,830 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8827#true} {8827#true} #515#return; {8827#true} is VALID [2022-02-20 22:08:05,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {8827#true} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {8827#true} is VALID [2022-02-20 22:08:05,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {8827#true} ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {8827#true} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {8827#true} iio_interrupt_trigger_driver_init_#t~ret60#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;assume -2147483648 <= iio_interrupt_trigger_driver_init_#t~ret60#1 && iio_interrupt_trigger_driver_init_#t~ret60#1 <= 2147483647;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret60#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {8827#true} main_#t~ret78#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;assume -2147483648 <= main_#t~ret78#1 && main_#t~ret78#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret78#1;havoc main_#t~ret78#1; {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {8827#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {8827#true} assume !(0 != ~ldv_retval_0~0); {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {8827#true} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:05,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {8827#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:05,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {8827#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 2 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:05,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {8827#true} assume main_#t~switch75#1; {8827#true} is VALID [2022-02-20 22:08:05,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {8827#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet79#1 && main_#t~nondet79#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet79#1;havoc main_#t~nondet79#1;main_#t~switch80#1 := 0 == main_~tmp___1~0#1; {8827#true} is VALID [2022-02-20 22:08:05,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {8827#true} assume main_#t~switch80#1; {8827#true} is VALID [2022-02-20 22:08:05,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {8827#true} assume 1 == ~ldv_state_variable_2~0; {8827#true} is VALID [2022-02-20 22:08:05,832 INFO L272 TraceCheckUtils]: 35: Hoare triple {8827#true} call main_#t~ret81#1 := iio_interrupt_trigger_probe(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {8827#true} is VALID [2022-02-20 22:08:05,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {8827#true} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig_info~0#1.base, ~trig_info~0#1.offset;havoc ~trig~0#1.base, ~trig~0#1.offset;havoc ~irqflags~0#1;havoc ~irq_res~0#1.base, ~irq_res~0#1.offset;havoc ~irq~0#1;havoc ~ret~0#1;havoc ~tmp~10#1.base, ~tmp~10#1.offset;~ret~0#1 := 0;assume { :begin_inline_platform_get_resource } true;platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset, platform_get_resource_#in~arg1#1, platform_get_resource_#in~arg2#1 := ~pdev#1.base, ~pdev#1.offset, 1024, 0;havoc platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset, platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset, platform_get_resource_~arg1#1, platform_get_resource_~arg2#1;platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset := platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset;platform_get_resource_~arg1#1 := platform_get_resource_#in~arg1#1;platform_get_resource_~arg2#1 := platform_get_resource_#in~arg2#1; {8827#true} is VALID [2022-02-20 22:08:05,833 INFO L272 TraceCheckUtils]: 37: Hoare triple {8827#true} call platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset := ldv_malloc(56); {8848#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:08:05,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {8848#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8827#true} is VALID [2022-02-20 22:08:05,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {8827#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} is VALID [2022-02-20 22:08:05,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} assume true; {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} is VALID [2022-02-20 22:08:05,835 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} {8827#true} #469#return; {8840#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.offset| 0))} is VALID [2022-02-20 22:08:05,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {8840#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.offset| 0))} platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset := platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset;havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset; {8841#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.offset| 0))} is VALID [2022-02-20 22:08:05,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {8841#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.offset| 0))} #t~ret47#1.base, #t~ret47#1.offset := platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;assume { :end_inline_platform_get_resource } true;~irq_res~0#1.base, ~irq_res~0#1.offset := #t~ret47#1.base, #t~ret47#1.offset;havoc #t~ret47#1.base, #t~ret47#1.offset; {8842#(and (= |iio_interrupt_trigger_probe_~irq_res~0#1.base| 0) (= |iio_interrupt_trigger_probe_~irq_res~0#1.offset| 0))} is VALID [2022-02-20 22:08:05,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {8842#(and (= |iio_interrupt_trigger_probe_~irq_res~0#1.base| 0) (= |iio_interrupt_trigger_probe_~irq_res~0#1.offset| 0))} assume !(0 == (~irq_res~0#1.base + ~irq_res~0#1.offset) % 18446744073709551616);call #t~mem49#1 := read~int(~irq_res~0#1.base, 24 + ~irq_res~0#1.offset, 8); {8828#false} is VALID [2022-02-20 22:08:05,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:05,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:05,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:05,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {8828#false} assume (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) >= 0;abs_2898 := (if (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) < 128 then 128 else (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))));assume (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) >= 0;assume ~irqflags~0#1 >= abs_2898; {8828#false} is VALID [2022-02-20 22:08:05,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {8828#false} havoc #t~mem49#1;call #t~mem51#1 := read~int(~irq_res~0#1.base, ~irq_res~0#1.offset, 8);~irq~0#1 := (if #t~mem51#1 % 18446744073709551616 % 4294967296 <= 2147483647 then #t~mem51#1 % 18446744073709551616 % 4294967296 else #t~mem51#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem51#1;havoc #t~nondet52#1.base, #t~nondet52#1.offset;~trig~0#1.base, ~trig~0#1.offset := #t~nondet52#1.base, #t~nondet52#1.offset; {8828#false} is VALID [2022-02-20 22:08:05,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {8828#false} assume !(0 == (~trig~0#1.base + ~trig~0#1.offset) % 18446744073709551616);assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 4, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;assume { :begin_inline_kmalloc } true;kmalloc_#in~size#1, kmalloc_#in~flags#1 := kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768);havoc kmalloc_#res#1.base, kmalloc_#res#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset, kmalloc_~size#1, kmalloc_~flags#1, kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;kmalloc_~size#1 := kmalloc_#in~size#1;kmalloc_~flags#1 := kmalloc_#in~flags#1;havoc kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := kmalloc_~size#1, kmalloc_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {8828#false} is VALID [2022-02-20 22:08:05,837 INFO L272 TraceCheckUtils]: 51: Hoare triple {8828#false} call __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset := ldv_malloc(__kmalloc_~size#1); {8848#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:08:05,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {8848#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8827#true} is VALID [2022-02-20 22:08:05,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {8827#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8827#true} is VALID [2022-02-20 22:08:05,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:05,838 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8827#true} {8828#false} #471#return; {8828#false} is VALID [2022-02-20 22:08:05,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {8828#false} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; {8828#false} is VALID [2022-02-20 22:08:05,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {8828#false} kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset := kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;kmalloc_#res#1.base, kmalloc_#res#1.offset := kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset; {8828#false} is VALID [2022-02-20 22:08:05,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {8828#false} kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset := kmalloc_#res#1.base, kmalloc_#res#1.offset;assume { :end_inline_kmalloc } true;kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset := kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset; {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {8828#false} #t~ret53#1.base, #t~ret53#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;~tmp~10#1.base, ~tmp~10#1.offset := #t~ret53#1.base, #t~ret53#1.offset;havoc #t~ret53#1.base, #t~ret53#1.offset;~trig_info~0#1.base, ~trig_info~0#1.offset := ~tmp~10#1.base, ~tmp~10#1.offset; {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {8828#false} assume 0 == (~trig_info~0#1.base + ~trig_info~0#1.offset) % 18446744073709551616;~ret~0#1 := -12; {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L272 TraceCheckUtils]: 61: Hoare triple {8828#false} call iio_trigger_put(~trig~0#1.base, ~trig~0#1.offset); {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {8828#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L272 TraceCheckUtils]: 63: Hoare triple {8828#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {8828#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {8828#false} is VALID [2022-02-20 22:08:05,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {8828#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {8828#false} is VALID [2022-02-20 22:08:05,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {8828#false} assume ~ldv_module_refcounter~0 <= 1; {8828#false} is VALID [2022-02-20 22:08:05,840 INFO L272 TraceCheckUtils]: 67: Hoare triple {8828#false} call ldv_error(); {8828#false} is VALID [2022-02-20 22:08:05,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 22:08:05,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:08:05,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806298556] [2022-02-20 22:08:05,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806298556] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 22:08:05,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964828287] [2022-02-20 22:08:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:05,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 22:08:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:08:05,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 22:08:05,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 22:08:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:06,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 22:08:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:06,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:06,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {8827#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {8827#true} is VALID [2022-02-20 22:08:06,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {8827#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {8827#true} is VALID [2022-02-20 22:08:06,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {8827#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {8827#true} is VALID [2022-02-20 22:08:06,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {8827#true} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:06,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {8827#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:06,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {8827#true} assume main_#t~switch75#1; {8827#true} is VALID [2022-02-20 22:08:06,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {8827#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {8827#true} is VALID [2022-02-20 22:08:06,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {8827#true} assume !main_#t~switch77#1;main_#t~switch77#1 := main_#t~switch77#1 || 1 == main_~tmp___0~4#1; {8827#true} is VALID [2022-02-20 22:08:06,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {8827#true} assume main_#t~switch77#1; {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {8827#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret86#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet92#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;assume -2147483648 <= __platform_driver_register_#t~nondet92#1 && __platform_driver_register_#t~nondet92#1 <= 2147483647;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet92#1;havoc __platform_driver_register_#t~nondet92#1; {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {8827#true} ldv___platform_driver_register_10_#t~ret86#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;assume -2147483648 <= ldv___platform_driver_register_10_#t~ret86#1 && ldv___platform_driver_register_10_#t~ret86#1 <= 2147483647;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret86#1;havoc ldv___platform_driver_register_10_#t~ret86#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L272 TraceCheckUtils]: 11: Hoare triple {8827#true} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {8827#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8827#true} {8827#true} #513#return; {8827#true} is VALID [2022-02-20 22:08:06,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {8827#true} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {8827#true} is VALID [2022-02-20 22:08:06,317 INFO L272 TraceCheckUtils]: 16: Hoare triple {8827#true} call assume_abort_if_not((if 0 != (ldv_init_zalloc_~p~2#1.base + ldv_init_zalloc_~p~2#1.offset) % 18446744073709551616 then 1 else 0)); {8827#true} is VALID [2022-02-20 22:08:06,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {8827#true} ~cond := #in~cond; {8827#true} is VALID [2022-02-20 22:08:06,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {8827#true} assume !(0 == ~cond); {8827#true} is VALID [2022-02-20 22:08:06,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {8827#true} assume true; {8827#true} is VALID [2022-02-20 22:08:06,317 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8827#true} {8827#true} #515#return; {8827#true} is VALID [2022-02-20 22:08:06,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {8827#true} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {8827#true} is VALID [2022-02-20 22:08:06,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {8827#true} ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {8827#true} is VALID [2022-02-20 22:08:06,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {8827#true} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {8827#true} is VALID [2022-02-20 22:08:06,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {8827#true} iio_interrupt_trigger_driver_init_#t~ret60#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;assume -2147483648 <= iio_interrupt_trigger_driver_init_#t~ret60#1 && iio_interrupt_trigger_driver_init_#t~ret60#1 <= 2147483647;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret60#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {8827#true} is VALID [2022-02-20 22:08:06,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {8827#true} main_#t~ret78#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;assume -2147483648 <= main_#t~ret78#1 && main_#t~ret78#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret78#1;havoc main_#t~ret78#1; {8827#true} is VALID [2022-02-20 22:08:06,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {8827#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {8827#true} is VALID [2022-02-20 22:08:06,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {8827#true} assume !(0 != ~ldv_retval_0~0); {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {8827#true} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {8827#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {8827#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 2 == main_~tmp~16#1; {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {8827#true} assume main_#t~switch75#1; {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {8827#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet79#1 && main_#t~nondet79#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet79#1;havoc main_#t~nondet79#1;main_#t~switch80#1 := 0 == main_~tmp___1~0#1; {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {8827#true} assume main_#t~switch80#1; {8827#true} is VALID [2022-02-20 22:08:06,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {8827#true} assume 1 == ~ldv_state_variable_2~0; {8827#true} is VALID [2022-02-20 22:08:06,320 INFO L272 TraceCheckUtils]: 35: Hoare triple {8827#true} call main_#t~ret81#1 := iio_interrupt_trigger_probe(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {8827#true} is VALID [2022-02-20 22:08:06,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {8827#true} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig_info~0#1.base, ~trig_info~0#1.offset;havoc ~trig~0#1.base, ~trig~0#1.offset;havoc ~irqflags~0#1;havoc ~irq_res~0#1.base, ~irq_res~0#1.offset;havoc ~irq~0#1;havoc ~ret~0#1;havoc ~tmp~10#1.base, ~tmp~10#1.offset;~ret~0#1 := 0;assume { :begin_inline_platform_get_resource } true;platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset, platform_get_resource_#in~arg1#1, platform_get_resource_#in~arg2#1 := ~pdev#1.base, ~pdev#1.offset, 1024, 0;havoc platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset, platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset, platform_get_resource_~arg1#1, platform_get_resource_~arg2#1;platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset := platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset;platform_get_resource_~arg1#1 := platform_get_resource_#in~arg1#1;platform_get_resource_~arg2#1 := platform_get_resource_#in~arg2#1; {8827#true} is VALID [2022-02-20 22:08:06,320 INFO L272 TraceCheckUtils]: 37: Hoare triple {8827#true} call platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset := ldv_malloc(56); {8827#true} is VALID [2022-02-20 22:08:06,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {8827#true} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8827#true} is VALID [2022-02-20 22:08:06,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {8827#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} is VALID [2022-02-20 22:08:06,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} assume true; {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} is VALID [2022-02-20 22:08:06,322 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8849#(and (<= 0 |ldv_malloc_#res.base|) (<= |ldv_malloc_#res.offset| 0) (<= |ldv_malloc_#res.base| 0) (<= 0 |ldv_malloc_#res.offset|))} {8827#true} #469#return; {8840#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.offset| 0))} is VALID [2022-02-20 22:08:06,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {8840#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#t~ret95#1.offset| 0))} platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset := platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset;havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset; {8841#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.offset| 0))} is VALID [2022-02-20 22:08:06,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {8841#(and (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.base| 0) (= |iio_interrupt_trigger_probe_platform_get_resource_#res#1.offset| 0))} #t~ret47#1.base, #t~ret47#1.offset := platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;assume { :end_inline_platform_get_resource } true;~irq_res~0#1.base, ~irq_res~0#1.offset := #t~ret47#1.base, #t~ret47#1.offset;havoc #t~ret47#1.base, #t~ret47#1.offset; {8842#(and (= |iio_interrupt_trigger_probe_~irq_res~0#1.base| 0) (= |iio_interrupt_trigger_probe_~irq_res~0#1.offset| 0))} is VALID [2022-02-20 22:08:06,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {8842#(and (= |iio_interrupt_trigger_probe_~irq_res~0#1.base| 0) (= |iio_interrupt_trigger_probe_~irq_res~0#1.offset| 0))} assume !(0 == (~irq_res~0#1.base + ~irq_res~0#1.offset) % 18446744073709551616);call #t~mem49#1 := read~int(~irq_res~0#1.base, 24 + ~irq_res~0#1.offset, 8); {8828#false} is VALID [2022-02-20 22:08:06,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:06,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:06,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:06,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {8828#false} assume (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) >= 0;abs_2898 := (if (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) < 128 then 128 else (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))));assume (if 0 == #t~mem49#1 then 0 else (if 1 == #t~mem49#1 then 1 else ~bitwiseAnd(#t~mem49#1, 15))) >= 0;assume ~irqflags~0#1 >= abs_2898; {8828#false} is VALID [2022-02-20 22:08:06,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {8828#false} havoc #t~mem49#1;call #t~mem51#1 := read~int(~irq_res~0#1.base, ~irq_res~0#1.offset, 8);~irq~0#1 := (if #t~mem51#1 % 18446744073709551616 % 4294967296 <= 2147483647 then #t~mem51#1 % 18446744073709551616 % 4294967296 else #t~mem51#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem51#1;havoc #t~nondet52#1.base, #t~nondet52#1.offset;~trig~0#1.base, ~trig~0#1.offset := #t~nondet52#1.base, #t~nondet52#1.offset; {8828#false} is VALID [2022-02-20 22:08:06,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {8828#false} assume !(0 == (~trig~0#1.base + ~trig~0#1.offset) % 18446744073709551616);assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 4, 208;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;assume { :begin_inline_kmalloc } true;kmalloc_#in~size#1, kmalloc_#in~flags#1 := kzalloc_~size#1, ~bitwiseOr(kzalloc_~flags#1, 32768);havoc kmalloc_#res#1.base, kmalloc_#res#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset, kmalloc_~size#1, kmalloc_~flags#1, kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;kmalloc_~size#1 := kmalloc_#in~size#1;kmalloc_~flags#1 := kmalloc_#in~flags#1;havoc kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := kmalloc_~size#1, kmalloc_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {8828#false} is VALID [2022-02-20 22:08:06,324 INFO L272 TraceCheckUtils]: 51: Hoare triple {8828#false} call __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset := ldv_malloc(__kmalloc_~size#1); {8828#false} is VALID [2022-02-20 22:08:06,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {8828#false} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {8828#false} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {8828#false} assume true; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8828#false} {8828#false} #471#return; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {8828#false} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {8828#false} kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset := kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;kmalloc_#res#1.base, kmalloc_#res#1.offset := kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {8828#false} kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset := kmalloc_#res#1.base, kmalloc_#res#1.offset;assume { :end_inline_kmalloc } true;kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset := kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset; {8828#false} is VALID [2022-02-20 22:08:06,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {8828#false} #t~ret53#1.base, #t~ret53#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;~tmp~10#1.base, ~tmp~10#1.offset := #t~ret53#1.base, #t~ret53#1.offset;havoc #t~ret53#1.base, #t~ret53#1.offset;~trig_info~0#1.base, ~trig_info~0#1.offset := ~tmp~10#1.base, ~tmp~10#1.offset; {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {8828#false} assume 0 == (~trig_info~0#1.base + ~trig_info~0#1.offset) % 18446744073709551616;~ret~0#1 := -12; {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L272 TraceCheckUtils]: 61: Hoare triple {8828#false} call iio_trigger_put(~trig~0#1.base, ~trig~0#1.offset); {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {8828#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L272 TraceCheckUtils]: 63: Hoare triple {8828#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {8828#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {8828#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {8828#false} is VALID [2022-02-20 22:08:06,326 INFO L290 TraceCheckUtils]: 66: Hoare triple {8828#false} assume ~ldv_module_refcounter~0 <= 1; {8828#false} is VALID [2022-02-20 22:08:06,327 INFO L272 TraceCheckUtils]: 67: Hoare triple {8828#false} call ldv_error(); {8828#false} is VALID [2022-02-20 22:08:06,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {8828#false} assume !false; {8828#false} is VALID [2022-02-20 22:08:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 22:08:06,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:06,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964828287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:06,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 22:08:06,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-02-20 22:08:06,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208013474] [2022-02-20 22:08:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:06,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2022-02-20 22:08:06,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:06,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:06,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:06,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:08:06,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:08:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:08:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 22:08:06,370 INFO L87 Difference]: Start difference. First operand 417 states and 556 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:06,980 INFO L93 Difference]: Finished difference Result 845 states and 1129 transitions. [2022-02-20 22:08:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 22:08:06,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2022-02-20 22:08:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2022-02-20 22:08:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2022-02-20 22:08:06,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 471 transitions. [2022-02-20 22:08:07,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:07,293 INFO L225 Difference]: With dead ends: 845 [2022-02-20 22:08:07,293 INFO L226 Difference]: Without dead ends: 431 [2022-02-20 22:08:07,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:08:07,295 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 5 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:07,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1139 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-02-20 22:08:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2022-02-20 22:08:07,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:07,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 431 states. Second operand has 427 states, 340 states have (on average 1.326470588235294) internal successors, (451), 344 states have internal predecessors, (451), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:07,315 INFO L74 IsIncluded]: Start isIncluded. First operand 431 states. Second operand has 427 states, 340 states have (on average 1.326470588235294) internal successors, (451), 344 states have internal predecessors, (451), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:07,315 INFO L87 Difference]: Start difference. First operand 431 states. Second operand has 427 states, 340 states have (on average 1.326470588235294) internal successors, (451), 344 states have internal predecessors, (451), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:07,327 INFO L93 Difference]: Finished difference Result 431 states and 572 transitions. [2022-02-20 22:08:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 572 transitions. [2022-02-20 22:08:07,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:07,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:07,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 427 states, 340 states have (on average 1.326470588235294) internal successors, (451), 344 states have internal predecessors, (451), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) Second operand 431 states. [2022-02-20 22:08:07,330 INFO L87 Difference]: Start difference. First operand has 427 states, 340 states have (on average 1.326470588235294) internal successors, (451), 344 states have internal predecessors, (451), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) Second operand 431 states. [2022-02-20 22:08:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:07,343 INFO L93 Difference]: Finished difference Result 431 states and 572 transitions. [2022-02-20 22:08:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 572 transitions. [2022-02-20 22:08:07,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:07,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:07,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:07,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 340 states have (on average 1.326470588235294) internal successors, (451), 344 states have internal predecessors, (451), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 568 transitions. [2022-02-20 22:08:07,357 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 568 transitions. Word has length 69 [2022-02-20 22:08:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:07,357 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 568 transitions. [2022-02-20 22:08:07,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 568 transitions. [2022-02-20 22:08:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 22:08:07,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:07,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:07,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 22:08:07,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 22:08:07,581 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:07,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1186291656, now seen corresponding path program 1 times [2022-02-20 22:08:07,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:07,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293083095] [2022-02-20 22:08:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 22:08:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {11682#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11654#true} is VALID [2022-02-20 22:08:07,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11658#(not (= ~probed_2~0 1))} #513#return; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 22:08:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {11654#true} ~cond := #in~cond; {11654#true} is VALID [2022-02-20 22:08:07,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume !(0 == ~cond); {11654#true} is VALID [2022-02-20 22:08:07,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11658#(not (= ~probed_2~0 1))} #515#return; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:08:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {11654#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~dev.base, 477 + ~dev.offset, 8);#res.base, #res.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; {11654#true} is VALID [2022-02-20 22:08:07,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11655#false} #489#return; {11655#false} is VALID [2022-02-20 22:08:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 22:08:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {11654#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~dev.base, 477 + ~dev.offset, 8);#res.base, #res.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; {11654#true} is VALID [2022-02-20 22:08:07,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11655#false} #491#return; {11655#false} is VALID [2022-02-20 22:08:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:08:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {11654#true} ~arg0 := #in~arg0;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {11654#true} is VALID [2022-02-20 22:08:07,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11655#false} #493#return; {11655#false} is VALID [2022-02-20 22:08:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 22:08:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {11683#(and (= ~ldv_irq_1_0~0 |old(~ldv_irq_1_0~0)|) (= ~ldv_irq_1_2~0 |old(~ldv_irq_1_2~0)|) (= ~ldv_irq_1_1~0 |old(~ldv_irq_1_1~0)|) (= ~ldv_irq_1_3~0 |old(~ldv_irq_1_3~0)|))} ~line := #in~line;~data.base, ~data.offset := #in~data.base, #in~data.offset; {11654#true} is VALID [2022-02-20 22:08:07,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume 0 != ~ldv_irq_1_0~0 && ~line == ~ldv_irq_line_1_0~0;~ldv_irq_1_0~0 := 0; {11654#true} is VALID [2022-02-20 22:08:07,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11655#false} #495#return; {11655#false} is VALID [2022-02-20 22:08:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 22:08:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {11684#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {11654#true} is VALID [2022-02-20 22:08:07,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11655#false} #497#return; {11655#false} is VALID [2022-02-20 22:08:07,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {11654#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {11656#(= ~probed_2~0 0)} is VALID [2022-02-20 22:08:07,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#(= ~probed_2~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {11656#(= ~probed_2~0 0)} is VALID [2022-02-20 22:08:07,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#(= ~probed_2~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} is VALID [2022-02-20 22:08:07,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} is VALID [2022-02-20 22:08:07,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} is VALID [2022-02-20 22:08:07,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} assume main_#t~switch75#1; {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} is VALID [2022-02-20 22:08:07,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {11657#(and (= ~ldv_state_variable_0~0 1) (= ~probed_2~0 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {11658#(not (= ~probed_2~0 1))} assume !main_#t~switch77#1;main_#t~switch77#1 := main_#t~switch77#1 || 1 == main_~tmp___0~4#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {11658#(not (= ~probed_2~0 1))} assume main_#t~switch77#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {11658#(not (= ~probed_2~0 1))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret86#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet92#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;assume -2147483648 <= __platform_driver_register_#t~nondet92#1 && __platform_driver_register_#t~nondet92#1 <= 2147483647;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet92#1;havoc __platform_driver_register_#t~nondet92#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {11658#(not (= ~probed_2~0 1))} ldv___platform_driver_register_10_#t~ret86#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;assume -2147483648 <= ldv___platform_driver_register_10_#t~ret86#1 && ldv___platform_driver_register_10_#t~ret86#1 <= 2147483647;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret86#1;havoc ldv___platform_driver_register_10_#t~ret86#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,703 INFO L272 TraceCheckUtils]: 11: Hoare triple {11658#(not (= ~probed_2~0 1))} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {11682#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:08:07,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {11682#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11654#true} is VALID [2022-02-20 22:08:07,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,704 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11654#true} {11658#(not (= ~probed_2~0 1))} #513#return; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {11658#(not (= ~probed_2~0 1))} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,704 INFO L272 TraceCheckUtils]: 16: Hoare triple {11658#(not (= ~probed_2~0 1))} call assume_abort_if_not((if 0 != (ldv_init_zalloc_~p~2#1.base + ldv_init_zalloc_~p~2#1.offset) % 18446744073709551616 then 1 else 0)); {11654#true} is VALID [2022-02-20 22:08:07,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {11654#true} ~cond := #in~cond; {11654#true} is VALID [2022-02-20 22:08:07,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {11654#true} assume !(0 == ~cond); {11654#true} is VALID [2022-02-20 22:08:07,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,705 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11654#true} {11658#(not (= ~probed_2~0 1))} #515#return; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {11658#(not (= ~probed_2~0 1))} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {11658#(not (= ~probed_2~0 1))} ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {11658#(not (= ~probed_2~0 1))} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {11658#(not (= ~probed_2~0 1))} iio_interrupt_trigger_driver_init_#t~ret60#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;assume -2147483648 <= iio_interrupt_trigger_driver_init_#t~ret60#1 && iio_interrupt_trigger_driver_init_#t~ret60#1 <= 2147483647;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret60#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {11658#(not (= ~probed_2~0 1))} main_#t~ret78#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;assume -2147483648 <= main_#t~ret78#1 && main_#t~ret78#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret78#1;havoc main_#t~ret78#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {11658#(not (= ~probed_2~0 1))} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {11658#(not (= ~probed_2~0 1))} assume !(0 != ~ldv_retval_0~0); {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {11658#(not (= ~probed_2~0 1))} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {11658#(not (= ~probed_2~0 1))} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {11658#(not (= ~probed_2~0 1))} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 2 == main_~tmp~16#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {11658#(not (= ~probed_2~0 1))} assume main_#t~switch75#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {11658#(not (= ~probed_2~0 1))} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet79#1 && main_#t~nondet79#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet79#1;havoc main_#t~nondet79#1;main_#t~switch80#1 := 0 == main_~tmp___1~0#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {11658#(not (= ~probed_2~0 1))} assume !main_#t~switch80#1;main_#t~switch80#1 := main_#t~switch80#1 || 1 == main_~tmp___1~0#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {11658#(not (= ~probed_2~0 1))} assume main_#t~switch80#1; {11658#(not (= ~probed_2~0 1))} is VALID [2022-02-20 22:08:07,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {11658#(not (= ~probed_2~0 1))} assume 1 == ~ldv_state_variable_2~0 && 1 == ~probed_2~0; {11655#false} is VALID [2022-02-20 22:08:07,711 INFO L272 TraceCheckUtils]: 36: Hoare triple {11655#false} call main_#t~ret82#1 := iio_interrupt_trigger_remove(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {11655#false} is VALID [2022-02-20 22:08:07,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {11655#false} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig~1#1.base, ~trig~1#1.offset;havoc ~trig_info~1#1.base, ~trig_info~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~2#1.base, ~tmp___0~2#1.offset;assume { :begin_inline_platform_get_drvdata } true;platform_get_drvdata_#in~pdev#1.base, platform_get_drvdata_#in~pdev#1.offset := ~pdev#1.base, ~pdev#1.offset;havoc platform_get_drvdata_#res#1.base, platform_get_drvdata_#res#1.offset;havoc platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset, platform_get_drvdata_~pdev#1.base, platform_get_drvdata_~pdev#1.offset, platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset;platform_get_drvdata_~pdev#1.base, platform_get_drvdata_~pdev#1.offset := platform_get_drvdata_#in~pdev#1.base, platform_get_drvdata_#in~pdev#1.offset;havoc platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,711 INFO L272 TraceCheckUtils]: 38: Hoare triple {11655#false} call platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset := dev_get_drvdata(platform_get_drvdata_~pdev#1.base, 13 + platform_get_drvdata_~pdev#1.offset); {11654#true} is VALID [2022-02-20 22:08:07,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {11654#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~dev.base, 477 + ~dev.offset, 8);#res.base, #res.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; {11654#true} is VALID [2022-02-20 22:08:07,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,711 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11654#true} {11655#false} #489#return; {11655#false} is VALID [2022-02-20 22:08:07,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {11655#false} platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset := platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset;havoc platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset;platform_get_drvdata_#res#1.base, platform_get_drvdata_#res#1.offset := platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {11655#false} #t~ret57#1.base, #t~ret57#1.offset := platform_get_drvdata_#res#1.base, platform_get_drvdata_#res#1.offset;assume { :end_inline_platform_get_drvdata } true;~tmp~11#1.base, ~tmp~11#1.offset := #t~ret57#1.base, #t~ret57#1.offset;havoc #t~ret57#1.base, #t~ret57#1.offset;~trig~1#1.base, ~trig~1#1.offset := ~tmp~11#1.base, ~tmp~11#1.offset;assume { :begin_inline_iio_trigger_get_drvdata } true;iio_trigger_get_drvdata_#in~trig#1.base, iio_trigger_get_drvdata_#in~trig#1.offset := ~trig~1#1.base, ~trig~1#1.offset;havoc iio_trigger_get_drvdata_#res#1.base, iio_trigger_get_drvdata_#res#1.offset;havoc iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset, iio_trigger_get_drvdata_~trig#1.base, iio_trigger_get_drvdata_~trig#1.offset, iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset;iio_trigger_get_drvdata_~trig#1.base, iio_trigger_get_drvdata_~trig#1.offset := iio_trigger_get_drvdata_#in~trig#1.base, iio_trigger_get_drvdata_#in~trig#1.offset;havoc iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,712 INFO L272 TraceCheckUtils]: 44: Hoare triple {11655#false} call iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset := dev_get_drvdata(iio_trigger_get_drvdata_~trig#1.base, 20 + iio_trigger_get_drvdata_~trig#1.offset); {11654#true} is VALID [2022-02-20 22:08:07,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {11654#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~dev.base, 477 + ~dev.offset, 8);#res.base, #res.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; {11654#true} is VALID [2022-02-20 22:08:07,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,712 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11654#true} {11655#false} #491#return; {11655#false} is VALID [2022-02-20 22:08:07,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {11655#false} iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset := iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset;havoc iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset;iio_trigger_get_drvdata_#res#1.base, iio_trigger_get_drvdata_#res#1.offset := iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {11655#false} #t~ret58#1.base, #t~ret58#1.offset := iio_trigger_get_drvdata_#res#1.base, iio_trigger_get_drvdata_#res#1.offset;assume { :end_inline_iio_trigger_get_drvdata } true;~tmp___0~2#1.base, ~tmp___0~2#1.offset := #t~ret58#1.base, #t~ret58#1.offset;havoc #t~ret58#1.base, #t~ret58#1.offset;~trig_info~1#1.base, ~trig_info~1#1.offset := ~tmp___0~2#1.base, ~tmp___0~2#1.offset;assume { :begin_inline_iio_trigger_unregister } true;iio_trigger_unregister_#in~arg0#1.base, iio_trigger_unregister_#in~arg0#1.offset := ~trig~1#1.base, ~trig~1#1.offset;havoc iio_trigger_unregister_~arg0#1.base, iio_trigger_unregister_~arg0#1.offset;iio_trigger_unregister_~arg0#1.base, iio_trigger_unregister_~arg0#1.offset := iio_trigger_unregister_#in~arg0#1.base, iio_trigger_unregister_#in~arg0#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {11655#false} assume { :end_inline_iio_trigger_unregister } true;call #t~mem59#1 := read~int(~trig_info~1#1.base, ~trig_info~1#1.offset, 4);assume { :begin_inline_ldv_free_irq_9 } true;ldv_free_irq_9_#in~ldv_func_arg1#1, ldv_free_irq_9_#in~ldv_func_arg2#1.base, ldv_free_irq_9_#in~ldv_func_arg2#1.offset := #t~mem59#1, ~trig~1#1.base, ~trig~1#1.offset;havoc ldv_free_irq_9_~ldv_func_arg1#1, ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset;ldv_free_irq_9_~ldv_func_arg1#1 := ldv_free_irq_9_#in~ldv_func_arg1#1;ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset := ldv_free_irq_9_#in~ldv_func_arg2#1.base, ldv_free_irq_9_#in~ldv_func_arg2#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,713 INFO L272 TraceCheckUtils]: 51: Hoare triple {11655#false} call free_irq(ldv_free_irq_9_~ldv_func_arg1#1, ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset); {11654#true} is VALID [2022-02-20 22:08:07,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {11654#true} ~arg0 := #in~arg0;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {11654#true} is VALID [2022-02-20 22:08:07,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,720 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11654#true} {11655#false} #493#return; {11655#false} is VALID [2022-02-20 22:08:07,722 INFO L272 TraceCheckUtils]: 55: Hoare triple {11655#false} call disable_suitable_irq_1((if ldv_free_irq_9_~ldv_func_arg1#1 % 4294967296 % 4294967296 <= 2147483647 then ldv_free_irq_9_~ldv_func_arg1#1 % 4294967296 % 4294967296 else ldv_free_irq_9_~ldv_func_arg1#1 % 4294967296 % 4294967296 - 4294967296), ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset); {11683#(and (= ~ldv_irq_1_0~0 |old(~ldv_irq_1_0~0)|) (= ~ldv_irq_1_2~0 |old(~ldv_irq_1_2~0)|) (= ~ldv_irq_1_1~0 |old(~ldv_irq_1_1~0)|) (= ~ldv_irq_1_3~0 |old(~ldv_irq_1_3~0)|))} is VALID [2022-02-20 22:08:07,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {11683#(and (= ~ldv_irq_1_0~0 |old(~ldv_irq_1_0~0)|) (= ~ldv_irq_1_2~0 |old(~ldv_irq_1_2~0)|) (= ~ldv_irq_1_1~0 |old(~ldv_irq_1_1~0)|) (= ~ldv_irq_1_3~0 |old(~ldv_irq_1_3~0)|))} ~line := #in~line;~data.base, ~data.offset := #in~data.base, #in~data.offset; {11654#true} is VALID [2022-02-20 22:08:07,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {11654#true} assume 0 != ~ldv_irq_1_0~0 && ~line == ~ldv_irq_line_1_0~0;~ldv_irq_1_0~0 := 0; {11654#true} is VALID [2022-02-20 22:08:07,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,723 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11654#true} {11655#false} #495#return; {11655#false} is VALID [2022-02-20 22:08:07,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {11655#false} assume { :end_inline_ldv_free_irq_9 } true;havoc #t~mem59#1; {11655#false} is VALID [2022-02-20 22:08:07,723 INFO L272 TraceCheckUtils]: 61: Hoare triple {11655#false} call kfree(~trig_info~1#1.base, ~trig_info~1#1.offset); {11684#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 22:08:07,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {11684#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {11654#true} is VALID [2022-02-20 22:08:07,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-02-20 22:08:07,723 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11654#true} {11655#false} #497#return; {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L272 TraceCheckUtils]: 65: Hoare triple {11655#false} call iio_trigger_put(~trig~1#1.base, ~trig~1#1.offset); {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {11655#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L272 TraceCheckUtils]: 67: Hoare triple {11655#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {11655#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {11655#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {11655#false} assume ~ldv_module_refcounter~0 <= 1; {11655#false} is VALID [2022-02-20 22:08:07,724 INFO L272 TraceCheckUtils]: 71: Hoare triple {11655#false} call ldv_error(); {11655#false} is VALID [2022-02-20 22:08:07,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-02-20 22:08:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 22:08:07,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:08:07,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293083095] [2022-02-20 22:08:07,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293083095] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 22:08:07,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292873194] [2022-02-20 22:08:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:07,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 22:08:07,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:08:07,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 22:08:07,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 22:08:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:08:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:07,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:08,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {11654#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(10, 3);call #Ultimate.allocInit(22, 4);call #Ultimate.allocInit(22, 5);~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_3~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_1_0~0 := 0;~probed_2~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_line_1_1~0 := 0;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6, 0;call #Ultimate.allocInit(32, 6);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 8 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 16 + ~#iio_interrupt_trigger_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_ops~0.base, 24 + ~#iio_interrupt_trigger_ops~0.offset, 8);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7, 0;call #Ultimate.allocInit(166, 7);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, 8 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 16 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 24 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 32 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(5, 0, ~#iio_interrupt_trigger_driver~0.base, 40 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 48 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 56 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 64 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 72 + ~#iio_interrupt_trigger_driver~0.offset, 1);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 73 + ~#iio_interrupt_trigger_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 77 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 85 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 93 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 101 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 109 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 117 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 125 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 133 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 141 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 149 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#iio_interrupt_trigger_driver~0.base, 157 + ~#iio_interrupt_trigger_driver~0.offset, 8);call write~init~int(0, ~#iio_interrupt_trigger_driver~0.base, 165 + ~#iio_interrupt_trigger_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_2~0 := 0;~ldv_module_refcounter~0 := 1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {11688#(<= ~probed_2~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet74#1, main_#t~switch75#1, main_#t~nondet76#1, main_#t~switch77#1, main_#t~ret78#1, main_#t~nondet79#1, main_#t~switch80#1, main_#t~ret81#1, main_#t~ret82#1, main_#t~ret83#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {11688#(<= ~probed_2~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {11688#(<= ~probed_2~0 0)} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {11688#(<= ~probed_2~0 0)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {11688#(<= ~probed_2~0 0)} assume main_#t~switch75#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {11688#(<= ~probed_2~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet76#1 && main_#t~nondet76#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet76#1;havoc main_#t~nondet76#1;main_#t~switch77#1 := 0 == main_~tmp___0~4#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {11688#(<= ~probed_2~0 0)} assume !main_#t~switch77#1;main_#t~switch77#1 := main_#t~switch77#1 || 1 == main_~tmp___0~4#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {11688#(<= ~probed_2~0 0)} assume main_#t~switch77#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {11688#(<= ~probed_2~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret86#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet92#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;assume -2147483648 <= __platform_driver_register_#t~nondet92#1 && __platform_driver_register_#t~nondet92#1 <= 2147483647;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet92#1;havoc __platform_driver_register_#t~nondet92#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {11688#(<= ~probed_2~0 0)} ldv___platform_driver_register_10_#t~ret86#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;assume -2147483648 <= ldv___platform_driver_register_10_#t~ret86#1 && ldv___platform_driver_register_10_#t~ret86#1 <= 2147483647;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret86#1;havoc ldv___platform_driver_register_10_#t~ret86#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,167 INFO L272 TraceCheckUtils]: 11: Hoare triple {11688#(<= ~probed_2~0 0)} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {11688#(<= ~probed_2~0 0)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {11688#(<= ~probed_2~0 0)} assume true; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,169 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11688#(<= ~probed_2~0 0)} {11688#(<= ~probed_2~0 0)} #513#return; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {11688#(<= ~probed_2~0 0)} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,170 INFO L272 TraceCheckUtils]: 16: Hoare triple {11688#(<= ~probed_2~0 0)} call assume_abort_if_not((if 0 != (ldv_init_zalloc_~p~2#1.base + ldv_init_zalloc_~p~2#1.offset) % 18446744073709551616 then 1 else 0)); {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {11688#(<= ~probed_2~0 0)} ~cond := #in~cond; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {11688#(<= ~probed_2~0 0)} assume !(0 == ~cond); {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {11688#(<= ~probed_2~0 0)} assume true; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,171 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11688#(<= ~probed_2~0 0)} {11688#(<= ~probed_2~0 0)} #515#return; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {11688#(<= ~probed_2~0 0)} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {11688#(<= ~probed_2~0 0)} ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;havoc ldv_platform_driver_init_2_#t~ret73#1.base, ldv_platform_driver_init_2_#t~ret73#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {11688#(<= ~probed_2~0 0)} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {11688#(<= ~probed_2~0 0)} iio_interrupt_trigger_driver_init_#t~ret60#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;assume -2147483648 <= iio_interrupt_trigger_driver_init_#t~ret60#1 && iio_interrupt_trigger_driver_init_#t~ret60#1 <= 2147483647;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret60#1;havoc iio_interrupt_trigger_driver_init_#t~ret60#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {11688#(<= ~probed_2~0 0)} main_#t~ret78#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;assume -2147483648 <= main_#t~ret78#1 && main_#t~ret78#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret78#1;havoc main_#t~ret78#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {11688#(<= ~probed_2~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {11688#(<= ~probed_2~0 0)} assume !(0 != ~ldv_retval_0~0); {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {11688#(<= ~probed_2~0 0)} assume -2147483648 <= main_#t~nondet74#1 && main_#t~nondet74#1 <= 2147483647;main_~tmp~16#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0 == main_~tmp~16#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {11688#(<= ~probed_2~0 0)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1 == main_~tmp~16#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {11688#(<= ~probed_2~0 0)} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 2 == main_~tmp~16#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {11688#(<= ~probed_2~0 0)} assume main_#t~switch75#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {11688#(<= ~probed_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet79#1 && main_#t~nondet79#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet79#1;havoc main_#t~nondet79#1;main_#t~switch80#1 := 0 == main_~tmp___1~0#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {11688#(<= ~probed_2~0 0)} assume !main_#t~switch80#1;main_#t~switch80#1 := main_#t~switch80#1 || 1 == main_~tmp___1~0#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {11688#(<= ~probed_2~0 0)} assume main_#t~switch80#1; {11688#(<= ~probed_2~0 0)} is VALID [2022-02-20 22:08:08,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {11688#(<= ~probed_2~0 0)} assume 1 == ~ldv_state_variable_2~0 && 1 == ~probed_2~0; {11655#false} is VALID [2022-02-20 22:08:08,177 INFO L272 TraceCheckUtils]: 36: Hoare triple {11655#false} call main_#t~ret82#1 := iio_interrupt_trigger_remove(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {11655#false} is VALID [2022-02-20 22:08:08,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {11655#false} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig~1#1.base, ~trig~1#1.offset;havoc ~trig_info~1#1.base, ~trig_info~1#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~2#1.base, ~tmp___0~2#1.offset;assume { :begin_inline_platform_get_drvdata } true;platform_get_drvdata_#in~pdev#1.base, platform_get_drvdata_#in~pdev#1.offset := ~pdev#1.base, ~pdev#1.offset;havoc platform_get_drvdata_#res#1.base, platform_get_drvdata_#res#1.offset;havoc platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset, platform_get_drvdata_~pdev#1.base, platform_get_drvdata_~pdev#1.offset, platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset;platform_get_drvdata_~pdev#1.base, platform_get_drvdata_~pdev#1.offset := platform_get_drvdata_#in~pdev#1.base, platform_get_drvdata_#in~pdev#1.offset;havoc platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,177 INFO L272 TraceCheckUtils]: 38: Hoare triple {11655#false} call platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset := dev_get_drvdata(platform_get_drvdata_~pdev#1.base, 13 + platform_get_drvdata_~pdev#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {11655#false} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~dev.base, 477 + ~dev.offset, 8);#res.base, #res.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; {11655#false} is VALID [2022-02-20 22:08:08,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {11655#false} assume true; {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11655#false} {11655#false} #489#return; {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {11655#false} platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset := platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset;havoc platform_get_drvdata_#t~ret30#1.base, platform_get_drvdata_#t~ret30#1.offset;platform_get_drvdata_#res#1.base, platform_get_drvdata_#res#1.offset := platform_get_drvdata_~tmp~7#1.base, platform_get_drvdata_~tmp~7#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {11655#false} #t~ret57#1.base, #t~ret57#1.offset := platform_get_drvdata_#res#1.base, platform_get_drvdata_#res#1.offset;assume { :end_inline_platform_get_drvdata } true;~tmp~11#1.base, ~tmp~11#1.offset := #t~ret57#1.base, #t~ret57#1.offset;havoc #t~ret57#1.base, #t~ret57#1.offset;~trig~1#1.base, ~trig~1#1.offset := ~tmp~11#1.base, ~tmp~11#1.offset;assume { :begin_inline_iio_trigger_get_drvdata } true;iio_trigger_get_drvdata_#in~trig#1.base, iio_trigger_get_drvdata_#in~trig#1.offset := ~trig~1#1.base, ~trig~1#1.offset;havoc iio_trigger_get_drvdata_#res#1.base, iio_trigger_get_drvdata_#res#1.offset;havoc iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset, iio_trigger_get_drvdata_~trig#1.base, iio_trigger_get_drvdata_~trig#1.offset, iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset;iio_trigger_get_drvdata_~trig#1.base, iio_trigger_get_drvdata_~trig#1.offset := iio_trigger_get_drvdata_#in~trig#1.base, iio_trigger_get_drvdata_#in~trig#1.offset;havoc iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L272 TraceCheckUtils]: 44: Hoare triple {11655#false} call iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset := dev_get_drvdata(iio_trigger_get_drvdata_~trig#1.base, 20 + iio_trigger_get_drvdata_~trig#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {11655#false} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~dev.base, 477 + ~dev.offset, 8);#res.base, #res.offset := #t~mem20.base, #t~mem20.offset;havoc #t~mem20.base, #t~mem20.offset; {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {11655#false} assume true; {11655#false} is VALID [2022-02-20 22:08:08,178 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11655#false} {11655#false} #491#return; {11655#false} is VALID [2022-02-20 22:08:08,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {11655#false} iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset := iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset;havoc iio_trigger_get_drvdata_#t~ret42#1.base, iio_trigger_get_drvdata_#t~ret42#1.offset;iio_trigger_get_drvdata_#res#1.base, iio_trigger_get_drvdata_#res#1.offset := iio_trigger_get_drvdata_~tmp~9#1.base, iio_trigger_get_drvdata_~tmp~9#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {11655#false} #t~ret58#1.base, #t~ret58#1.offset := iio_trigger_get_drvdata_#res#1.base, iio_trigger_get_drvdata_#res#1.offset;assume { :end_inline_iio_trigger_get_drvdata } true;~tmp___0~2#1.base, ~tmp___0~2#1.offset := #t~ret58#1.base, #t~ret58#1.offset;havoc #t~ret58#1.base, #t~ret58#1.offset;~trig_info~1#1.base, ~trig_info~1#1.offset := ~tmp___0~2#1.base, ~tmp___0~2#1.offset;assume { :begin_inline_iio_trigger_unregister } true;iio_trigger_unregister_#in~arg0#1.base, iio_trigger_unregister_#in~arg0#1.offset := ~trig~1#1.base, ~trig~1#1.offset;havoc iio_trigger_unregister_~arg0#1.base, iio_trigger_unregister_~arg0#1.offset;iio_trigger_unregister_~arg0#1.base, iio_trigger_unregister_~arg0#1.offset := iio_trigger_unregister_#in~arg0#1.base, iio_trigger_unregister_#in~arg0#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {11655#false} assume { :end_inline_iio_trigger_unregister } true;call #t~mem59#1 := read~int(~trig_info~1#1.base, ~trig_info~1#1.offset, 4);assume { :begin_inline_ldv_free_irq_9 } true;ldv_free_irq_9_#in~ldv_func_arg1#1, ldv_free_irq_9_#in~ldv_func_arg2#1.base, ldv_free_irq_9_#in~ldv_func_arg2#1.offset := #t~mem59#1, ~trig~1#1.base, ~trig~1#1.offset;havoc ldv_free_irq_9_~ldv_func_arg1#1, ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset;ldv_free_irq_9_~ldv_func_arg1#1 := ldv_free_irq_9_#in~ldv_func_arg1#1;ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset := ldv_free_irq_9_#in~ldv_func_arg2#1.base, ldv_free_irq_9_#in~ldv_func_arg2#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,179 INFO L272 TraceCheckUtils]: 51: Hoare triple {11655#false} call free_irq(ldv_free_irq_9_~ldv_func_arg1#1, ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {11655#false} ~arg0 := #in~arg0;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {11655#false} is VALID [2022-02-20 22:08:08,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {11655#false} assume true; {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11655#false} {11655#false} #493#return; {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L272 TraceCheckUtils]: 55: Hoare triple {11655#false} call disable_suitable_irq_1((if ldv_free_irq_9_~ldv_func_arg1#1 % 4294967296 % 4294967296 <= 2147483647 then ldv_free_irq_9_~ldv_func_arg1#1 % 4294967296 % 4294967296 else ldv_free_irq_9_~ldv_func_arg1#1 % 4294967296 % 4294967296 - 4294967296), ldv_free_irq_9_~ldv_func_arg2#1.base, ldv_free_irq_9_~ldv_func_arg2#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {11655#false} ~line := #in~line;~data.base, ~data.offset := #in~data.base, #in~data.offset; {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {11655#false} assume 0 != ~ldv_irq_1_0~0 && ~line == ~ldv_irq_line_1_0~0;~ldv_irq_1_0~0 := 0; {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {11655#false} assume true; {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11655#false} {11655#false} #495#return; {11655#false} is VALID [2022-02-20 22:08:08,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {11655#false} assume { :end_inline_ldv_free_irq_9 } true;havoc #t~mem59#1; {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L272 TraceCheckUtils]: 61: Hoare triple {11655#false} call kfree(~trig_info~1#1.base, ~trig_info~1#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {11655#false} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {11655#false} assume true; {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11655#false} {11655#false} #497#return; {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L272 TraceCheckUtils]: 65: Hoare triple {11655#false} call iio_trigger_put(~trig~1#1.base, ~trig~1#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {11655#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {11655#false} is VALID [2022-02-20 22:08:08,181 INFO L272 TraceCheckUtils]: 67: Hoare triple {11655#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {11655#false} is VALID [2022-02-20 22:08:08,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {11655#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {11655#false} is VALID [2022-02-20 22:08:08,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {11655#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {11655#false} is VALID [2022-02-20 22:08:08,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {11655#false} assume ~ldv_module_refcounter~0 <= 1; {11655#false} is VALID [2022-02-20 22:08:08,182 INFO L272 TraceCheckUtils]: 71: Hoare triple {11655#false} call ldv_error(); {11655#false} is VALID [2022-02-20 22:08:08,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-02-20 22:08:08,182 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 22:08:08,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:08,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292873194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:08,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 22:08:08,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-02-20 22:08:08,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084280833] [2022-02-20 22:08:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-02-20 22:08:08,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:08,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:08:08,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:08,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:08:08,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:08:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:08:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:08:08,239 INFO L87 Difference]: Start difference. First operand 427 states and 568 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:08:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:08,655 INFO L93 Difference]: Finished difference Result 1225 states and 1632 transitions. [2022-02-20 22:08:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:08:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-02-20 22:08:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:08:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-02-20 22:08:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:08:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-02-20 22:08:08,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 657 transitions. [2022-02-20 22:08:09,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:09,120 INFO L225 Difference]: With dead ends: 1225 [2022-02-20 22:08:09,120 INFO L226 Difference]: Without dead ends: 801 [2022-02-20 22:08:09,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:08:09,122 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 163 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:09,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 495 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-02-20 22:08:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 797. [2022-02-20 22:08:09,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:09,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 797 states, 645 states have (on average 1.331782945736434) internal successors, (859), 653 states have internal predecessors, (859), 97 states have call successors, (97), 51 states have call predecessors, (97), 54 states have return successors, (104), 100 states have call predecessors, (104), 96 states have call successors, (104) [2022-02-20 22:08:09,196 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 797 states, 645 states have (on average 1.331782945736434) internal successors, (859), 653 states have internal predecessors, (859), 97 states have call successors, (97), 51 states have call predecessors, (97), 54 states have return successors, (104), 100 states have call predecessors, (104), 96 states have call successors, (104) [2022-02-20 22:08:09,197 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 797 states, 645 states have (on average 1.331782945736434) internal successors, (859), 653 states have internal predecessors, (859), 97 states have call successors, (97), 51 states have call predecessors, (97), 54 states have return successors, (104), 100 states have call predecessors, (104), 96 states have call successors, (104) [2022-02-20 22:08:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:09,228 INFO L93 Difference]: Finished difference Result 801 states and 1063 transitions. [2022-02-20 22:08:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1063 transitions. [2022-02-20 22:08:09,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:09,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:09,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 797 states, 645 states have (on average 1.331782945736434) internal successors, (859), 653 states have internal predecessors, (859), 97 states have call successors, (97), 51 states have call predecessors, (97), 54 states have return successors, (104), 100 states have call predecessors, (104), 96 states have call successors, (104) Second operand 801 states. [2022-02-20 22:08:09,256 INFO L87 Difference]: Start difference. First operand has 797 states, 645 states have (on average 1.331782945736434) internal successors, (859), 653 states have internal predecessors, (859), 97 states have call successors, (97), 51 states have call predecessors, (97), 54 states have return successors, (104), 100 states have call predecessors, (104), 96 states have call successors, (104) Second operand 801 states. [2022-02-20 22:08:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:09,301 INFO L93 Difference]: Finished difference Result 801 states and 1063 transitions. [2022-02-20 22:08:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1063 transitions. [2022-02-20 22:08:09,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:09,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:09,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:09,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 645 states have (on average 1.331782945736434) internal successors, (859), 653 states have internal predecessors, (859), 97 states have call successors, (97), 51 states have call predecessors, (97), 54 states have return successors, (104), 100 states have call predecessors, (104), 96 states have call successors, (104) [2022-02-20 22:08:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1060 transitions. [2022-02-20 22:08:09,371 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1060 transitions. Word has length 73 [2022-02-20 22:08:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:09,371 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1060 transitions. [2022-02-20 22:08:09,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:08:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1060 transitions. [2022-02-20 22:08:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 22:08:09,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:09,373 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:09,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 22:08:09,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 22:08:09,591 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1774947442, now seen corresponding path program 1 times [2022-02-20 22:08:09,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:08:09,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399733240] [2022-02-20 22:08:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:08:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 22:08:09,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 22:08:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 22:08:09,728 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 22:08:09,728 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 22:08:09,729 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 22:08:09,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 22:08:09,732 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:09,734 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 22:08:09,796 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #Ultimate.meminit(#t~malloc16, 1, ~size, ~size); [2022-02-20 22:08:09,797 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 22:08:09,800 INFO L158 Benchmark]: Toolchain (without parser) took 10689.75ms. Allocated memory was 90.2MB in the beginning and 310.4MB in the end (delta: 220.2MB). Free memory was 53.2MB in the beginning and 178.5MB in the end (delta: -125.2MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2022-02-20 22:08:09,800 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 90.2MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 22:08:09,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.31ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 53.0MB in the beginning and 84.6MB in the end (delta: -31.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-02-20 22:08:09,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.92ms. Allocated memory is still 119.5MB. Free memory was 84.6MB in the beginning and 78.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 22:08:09,800 INFO L158 Benchmark]: Boogie Preprocessor took 79.76ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 73.1MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 22:08:09,801 INFO L158 Benchmark]: RCFGBuilder took 690.00ms. Allocated memory is still 119.5MB. Free memory was 73.1MB in the beginning and 55.3MB in the end (delta: 17.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-02-20 22:08:09,801 INFO L158 Benchmark]: TraceAbstraction took 9100.34ms. Allocated memory was 119.5MB in the beginning and 310.4MB in the end (delta: 190.8MB). Free memory was 54.9MB in the beginning and 179.5MB in the end (delta: -124.6MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2022-02-20 22:08:09,802 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.10ms. Allocated memory is still 90.2MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.31ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 53.0MB in the beginning and 84.6MB in the end (delta: -31.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.92ms. Allocated memory is still 119.5MB. Free memory was 84.6MB in the beginning and 78.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.76ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 73.1MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 690.00ms. Allocated memory is still 119.5MB. Free memory was 73.1MB in the beginning and 55.3MB in the end (delta: 17.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9100.34ms. Allocated memory was 119.5MB in the beginning and 310.4MB in the end (delta: 190.8MB). Free memory was 54.9MB in the beginning and 179.5MB in the end (delta: -124.6MB). Peak memory consumption was 67.3MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 22:08:09,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:08:11,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:08:11,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:08:11,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:08:11,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:08:11,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:08:11,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:08:11,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:08:11,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:08:11,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:08:11,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:08:11,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:08:11,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:08:11,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:08:11,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:08:11,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:08:11,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:08:11,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:08:11,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:08:11,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:08:11,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:08:11,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:08:11,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:08:11,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:08:11,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:08:11,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:08:11,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:08:11,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:08:11,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:08:11,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:08:11,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:08:11,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:08:11,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:08:11,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:08:11,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:08:11,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:08:11,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:08:11,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:08:11,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:08:11,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:08:11,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:08:11,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 22:08:11,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:08:11,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:08:11,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:08:11,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:08:11,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:08:11,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:08:11,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:08:11,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:08:11,563 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:08:11,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:08:11,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:08:11,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:08:11,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:08:11,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:08:11,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:08:11,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:08:11,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:08:11,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:08:11,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:08:11,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:08:11,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:08:11,567 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 22:08:11,567 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 22:08:11,567 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:08:11,567 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:08:11,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:08:11,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 22:08:11,568 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 [2022-02-20 22:08:11,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:08:11,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:08:11,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:08:11,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:08:11,832 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:08:11,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2022-02-20 22:08:11,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb70fbfe/405c604f9d3349c197645d4cc1ed47e7/FLAGa9443a642 [2022-02-20 22:08:12,361 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:08:12,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2022-02-20 22:08:12,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb70fbfe/405c604f9d3349c197645d4cc1ed47e7/FLAGa9443a642 [2022-02-20 22:08:12,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb70fbfe/405c604f9d3349c197645d4cc1ed47e7 [2022-02-20 22:08:12,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:08:12,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:08:12,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:08:12,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:08:12,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:08:12,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:08:12" (1/1) ... [2022-02-20 22:08:12,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4454b024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:12, skipping insertion in model container [2022-02-20 22:08:12,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:08:12" (1/1) ... [2022-02-20 22:08:12,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:08:12,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:08:12,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2022-02-20 22:08:12,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:08:12,830 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 22:08:12,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:08:12,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2022-02-20 22:08:12,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:08:12,930 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:08:12,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2022-02-20 22:08:12,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:08:13,014 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:08:13,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13 WrapperNode [2022-02-20 22:08:13,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:08:13,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:08:13,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:08:13,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:08:13,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,069 INFO L137 Inliner]: procedures = 93, calls = 127, calls flagged for inlining = 39, calls inlined = 34, statements flattened = 518 [2022-02-20 22:08:13,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:08:13,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:08:13,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:08:13,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:08:13,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:08:13,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:08:13,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:08:13,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:08:13,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (1/1) ... [2022-02-20 22:08:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:08:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:08:13,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 22:08:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:08:13,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:08:13,192 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-02-20 22:08:13,193 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-02-20 22:08:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2022-02-20 22:08:13,193 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2022-02-20 22:08:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:08:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 22:08:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-02-20 22:08:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-02-20 22:08:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 22:08:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:08:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:08:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:08:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:08:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:08:13,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:08:13,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:08:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2022-02-20 22:08:13,195 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2022-02-20 22:08:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-02-20 22:08:13,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-02-20 22:08:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:08:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 22:08:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-02-20 22:08:13,195 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-02-20 22:08:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:08:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:08:13,196 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:08:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-02-20 22:08:13,196 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-02-20 22:08:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 22:08:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 22:08:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:08:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:08:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2022-02-20 22:08:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2022-02-20 22:08:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:08:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:08:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:08:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2022-02-20 22:08:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2022-02-20 22:08:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:08:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:08:13,433 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:08:13,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:08:13,778 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:08:13,999 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:08:14,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:08:14,012 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:08:14,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:08:14 BoogieIcfgContainer [2022-02-20 22:08:14,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:08:14,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:08:14,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:08:14,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:08:14,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:08:12" (1/3) ... [2022-02-20 22:08:14,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecd9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:08:14, skipping insertion in model container [2022-02-20 22:08:14,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:08:13" (2/3) ... [2022-02-20 22:08:14,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecd9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:08:14, skipping insertion in model container [2022-02-20 22:08:14,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:08:14" (3/3) ... [2022-02-20 22:08:14,021 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2022-02-20 22:08:14,025 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:08:14,025 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:08:14,060 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:08:14,064 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:08:14,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:08:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 144 states have (on average 1.3680555555555556) internal successors, (197), 154 states have internal predecessors, (197), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 22:08:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 22:08:14,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:14,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:14,090 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash -680376095, now seen corresponding path program 1 times [2022-02-20 22:08:14,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:08:14,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872689617] [2022-02-20 22:08:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:14,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:08:14,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:08:14,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:08:14,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 22:08:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:14,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:08:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:14,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:14,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {195#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(94bv64, 2bv64);call #Ultimate.allocInit(10bv64, 3bv64);call #Ultimate.allocInit(22bv64, 4bv64);call #Ultimate.allocInit(22bv64, 5bv64);~ldv_irq_1_2~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~ldv_irq_1_3~0 := 0bv32;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0bv64, 0bv64;~ldv_irq_1_1~0 := 0bv32;~ldv_irq_1_0~0 := 0bv32;~probed_2~0 := 0bv32;~ldv_irq_line_1_3~0 := 0bv32;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~ldv_irq_line_1_0~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_irq_line_1_1~0 := 0bv32;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0bv64, 0bv64;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0bv64, 0bv64;~ldv_state_variable_1~0 := 0bv32;~ldv_irq_line_1_2~0 := 0bv32;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6bv64, 0bv64;call #Ultimate.allocInit(32bv64, 6bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(166bv64, 7bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(32bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(5bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(40bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(48bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(56bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(64bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(72bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);call write~init~intINTTYPE4(0bv32, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(73bv64, ~#iio_interrupt_trigger_driver~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(77bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(85bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(93bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(101bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(109bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(117bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(125bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(133bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(141bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(149bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(157bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(165bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~ldv_retval_2~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {195#true} is VALID [2022-02-20 22:08:14,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet72#1, main_#t~switch73#1, main_#t~nondet74#1, main_#t~switch75#1, main_#t~ret76#1, main_#t~nondet77#1, main_#t~switch78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~ret81#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {195#true} is VALID [2022-02-20 22:08:14,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32;~ldv_state_variable_2~0 := 0bv32; {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:08:14,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} main_~tmp~16#1 := main_#t~nondet72#1;havoc main_#t~nondet72#1;main_#t~switch73#1 := 0bv32 == main_~tmp~16#1; {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:08:14,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 1bv32 == main_~tmp~16#1; {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:08:14,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch73#1; {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:08:14,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0bv32 == main_~tmp___0~4#1; {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:08:14,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch75#1; {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:08:14,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_iio_interrupt_trigger_driver_exit } true;assume { :begin_inline_ldv_platform_driver_unregister_11 } true;ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset;havoc ldv_platform_driver_unregister_11_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_~ldv_func_arg1#1.offset;ldv_platform_driver_unregister_11_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_~ldv_func_arg1#1.offset := ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_#in~ldv_func_arg1#1.offset;assume { :begin_inline_platform_driver_unregister } true;platform_driver_unregister_#in~arg0#1.base, platform_driver_unregister_#in~arg0#1.offset := ldv_platform_driver_unregister_11_~ldv_func_arg1#1.base, ldv_platform_driver_unregister_11_~ldv_func_arg1#1.offset;havoc platform_driver_unregister_~arg0#1.base, platform_driver_unregister_~arg0#1.offset;platform_driver_unregister_~arg0#1.base, platform_driver_unregister_~arg0#1.offset := platform_driver_unregister_#in~arg0#1.base, platform_driver_unregister_#in~arg0#1.offset; {196#false} is VALID [2022-02-20 22:08:14,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {196#false} assume { :end_inline_platform_driver_unregister } true;~ldv_state_variable_2~0 := 0bv32; {196#false} is VALID [2022-02-20 22:08:14,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {196#false} assume { :end_inline_ldv_platform_driver_unregister_11 } true; {196#false} is VALID [2022-02-20 22:08:14,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {196#false} assume { :end_inline_iio_interrupt_trigger_driver_exit } true;~ldv_state_variable_0~0 := 2bv32; {196#false} is VALID [2022-02-20 22:08:14,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {196#false} assume { :begin_inline_ldv_check_final_state } true; {196#false} is VALID [2022-02-20 22:08:14,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {196#false} assume 1bv32 != ~ldv_module_refcounter~0; {196#false} is VALID [2022-02-20 22:08:14,386 INFO L272 TraceCheckUtils]: 14: Hoare triple {196#false} call ldv_error(); {196#false} is VALID [2022-02-20 22:08:14,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-02-20 22:08:14,387 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 22:08:14,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:14,387 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:08:14,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872689617] [2022-02-20 22:08:14,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872689617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:14,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:14,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 22:08:14,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923149364] [2022-02-20 22:08:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:14,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 22:08:14,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:14,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:14,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:14,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:08:14,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:08:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:08:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:14,440 INFO L87 Difference]: Start difference. First operand has 192 states, 144 states have (on average 1.3680555555555556) internal successors, (197), 154 states have internal predecessors, (197), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:15,340 INFO L93 Difference]: Finished difference Result 543 states and 753 transitions. [2022-02-20 22:08:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:08:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 22:08:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2022-02-20 22:08:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2022-02-20 22:08:15,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 753 transitions. [2022-02-20 22:08:16,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 753 edges. 753 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:16,114 INFO L225 Difference]: With dead ends: 543 [2022-02-20 22:08:16,115 INFO L226 Difference]: Without dead ends: 338 [2022-02-20 22:08:16,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:16,121 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 228 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:16,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 500 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-02-20 22:08:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2022-02-20 22:08:16,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:16,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 335 states, 259 states have (on average 1.332046332046332) internal successors, (345), 264 states have internal predecessors, (345), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:16,165 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 335 states, 259 states have (on average 1.332046332046332) internal successors, (345), 264 states have internal predecessors, (345), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:16,166 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 335 states, 259 states have (on average 1.332046332046332) internal successors, (345), 264 states have internal predecessors, (345), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:16,181 INFO L93 Difference]: Finished difference Result 338 states and 445 transitions. [2022-02-20 22:08:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2022-02-20 22:08:16,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:16,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:16,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 259 states have (on average 1.332046332046332) internal successors, (345), 264 states have internal predecessors, (345), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 338 states. [2022-02-20 22:08:16,186 INFO L87 Difference]: Start difference. First operand has 335 states, 259 states have (on average 1.332046332046332) internal successors, (345), 264 states have internal predecessors, (345), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 338 states. [2022-02-20 22:08:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:16,200 INFO L93 Difference]: Finished difference Result 338 states and 445 transitions. [2022-02-20 22:08:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2022-02-20 22:08:16,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:16,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:16,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:16,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 259 states have (on average 1.332046332046332) internal successors, (345), 264 states have internal predecessors, (345), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 443 transitions. [2022-02-20 22:08:16,217 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 443 transitions. Word has length 16 [2022-02-20 22:08:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:16,217 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 443 transitions. [2022-02-20 22:08:16,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 22:08:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 443 transitions. [2022-02-20 22:08:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 22:08:16,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:16,219 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] [2022-02-20 22:08:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 22:08:16,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:08:16,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 926225930, now seen corresponding path program 1 times [2022-02-20 22:08:16,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:08:16,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812572594] [2022-02-20 22:08:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:08:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:08:16,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:08:16,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 22:08:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:16,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:08:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:16,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:16,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {2175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(94bv64, 2bv64);call #Ultimate.allocInit(10bv64, 3bv64);call #Ultimate.allocInit(22bv64, 4bv64);call #Ultimate.allocInit(22bv64, 5bv64);~ldv_irq_1_2~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~ldv_irq_1_3~0 := 0bv32;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0bv64, 0bv64;~ldv_irq_1_1~0 := 0bv32;~ldv_irq_1_0~0 := 0bv32;~probed_2~0 := 0bv32;~ldv_irq_line_1_3~0 := 0bv32;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~ldv_irq_line_1_0~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_irq_line_1_1~0 := 0bv32;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0bv64, 0bv64;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0bv64, 0bv64;~ldv_state_variable_1~0 := 0bv32;~ldv_irq_line_1_2~0 := 0bv32;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6bv64, 0bv64;call #Ultimate.allocInit(32bv64, 6bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(166bv64, 7bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(32bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(5bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(40bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(48bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(56bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(64bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(72bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);call write~init~intINTTYPE4(0bv32, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(73bv64, ~#iio_interrupt_trigger_driver~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(77bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(85bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(93bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(101bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(109bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(117bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(125bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(133bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(141bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(149bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(157bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(165bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~ldv_retval_2~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {2175#true} is VALID [2022-02-20 22:08:16,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {2175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet72#1, main_#t~switch73#1, main_#t~nondet74#1, main_#t~switch75#1, main_#t~ret76#1, main_#t~nondet77#1, main_#t~switch78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~ret81#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {2175#true} is VALID [2022-02-20 22:08:16,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {2175#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32;~ldv_state_variable_2~0 := 0bv32; {2175#true} is VALID [2022-02-20 22:08:16,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {2175#true} main_~tmp~16#1 := main_#t~nondet72#1;havoc main_#t~nondet72#1;main_#t~switch73#1 := 0bv32 == main_~tmp~16#1; {2175#true} is VALID [2022-02-20 22:08:16,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {2175#true} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 1bv32 == main_~tmp~16#1; {2175#true} is VALID [2022-02-20 22:08:16,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {2175#true} assume main_#t~switch73#1; {2175#true} is VALID [2022-02-20 22:08:16,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {2175#true} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0bv32 == main_~tmp___0~4#1; {2175#true} is VALID [2022-02-20 22:08:16,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {2175#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1bv32 == main_~tmp___0~4#1; {2175#true} is VALID [2022-02-20 22:08:16,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {2175#true} assume main_#t~switch75#1; {2175#true} is VALID [2022-02-20 22:08:16,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {2175#true} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret58#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret84#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet90#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet90#1;havoc __platform_driver_register_#t~nondet90#1; {2175#true} is VALID [2022-02-20 22:08:16,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {2175#true} ldv___platform_driver_register_10_#t~ret84#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret84#1;havoc ldv___platform_driver_register_10_#t~ret84#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1bv32;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472bv64;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {2175#true} is VALID [2022-02-20 22:08:16,655 INFO L272 TraceCheckUtils]: 11: Hoare triple {2175#true} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1bv64, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {2175#true} is VALID [2022-02-20 22:08:16,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {2175#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2175#true} is VALID [2022-02-20 22:08:16,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {2175#true} assume true; {2175#true} is VALID [2022-02-20 22:08:16,655 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2175#true} {2175#true} #491#return; {2175#true} is VALID [2022-02-20 22:08:16,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {2175#true} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {2175#true} is VALID [2022-02-20 22:08:16,656 INFO L272 TraceCheckUtils]: 16: Hoare triple {2175#true} call assume_abort_if_not((if 0bv64 != ~bvadd64(ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset) then 1bv32 else 0bv32)); {2175#true} is VALID [2022-02-20 22:08:16,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {2175#true} ~cond := #in~cond; {2175#true} is VALID [2022-02-20 22:08:16,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {2175#true} assume !(0bv32 == ~cond); {2175#true} is VALID [2022-02-20 22:08:16,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {2175#true} assume true; {2175#true} is VALID [2022-02-20 22:08:16,656 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2175#true} {2175#true} #493#return; {2175#true} is VALID [2022-02-20 22:08:16,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {2175#true} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {2175#true} is VALID [2022-02-20 22:08:16,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {2175#true} ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset;havoc ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {2175#true} is VALID [2022-02-20 22:08:16,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {2175#true} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {2175#true} is VALID [2022-02-20 22:08:16,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {2175#true} iio_interrupt_trigger_driver_init_#t~ret58#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret58#1;havoc iio_interrupt_trigger_driver_init_#t~ret58#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {2175#true} is VALID [2022-02-20 22:08:16,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {2175#true} main_#t~ret76#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;~ldv_retval_0~0 := main_#t~ret76#1;havoc main_#t~ret76#1; {2175#true} is VALID [2022-02-20 22:08:16,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {2175#true} assume 0bv32 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3bv32; {2258#(= (_ bv0 32) ~ldv_retval_0~0)} is VALID [2022-02-20 22:08:16,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {2258#(= (_ bv0 32) ~ldv_retval_0~0)} assume 0bv32 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2bv32; {2176#false} is VALID [2022-02-20 22:08:16,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {2176#false} assume { :begin_inline_ldv_check_final_state } true; {2176#false} is VALID [2022-02-20 22:08:16,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {2176#false} assume 1bv32 != ~ldv_module_refcounter~0; {2176#false} is VALID [2022-02-20 22:08:16,669 INFO L272 TraceCheckUtils]: 30: Hoare triple {2176#false} call ldv_error(); {2176#false} is VALID [2022-02-20 22:08:16,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {2176#false} assume !false; {2176#false} is VALID [2022-02-20 22:08:16,669 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 22:08:16,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:16,670 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:08:16,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812572594] [2022-02-20 22:08:16,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812572594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:16,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:16,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 22:08:16,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035321329] [2022-02-20 22:08:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:16,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:16,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:16,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:16,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:08:16,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:08:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:08:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:16,713 INFO L87 Difference]: Start difference. First operand 335 states and 443 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:17,178 INFO L93 Difference]: Finished difference Result 345 states and 451 transitions. [2022-02-20 22:08:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:08:17,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-02-20 22:08:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-02-20 22:08:17,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 246 transitions. [2022-02-20 22:08:17,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:17,439 INFO L225 Difference]: With dead ends: 345 [2022-02-20 22:08:17,440 INFO L226 Difference]: Without dead ends: 340 [2022-02-20 22:08:17,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:17,441 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 231 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:17,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-02-20 22:08:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 335. [2022-02-20 22:08:17,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:17,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 340 states. Second operand has 335 states, 259 states have (on average 1.3281853281853282) internal successors, (344), 264 states have internal predecessors, (344), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:17,459 INFO L74 IsIncluded]: Start isIncluded. First operand 340 states. Second operand has 335 states, 259 states have (on average 1.3281853281853282) internal successors, (344), 264 states have internal predecessors, (344), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:17,460 INFO L87 Difference]: Start difference. First operand 340 states. Second operand has 335 states, 259 states have (on average 1.3281853281853282) internal successors, (344), 264 states have internal predecessors, (344), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:17,469 INFO L93 Difference]: Finished difference Result 340 states and 446 transitions. [2022-02-20 22:08:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 446 transitions. [2022-02-20 22:08:17,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:17,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:17,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 259 states have (on average 1.3281853281853282) internal successors, (344), 264 states have internal predecessors, (344), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 340 states. [2022-02-20 22:08:17,472 INFO L87 Difference]: Start difference. First operand has 335 states, 259 states have (on average 1.3281853281853282) internal successors, (344), 264 states have internal predecessors, (344), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 340 states. [2022-02-20 22:08:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:17,482 INFO L93 Difference]: Finished difference Result 340 states and 446 transitions. [2022-02-20 22:08:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 446 transitions. [2022-02-20 22:08:17,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:17,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:17,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:17,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 259 states have (on average 1.3281853281853282) internal successors, (344), 264 states have internal predecessors, (344), 50 states have call successors, (50), 26 states have call predecessors, (50), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 442 transitions. [2022-02-20 22:08:17,494 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 442 transitions. Word has length 32 [2022-02-20 22:08:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:17,495 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 442 transitions. [2022-02-20 22:08:17,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 442 transitions. [2022-02-20 22:08:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 22:08:17,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:17,496 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] [2022-02-20 22:08:17,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 22:08:17,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:08:17,705 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:17,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash 983484232, now seen corresponding path program 1 times [2022-02-20 22:08:17,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:08:17,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42533344] [2022-02-20 22:08:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:17,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:08:17,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:08:17,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:08:17,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 22:08:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:17,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:08:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:17,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:17,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {3915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(94bv64, 2bv64);call #Ultimate.allocInit(10bv64, 3bv64);call #Ultimate.allocInit(22bv64, 4bv64);call #Ultimate.allocInit(22bv64, 5bv64);~ldv_irq_1_2~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~ldv_irq_1_3~0 := 0bv32;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0bv64, 0bv64;~ldv_irq_1_1~0 := 0bv32;~ldv_irq_1_0~0 := 0bv32;~probed_2~0 := 0bv32;~ldv_irq_line_1_3~0 := 0bv32;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~ldv_irq_line_1_0~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_irq_line_1_1~0 := 0bv32;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0bv64, 0bv64;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0bv64, 0bv64;~ldv_state_variable_1~0 := 0bv32;~ldv_irq_line_1_2~0 := 0bv32;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6bv64, 0bv64;call #Ultimate.allocInit(32bv64, 6bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(166bv64, 7bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(32bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(5bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(40bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(48bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(56bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(64bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(72bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);call write~init~intINTTYPE4(0bv32, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(73bv64, ~#iio_interrupt_trigger_driver~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(77bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(85bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(93bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(101bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(109bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(117bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(125bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(133bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(141bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(149bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(157bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(165bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~ldv_retval_2~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet72#1, main_#t~switch73#1, main_#t~nondet74#1, main_#t~switch75#1, main_#t~ret76#1, main_#t~nondet77#1, main_#t~switch78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~ret81#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32;~ldv_state_variable_2~0 := 0bv32; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} main_~tmp~16#1 := main_#t~nondet72#1;havoc main_#t~nondet72#1;main_#t~switch73#1 := 0bv32 == main_~tmp~16#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 1bv32 == main_~tmp~16#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume main_#t~switch73#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0bv32 == main_~tmp___0~4#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1bv32 == main_~tmp___0~4#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume main_#t~switch75#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret58#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret84#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet90#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet90#1;havoc __platform_driver_register_#t~nondet90#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} ldv___platform_driver_register_10_#t~ret84#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret84#1;havoc ldv___platform_driver_register_10_#t~ret84#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1bv32;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472bv64;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1bv64, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,950 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} #491#return; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,951 INFO L272 TraceCheckUtils]: 16: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} call assume_abort_if_not((if 0bv64 != ~bvadd64(ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset) then 1bv32 else 0bv32)); {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~cond := #in~cond; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,954 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} #493#return; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset;havoc ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} iio_interrupt_trigger_driver_init_#t~ret58#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret58#1;havoc iio_interrupt_trigger_driver_init_#t~ret58#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} main_#t~ret76#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;~ldv_retval_0~0 := main_#t~ret76#1;havoc main_#t~ret76#1; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume !(0bv32 == ~ldv_retval_0~0); {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv32 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2bv32; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :begin_inline_ldv_check_final_state } true; {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:08:17,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {3920#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 1bv32 != ~ldv_module_refcounter~0; {3916#false} is VALID [2022-02-20 22:08:17,957 INFO L272 TraceCheckUtils]: 30: Hoare triple {3916#false} call ldv_error(); {3916#false} is VALID [2022-02-20 22:08:17,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {3916#false} assume !false; {3916#false} is VALID [2022-02-20 22:08:17,958 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 22:08:17,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:17,958 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:08:17,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42533344] [2022-02-20 22:08:17,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42533344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:17,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:17,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 22:08:17,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473390745] [2022-02-20 22:08:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:17,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:17,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:17,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:18,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:18,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:08:18,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:08:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:08:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:18,003 INFO L87 Difference]: Start difference. First operand 335 states and 442 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:18,374 INFO L93 Difference]: Finished difference Result 664 states and 890 transitions. [2022-02-20 22:08:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:08:18,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 22:08:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2022-02-20 22:08:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2022-02-20 22:08:18,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 473 transitions. [2022-02-20 22:08:18,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:18,871 INFO L225 Difference]: With dead ends: 664 [2022-02-20 22:08:18,871 INFO L226 Difference]: Without dead ends: 327 [2022-02-20 22:08:18,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:18,873 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:18,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 231 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-20 22:08:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 326. [2022-02-20 22:08:18,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:18,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 326 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 255 states have internal predecessors, (332), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:18,889 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 326 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 255 states have internal predecessors, (332), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:18,889 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 326 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 255 states have internal predecessors, (332), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:18,898 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-02-20 22:08:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 430 transitions. [2022-02-20 22:08:18,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:18,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:18,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 255 states have internal predecessors, (332), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 327 states. [2022-02-20 22:08:18,901 INFO L87 Difference]: Start difference. First operand has 326 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 255 states have internal predecessors, (332), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand 327 states. [2022-02-20 22:08:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:18,910 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-02-20 22:08:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 430 transitions. [2022-02-20 22:08:18,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:18,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:18,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:18,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 255 states have internal predecessors, (332), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-02-20 22:08:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 429 transitions. [2022-02-20 22:08:18,921 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 429 transitions. Word has length 32 [2022-02-20 22:08:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:18,921 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 429 transitions. [2022-02-20 22:08:18,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 429 transitions. [2022-02-20 22:08:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 22:08:18,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:18,923 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 22:08:18,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 22:08:19,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:08:19,131 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1303166475, now seen corresponding path program 1 times [2022-02-20 22:08:19,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:08:19,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423002045] [2022-02-20 22:08:19,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:19,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:08:19,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:08:19,133 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:08:19,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 22:08:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:19,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:08:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:19,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:19,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {6064#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(94bv64, 2bv64);call #Ultimate.allocInit(10bv64, 3bv64);call #Ultimate.allocInit(22bv64, 4bv64);call #Ultimate.allocInit(22bv64, 5bv64);~ldv_irq_1_2~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~ldv_irq_1_3~0 := 0bv32;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0bv64, 0bv64;~ldv_irq_1_1~0 := 0bv32;~ldv_irq_1_0~0 := 0bv32;~probed_2~0 := 0bv32;~ldv_irq_line_1_3~0 := 0bv32;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~ldv_irq_line_1_0~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_irq_line_1_1~0 := 0bv32;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0bv64, 0bv64;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0bv64, 0bv64;~ldv_state_variable_1~0 := 0bv32;~ldv_irq_line_1_2~0 := 0bv32;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6bv64, 0bv64;call #Ultimate.allocInit(32bv64, 6bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(166bv64, 7bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(32bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(5bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(40bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(48bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(56bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(64bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(72bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);call write~init~intINTTYPE4(0bv32, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(73bv64, ~#iio_interrupt_trigger_driver~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(77bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(85bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(93bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(101bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(109bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(117bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(125bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(133bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(141bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(149bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(157bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(165bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~ldv_retval_2~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {6064#true} is VALID [2022-02-20 22:08:19,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {6064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet72#1, main_#t~switch73#1, main_#t~nondet74#1, main_#t~switch75#1, main_#t~ret76#1, main_#t~nondet77#1, main_#t~switch78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~ret81#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {6064#true} is VALID [2022-02-20 22:08:19,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {6064#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32;~ldv_state_variable_2~0 := 0bv32; {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 22:08:19,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} main_~tmp~16#1 := main_#t~nondet72#1;havoc main_#t~nondet72#1;main_#t~switch73#1 := 0bv32 == main_~tmp~16#1; {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 22:08:19,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 1bv32 == main_~tmp~16#1; {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 22:08:19,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 2bv32 == main_~tmp~16#1; {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 22:08:19,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume main_#t~switch73#1; {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {6075#(= (_ bv0 32) ~ldv_state_variable_2~0)} assume 0bv32 != ~ldv_state_variable_2~0;main_~tmp___1~0#1 := main_#t~nondet77#1;havoc main_#t~nondet77#1;main_#t~switch78#1 := 0bv32 == main_~tmp___1~0#1; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {6065#false} assume main_#t~switch78#1; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {6065#false} assume 1bv32 == ~ldv_state_variable_2~0; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L272 TraceCheckUtils]: 10: Hoare triple {6065#false} call main_#t~ret79#1 := iio_interrupt_trigger_probe(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {6065#false} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig_info~0#1.base, ~trig_info~0#1.offset;havoc ~trig~0#1.base, ~trig~0#1.offset;havoc ~irqflags~0#1;havoc ~irq_res~0#1.base, ~irq_res~0#1.offset;havoc ~irq~0#1;havoc ~ret~0#1;havoc ~tmp~10#1.base, ~tmp~10#1.offset;~ret~0#1 := 0bv32;assume { :begin_inline_platform_get_resource } true;platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset, platform_get_resource_#in~arg1#1, platform_get_resource_#in~arg2#1 := ~pdev#1.base, ~pdev#1.offset, 1024bv32, 0bv32;havoc platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;havoc platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset, platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset, platform_get_resource_~arg1#1, platform_get_resource_~arg2#1;platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset := platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset;platform_get_resource_~arg1#1 := platform_get_resource_#in~arg1#1;platform_get_resource_~arg2#1 := platform_get_resource_#in~arg2#1; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L272 TraceCheckUtils]: 12: Hoare triple {6065#false} call platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset := ldv_malloc(56bv64); {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {6065#false} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {6065#false} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {6065#false} assume true; {6065#false} is VALID [2022-02-20 22:08:19,414 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6065#false} {6065#false} #447#return; {6065#false} is VALID [2022-02-20 22:08:19,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {6065#false} platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset := platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset;havoc platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {6065#false} #t~ret47#1.base, #t~ret47#1.offset := platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;assume { :end_inline_platform_get_resource } true;~irq_res~0#1.base, ~irq_res~0#1.offset := #t~ret47#1.base, #t~ret47#1.offset;havoc #t~ret47#1.base, #t~ret47#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {6065#false} assume !(0bv64 == ~bvadd64(~irq_res~0#1.base, ~irq_res~0#1.offset));call #t~mem48#1 := read~intINTTYPE8(~irq_res~0#1.base, ~bvadd64(24bv64, ~irq_res~0#1.offset), 8bv64);~irqflags~0#1 := ~bvor64(128bv64, ~bvand64(15bv64, #t~mem48#1));havoc #t~mem48#1;call #t~mem49#1 := read~intINTTYPE8(~irq_res~0#1.base, ~irq_res~0#1.offset, 8bv64);~irq~0#1 := #t~mem49#1[32:0];havoc #t~mem49#1;havoc #t~nondet50#1.base, #t~nondet50#1.offset;~trig~0#1.base, ~trig~0#1.offset := #t~nondet50#1.base, #t~nondet50#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {6065#false} assume !(0bv64 == ~bvadd64(~trig~0#1.base, ~trig~0#1.offset));assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 4bv64, 208bv32;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;assume { :begin_inline_kmalloc } true;kmalloc_#in~size#1, kmalloc_#in~flags#1 := kzalloc_~size#1, ~bvor32(32768bv32, kzalloc_~flags#1);havoc kmalloc_#res#1.base, kmalloc_#res#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset, kmalloc_~size#1, kmalloc_~flags#1, kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;kmalloc_~size#1 := kmalloc_#in~size#1;kmalloc_~flags#1 := kmalloc_#in~flags#1;havoc kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := kmalloc_~size#1, kmalloc_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {6065#false} is VALID [2022-02-20 22:08:19,415 INFO L272 TraceCheckUtils]: 21: Hoare triple {6065#false} call __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset := ldv_malloc(__kmalloc_~size#1); {6065#false} is VALID [2022-02-20 22:08:19,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {6065#false} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {6065#false} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {6065#false} assume true; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6065#false} {6065#false} #449#return; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {6065#false} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {6065#false} kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset := kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;kmalloc_#res#1.base, kmalloc_#res#1.offset := kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {6065#false} kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset := kmalloc_#res#1.base, kmalloc_#res#1.offset;assume { :end_inline_kmalloc } true;kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset := kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {6065#false} #t~ret51#1.base, #t~ret51#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;~tmp~10#1.base, ~tmp~10#1.offset := #t~ret51#1.base, #t~ret51#1.offset;havoc #t~ret51#1.base, #t~ret51#1.offset;~trig_info~0#1.base, ~trig_info~0#1.offset := ~tmp~10#1.base, ~tmp~10#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {6065#false} assume 0bv64 == ~bvadd64(~trig_info~0#1.base, ~trig_info~0#1.offset);~ret~0#1 := 4294967284bv32; {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L272 TraceCheckUtils]: 31: Hoare triple {6065#false} call iio_trigger_put(~trig~0#1.base, ~trig~0#1.offset); {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {6065#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8bv64);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8bv64);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L272 TraceCheckUtils]: 33: Hoare triple {6065#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {6065#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {6065#false} assume 0bv64 != ~bvadd64(~module.base, ~module.offset); {6065#false} is VALID [2022-02-20 22:08:19,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {6065#false} assume ~bvsle32(~ldv_module_refcounter~0, 1bv32); {6065#false} is VALID [2022-02-20 22:08:19,418 INFO L272 TraceCheckUtils]: 37: Hoare triple {6065#false} call ldv_error(); {6065#false} is VALID [2022-02-20 22:08:19,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {6065#false} assume !false; {6065#false} is VALID [2022-02-20 22:08:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 22:08:19,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:19,418 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:08:19,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423002045] [2022-02-20 22:08:19,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423002045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:19,418 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:19,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 22:08:19,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353728193] [2022-02-20 22:08:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:19,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-02-20 22:08:19,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:19,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:19,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:19,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:08:19,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:08:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:08:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:19,464 INFO L87 Difference]: Start difference. First operand 326 states and 429 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:20,036 INFO L93 Difference]: Finished difference Result 732 states and 974 transitions. [2022-02-20 22:08:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:08:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-02-20 22:08:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2022-02-20 22:08:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2022-02-20 22:08:20,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 510 transitions. [2022-02-20 22:08:20,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:20,472 INFO L225 Difference]: With dead ends: 732 [2022-02-20 22:08:20,472 INFO L226 Difference]: Without dead ends: 409 [2022-02-20 22:08:20,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:08:20,474 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 56 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:20,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 442 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-02-20 22:08:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2022-02-20 22:08:20,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:20,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand has 407 states, 322 states have (on average 1.3385093167701863) internal successors, (431), 326 states have internal predecessors, (431), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:20,490 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand has 407 states, 322 states have (on average 1.3385093167701863) internal successors, (431), 326 states have internal predecessors, (431), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:20,491 INFO L87 Difference]: Start difference. First operand 409 states. Second operand has 407 states, 322 states have (on average 1.3385093167701863) internal successors, (431), 326 states have internal predecessors, (431), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:20,500 INFO L93 Difference]: Finished difference Result 409 states and 546 transitions. [2022-02-20 22:08:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 546 transitions. [2022-02-20 22:08:20,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:20,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:20,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 322 states have (on average 1.3385093167701863) internal successors, (431), 326 states have internal predecessors, (431), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 409 states. [2022-02-20 22:08:20,503 INFO L87 Difference]: Start difference. First operand has 407 states, 322 states have (on average 1.3385093167701863) internal successors, (431), 326 states have internal predecessors, (431), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 409 states. [2022-02-20 22:08:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:20,513 INFO L93 Difference]: Finished difference Result 409 states and 546 transitions. [2022-02-20 22:08:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 546 transitions. [2022-02-20 22:08:20,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:20,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:20,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:20,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 322 states have (on average 1.3385093167701863) internal successors, (431), 326 states have internal predecessors, (431), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:08:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-02-20 22:08:20,526 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 39 [2022-02-20 22:08:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:20,527 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-02-20 22:08:20,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 22:08:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-02-20 22:08:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 22:08:20,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:20,529 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:20,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 22:08:20,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:08:20,739 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1902296280, now seen corresponding path program 1 times [2022-02-20 22:08:20,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:08:20,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209930512] [2022-02-20 22:08:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:20,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:08:20,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:08:20,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:08:20,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 22:08:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:20,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 22:08:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:08:20,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:08:21,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {8579#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(94bv64, 2bv64);call #Ultimate.allocInit(10bv64, 3bv64);call #Ultimate.allocInit(22bv64, 4bv64);call #Ultimate.allocInit(22bv64, 5bv64);~ldv_irq_1_2~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~ldv_irq_1_3~0 := 0bv32;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0bv64, 0bv64;~ldv_irq_1_1~0 := 0bv32;~ldv_irq_1_0~0 := 0bv32;~probed_2~0 := 0bv32;~ldv_irq_line_1_3~0 := 0bv32;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~ldv_irq_line_1_0~0 := 0bv32;~ldv_state_variable_2~0 := 0bv32;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_irq_line_1_1~0 := 0bv32;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := 0bv64, 0bv64;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0bv64, 0bv64;~ldv_state_variable_1~0 := 0bv32;~ldv_irq_line_1_2~0 := 0bv32;~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset := 6bv64, 0bv64;call #Ultimate.allocInit(32bv64, 6bv64);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#iio_interrupt_trigger_ops~0.base, ~#iio_interrupt_trigger_ops~0.offset, 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_ops~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_ops~0.offset), 8bv64);~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset := 7bv64, 0bv64;call #Ultimate.allocInit(166bv64, 7bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_probe.base, #funAddr~iio_interrupt_trigger_probe.offset, ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~iio_interrupt_trigger_remove.base, #funAddr~iio_interrupt_trigger_remove.offset, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(8bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(16bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(24bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(32bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(5bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(40bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(48bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(56bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(64bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(72bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);call write~init~intINTTYPE4(0bv32, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(73bv64, ~#iio_interrupt_trigger_driver~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(77bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(85bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(93bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(101bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(109bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(117bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(125bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(133bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(141bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(149bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(157bv64, ~#iio_interrupt_trigger_driver~0.offset), 8bv64);call write~init~intINTTYPE1(0bv8, ~#iio_interrupt_trigger_driver~0.base, ~bvadd64(165bv64, ~#iio_interrupt_trigger_driver~0.offset), 1bv64);~ldv_retval_0~0 := 0bv32;~ldv_retval_1~0 := 0bv32;~ldv_retval_2~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {8579#true} is VALID [2022-02-20 22:08:21,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {8579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet72#1, main_#t~switch73#1, main_#t~nondet74#1, main_#t~switch75#1, main_#t~ret76#1, main_#t~nondet77#1, main_#t~switch78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~ret81#1, main_~tmp~16#1, main_~tmp___0~4#1, main_~tmp___1~0#1;havoc main_~tmp~16#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~0#1;assume { :begin_inline_ldv_initialize } true; {8579#true} is VALID [2022-02-20 22:08:21,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {8579#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32;~ldv_state_variable_2~0 := 0bv32; {8579#true} is VALID [2022-02-20 22:08:21,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {8579#true} main_~tmp~16#1 := main_#t~nondet72#1;havoc main_#t~nondet72#1;main_#t~switch73#1 := 0bv32 == main_~tmp~16#1; {8579#true} is VALID [2022-02-20 22:08:21,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {8579#true} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 1bv32 == main_~tmp~16#1; {8579#true} is VALID [2022-02-20 22:08:21,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {8579#true} assume main_#t~switch73#1; {8579#true} is VALID [2022-02-20 22:08:21,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {8579#true} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet74#1;havoc main_#t~nondet74#1;main_#t~switch75#1 := 0bv32 == main_~tmp___0~4#1; {8579#true} is VALID [2022-02-20 22:08:21,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {8579#true} assume !main_#t~switch75#1;main_#t~switch75#1 := main_#t~switch75#1 || 1bv32 == main_~tmp___0~4#1; {8579#true} is VALID [2022-02-20 22:08:21,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {8579#true} assume main_#t~switch75#1; {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {8579#true} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_iio_interrupt_trigger_driver_init } true;havoc iio_interrupt_trigger_driver_init_#res#1;havoc iio_interrupt_trigger_driver_init_#t~ret58#1, iio_interrupt_trigger_driver_init_~tmp~12#1;havoc iio_interrupt_trigger_driver_init_~tmp~12#1;assume { :begin_inline_ldv___platform_driver_register_10 } true;ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset := ~#iio_interrupt_trigger_driver~0.base, ~#iio_interrupt_trigger_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___platform_driver_register_10_#res#1;havoc ldv___platform_driver_register_10_#t~ret84#1, ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset, ldv___platform_driver_register_10_~ldv_func_res~1#1, ldv___platform_driver_register_10_~tmp~18#1;ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg1#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg1#1.offset;ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset := ldv___platform_driver_register_10_#in~ldv_func_arg2#1.base, ldv___platform_driver_register_10_#in~ldv_func_arg2#1.offset;havoc ldv___platform_driver_register_10_~ldv_func_res~1#1;havoc ldv___platform_driver_register_10_~tmp~18#1;assume { :begin_inline___platform_driver_register } true;__platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset, __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset := ldv___platform_driver_register_10_~ldv_func_arg1#1.base, ldv___platform_driver_register_10_~ldv_func_arg1#1.offset, ldv___platform_driver_register_10_~ldv_func_arg2#1.base, ldv___platform_driver_register_10_~ldv_func_arg2#1.offset;havoc __platform_driver_register_#res#1;havoc __platform_driver_register_#t~nondet90#1, __platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset, __platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset;__platform_driver_register_~arg0#1.base, __platform_driver_register_~arg0#1.offset := __platform_driver_register_#in~arg0#1.base, __platform_driver_register_#in~arg0#1.offset;__platform_driver_register_~arg1#1.base, __platform_driver_register_~arg1#1.offset := __platform_driver_register_#in~arg1#1.base, __platform_driver_register_#in~arg1#1.offset;__platform_driver_register_#res#1 := __platform_driver_register_#t~nondet90#1;havoc __platform_driver_register_#t~nondet90#1; {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {8579#true} ldv___platform_driver_register_10_#t~ret84#1 := __platform_driver_register_#res#1;assume { :end_inline___platform_driver_register } true;ldv___platform_driver_register_10_~tmp~18#1 := ldv___platform_driver_register_10_#t~ret84#1;havoc ldv___platform_driver_register_10_#t~ret84#1;ldv___platform_driver_register_10_~ldv_func_res~1#1 := ldv___platform_driver_register_10_~tmp~18#1;~ldv_state_variable_2~0 := 1bv32;assume { :begin_inline_ldv_platform_driver_init_2 } true;havoc ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset, ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;havoc ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset;assume { :begin_inline_ldv_init_zalloc } true;ldv_init_zalloc_#in~size#1 := 1472bv64;havoc ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;havoc ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, ldv_init_zalloc_~size#1, ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset, ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;ldv_init_zalloc_~size#1 := ldv_init_zalloc_#in~size#1;havoc ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset;havoc ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset;call ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset := #Ultimate.allocOnHeap(ldv_init_zalloc_~size#1); {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {8579#true} call #Ultimate.meminit(ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset, 1bv64, ldv_init_zalloc_~size#1, ldv_init_zalloc_~size#1); {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {8579#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8579#true} {8579#true} #491#return; {8579#true} is VALID [2022-02-20 22:08:21,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {8579#true} ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset := ldv_init_zalloc_#t~malloc16#1.base, ldv_init_zalloc_#t~malloc16#1.offset;ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset := ldv_init_zalloc_~tmp~3#1.base, ldv_init_zalloc_~tmp~3#1.offset; {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L272 TraceCheckUtils]: 16: Hoare triple {8579#true} call assume_abort_if_not((if 0bv64 != ~bvadd64(ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset) then 1bv32 else 0bv32)); {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {8579#true} assume !(0bv32 == ~cond); {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8579#true} {8579#true} #493#return; {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {8579#true} ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset := ldv_init_zalloc_~p~2#1.base, ldv_init_zalloc_~p~2#1.offset; {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {8579#true} ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset := ldv_init_zalloc_#res#1.base, ldv_init_zalloc_#res#1.offset;assume { :end_inline_ldv_init_zalloc } true;ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset := ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset;havoc ldv_platform_driver_init_2_#t~ret71#1.base, ldv_platform_driver_init_2_#t~ret71#1.offset;~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset := ldv_platform_driver_init_2_~tmp~15#1.base, ldv_platform_driver_init_2_~tmp~15#1.offset; {8579#true} is VALID [2022-02-20 22:08:21,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {8579#true} assume { :end_inline_ldv_platform_driver_init_2 } true;ldv___platform_driver_register_10_#res#1 := ldv___platform_driver_register_10_~ldv_func_res~1#1; {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {8579#true} iio_interrupt_trigger_driver_init_#t~ret58#1 := ldv___platform_driver_register_10_#res#1;assume { :end_inline_ldv___platform_driver_register_10 } true;iio_interrupt_trigger_driver_init_~tmp~12#1 := iio_interrupt_trigger_driver_init_#t~ret58#1;havoc iio_interrupt_trigger_driver_init_#t~ret58#1;iio_interrupt_trigger_driver_init_#res#1 := iio_interrupt_trigger_driver_init_~tmp~12#1; {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {8579#true} main_#t~ret76#1 := iio_interrupt_trigger_driver_init_#res#1;assume { :end_inline_iio_interrupt_trigger_driver_init } true;~ldv_retval_0~0 := main_#t~ret76#1;havoc main_#t~ret76#1; {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {8579#true} assume 0bv32 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3bv32; {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {8579#true} assume !(0bv32 != ~ldv_retval_0~0); {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {8579#true} main_~tmp~16#1 := main_#t~nondet72#1;havoc main_#t~nondet72#1;main_#t~switch73#1 := 0bv32 == main_~tmp~16#1; {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {8579#true} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 1bv32 == main_~tmp~16#1; {8579#true} is VALID [2022-02-20 22:08:21,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {8579#true} assume !main_#t~switch73#1;main_#t~switch73#1 := main_#t~switch73#1 || 2bv32 == main_~tmp~16#1; {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {8579#true} assume main_#t~switch73#1; {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {8579#true} assume 0bv32 != ~ldv_state_variable_2~0;main_~tmp___1~0#1 := main_#t~nondet77#1;havoc main_#t~nondet77#1;main_#t~switch78#1 := 0bv32 == main_~tmp___1~0#1; {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {8579#true} assume main_#t~switch78#1; {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {8579#true} assume 1bv32 == ~ldv_state_variable_2~0; {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L272 TraceCheckUtils]: 35: Hoare triple {8579#true} call main_#t~ret79#1 := iio_interrupt_trigger_probe(~iio_interrupt_trigger_driver_group1~0.base, ~iio_interrupt_trigger_driver_group1~0.offset); {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {8579#true} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~trig_info~0#1.base, ~trig_info~0#1.offset;havoc ~trig~0#1.base, ~trig~0#1.offset;havoc ~irqflags~0#1;havoc ~irq_res~0#1.base, ~irq_res~0#1.offset;havoc ~irq~0#1;havoc ~ret~0#1;havoc ~tmp~10#1.base, ~tmp~10#1.offset;~ret~0#1 := 0bv32;assume { :begin_inline_platform_get_resource } true;platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset, platform_get_resource_#in~arg1#1, platform_get_resource_#in~arg2#1 := ~pdev#1.base, ~pdev#1.offset, 1024bv32, 0bv32;havoc platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;havoc platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset, platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset, platform_get_resource_~arg1#1, platform_get_resource_~arg2#1;platform_get_resource_~arg0#1.base, platform_get_resource_~arg0#1.offset := platform_get_resource_#in~arg0#1.base, platform_get_resource_#in~arg0#1.offset;platform_get_resource_~arg1#1 := platform_get_resource_#in~arg1#1;platform_get_resource_~arg2#1 := platform_get_resource_#in~arg2#1; {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L272 TraceCheckUtils]: 37: Hoare triple {8579#true} call platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset := ldv_malloc(56bv64); {8579#true} is VALID [2022-02-20 22:08:21,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {8579#true} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8579#true} is VALID [2022-02-20 22:08:21,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {8579#true} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {8701#(and (= (_ bv0 64) |ldv_malloc_#res.offset|) (= (_ bv0 64) |ldv_malloc_#res.base|))} is VALID [2022-02-20 22:08:21,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {8701#(and (= (_ bv0 64) |ldv_malloc_#res.offset|) (= (_ bv0 64) |ldv_malloc_#res.base|))} assume true; {8701#(and (= (_ bv0 64) |ldv_malloc_#res.offset|) (= (_ bv0 64) |ldv_malloc_#res.base|))} is VALID [2022-02-20 22:08:21,171 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8701#(and (= (_ bv0 64) |ldv_malloc_#res.offset|) (= (_ bv0 64) |ldv_malloc_#res.base|))} {8579#true} #447#return; {8708#(and (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#t~ret93#1.base|) (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#t~ret93#1.offset|))} is VALID [2022-02-20 22:08:21,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {8708#(and (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#t~ret93#1.base|) (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#t~ret93#1.offset|))} platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset := platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset;havoc platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset; {8712#(and (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#res#1.base|) (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#res#1.offset|))} is VALID [2022-02-20 22:08:21,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {8712#(and (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#res#1.base|) (= (_ bv0 64) |iio_interrupt_trigger_probe_platform_get_resource_#res#1.offset|))} #t~ret47#1.base, #t~ret47#1.offset := platform_get_resource_#res#1.base, platform_get_resource_#res#1.offset;assume { :end_inline_platform_get_resource } true;~irq_res~0#1.base, ~irq_res~0#1.offset := #t~ret47#1.base, #t~ret47#1.offset;havoc #t~ret47#1.base, #t~ret47#1.offset; {8716#(and (= |iio_interrupt_trigger_probe_~irq_res~0#1.offset| (_ bv0 64)) (= (_ bv0 64) |iio_interrupt_trigger_probe_~irq_res~0#1.base|))} is VALID [2022-02-20 22:08:21,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {8716#(and (= |iio_interrupt_trigger_probe_~irq_res~0#1.offset| (_ bv0 64)) (= (_ bv0 64) |iio_interrupt_trigger_probe_~irq_res~0#1.base|))} assume !(0bv64 == ~bvadd64(~irq_res~0#1.base, ~irq_res~0#1.offset));call #t~mem48#1 := read~intINTTYPE8(~irq_res~0#1.base, ~bvadd64(24bv64, ~irq_res~0#1.offset), 8bv64);~irqflags~0#1 := ~bvor64(128bv64, ~bvand64(15bv64, #t~mem48#1));havoc #t~mem48#1;call #t~mem49#1 := read~intINTTYPE8(~irq_res~0#1.base, ~irq_res~0#1.offset, 8bv64);~irq~0#1 := #t~mem49#1[32:0];havoc #t~mem49#1;havoc #t~nondet50#1.base, #t~nondet50#1.offset;~trig~0#1.base, ~trig~0#1.offset := #t~nondet50#1.base, #t~nondet50#1.offset; {8580#false} is VALID [2022-02-20 22:08:21,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {8580#false} assume !(0bv64 == ~bvadd64(~trig~0#1.base, ~trig~0#1.offset));assume { :begin_inline_kzalloc } true;kzalloc_#in~size#1, kzalloc_#in~flags#1 := 4bv64, 208bv32;havoc kzalloc_#res#1.base, kzalloc_#res#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset, kzalloc_~size#1, kzalloc_~flags#1, kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;kzalloc_~size#1 := kzalloc_#in~size#1;kzalloc_~flags#1 := kzalloc_#in~flags#1;havoc kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset;assume { :begin_inline_kmalloc } true;kmalloc_#in~size#1, kmalloc_#in~flags#1 := kzalloc_~size#1, ~bvor32(32768bv32, kzalloc_~flags#1);havoc kmalloc_#res#1.base, kmalloc_#res#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset, kmalloc_~size#1, kmalloc_~flags#1, kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;kmalloc_~size#1 := kmalloc_#in~size#1;kmalloc_~flags#1 := kmalloc_#in~flags#1;havoc kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := kmalloc_~size#1, kmalloc_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {8580#false} is VALID [2022-02-20 22:08:21,173 INFO L272 TraceCheckUtils]: 46: Hoare triple {8580#false} call __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset := ldv_malloc(__kmalloc_~size#1); {8580#false} is VALID [2022-02-20 22:08:21,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {8580#false} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet12;havoc #t~nondet12; {8580#false} is VALID [2022-02-20 22:08:21,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {8580#false} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {8580#false} is VALID [2022-02-20 22:08:21,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {8580#false} assume true; {8580#false} is VALID [2022-02-20 22:08:21,174 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8580#false} {8580#false} #449#return; {8580#false} is VALID [2022-02-20 22:08:21,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {8580#false} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset;havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; {8580#false} is VALID [2022-02-20 22:08:21,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {8580#false} kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset := kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;havoc kmalloc_#t~ret7#1.base, kmalloc_#t~ret7#1.offset;kmalloc_#res#1.base, kmalloc_#res#1.offset := kmalloc_~tmp___2~0#1.base, kmalloc_~tmp___2~0#1.offset; {8580#false} is VALID [2022-02-20 22:08:21,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {8580#false} kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset := kmalloc_#res#1.base, kmalloc_#res#1.offset;assume { :end_inline_kmalloc } true;kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset := kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;havoc kzalloc_#t~ret8#1.base, kzalloc_#t~ret8#1.offset;kzalloc_#res#1.base, kzalloc_#res#1.offset := kzalloc_~tmp~0#1.base, kzalloc_~tmp~0#1.offset; {8580#false} is VALID [2022-02-20 22:08:21,175 INFO L290 TraceCheckUtils]: 54: Hoare triple {8580#false} #t~ret51#1.base, #t~ret51#1.offset := kzalloc_#res#1.base, kzalloc_#res#1.offset;assume { :end_inline_kzalloc } true;~tmp~10#1.base, ~tmp~10#1.offset := #t~ret51#1.base, #t~ret51#1.offset;havoc #t~ret51#1.base, #t~ret51#1.offset;~trig_info~0#1.base, ~trig_info~0#1.offset := ~tmp~10#1.base, ~tmp~10#1.offset; {8580#false} is VALID [2022-02-20 22:08:21,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {8580#false} assume 0bv64 == ~bvadd64(~trig_info~0#1.base, ~trig_info~0#1.offset);~ret~0#1 := 4294967284bv32; {8580#false} is VALID [2022-02-20 22:08:21,176 INFO L272 TraceCheckUtils]: 56: Hoare triple {8580#false} call iio_trigger_put(~trig~0#1.base, ~trig~0#1.offset); {8580#false} is VALID [2022-02-20 22:08:21,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {8580#false} ~trig#1.base, ~trig#1.offset := #in~trig#1.base, #in~trig#1.offset;call #t~mem40#1.base, #t~mem40#1.offset := read~$Pointer$(~trig#1.base, ~trig#1.offset, 8bv64);call #t~mem41#1.base, #t~mem41#1.offset := read~$Pointer$(#t~mem40#1.base, #t~mem40#1.offset, 8bv64);assume { :begin_inline_ldv_module_put_5 } true;ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset := #t~mem41#1.base, #t~mem41#1.offset;havoc ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset;ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset := ldv_module_put_5_#in~ldv_func_arg1#1.base, ldv_module_put_5_#in~ldv_func_arg1#1.offset; {8580#false} is VALID [2022-02-20 22:08:21,177 INFO L272 TraceCheckUtils]: 58: Hoare triple {8580#false} call ldv_module_put(ldv_module_put_5_~ldv_func_arg1#1.base, ldv_module_put_5_~ldv_func_arg1#1.offset); {8580#false} is VALID [2022-02-20 22:08:21,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {8580#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {8580#false} is VALID [2022-02-20 22:08:21,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {8580#false} assume 0bv64 != ~bvadd64(~module.base, ~module.offset); {8580#false} is VALID [2022-02-20 22:08:21,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {8580#false} assume ~bvsle32(~ldv_module_refcounter~0, 1bv32); {8580#false} is VALID [2022-02-20 22:08:21,180 INFO L272 TraceCheckUtils]: 62: Hoare triple {8580#false} call ldv_error(); {8580#false} is VALID [2022-02-20 22:08:21,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2022-02-20 22:08:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 22:08:21,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:08:21,181 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:08:21,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209930512] [2022-02-20 22:08:21,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209930512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:08:21,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:08:21,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:08:21,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709410268] [2022-02-20 22:08:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:08:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-02-20 22:08:21,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:08:21,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:21,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:21,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:08:21,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:08:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:08:21,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:08:21,249 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:22,716 INFO L93 Difference]: Finished difference Result 825 states and 1105 transitions. [2022-02-20 22:08:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 22:08:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-02-20 22:08:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:08:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 459 transitions. [2022-02-20 22:08:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 459 transitions. [2022-02-20 22:08:22,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 459 transitions. [2022-02-20 22:08:23,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:08:23,153 INFO L225 Difference]: With dead ends: 825 [2022-02-20 22:08:23,153 INFO L226 Difference]: Without dead ends: 421 [2022-02-20 22:08:23,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:08:23,155 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 5 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:08:23,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1110 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:08:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-02-20 22:08:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 417. [2022-02-20 22:08:23,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:08:23,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 417 states, 330 states have (on average 1.3303030303030303) internal successors, (439), 334 states have internal predecessors, (439), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:23,169 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 417 states, 330 states have (on average 1.3303030303030303) internal successors, (439), 334 states have internal predecessors, (439), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:23,169 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 417 states, 330 states have (on average 1.3303030303030303) internal successors, (439), 334 states have internal predecessors, (439), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:23,180 INFO L93 Difference]: Finished difference Result 421 states and 560 transitions. [2022-02-20 22:08:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 560 transitions. [2022-02-20 22:08:23,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:23,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:23,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 417 states, 330 states have (on average 1.3303030303030303) internal successors, (439), 334 states have internal predecessors, (439), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) Second operand 421 states. [2022-02-20 22:08:23,183 INFO L87 Difference]: Start difference. First operand has 417 states, 330 states have (on average 1.3303030303030303) internal successors, (439), 334 states have internal predecessors, (439), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) Second operand 421 states. [2022-02-20 22:08:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:08:23,193 INFO L93 Difference]: Finished difference Result 421 states and 560 transitions. [2022-02-20 22:08:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 560 transitions. [2022-02-20 22:08:23,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:08:23,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:08:23,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:08:23,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:08:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 330 states have (on average 1.3303030303030303) internal successors, (439), 334 states have internal predecessors, (439), 57 states have call successors, (57), 28 states have call predecessors, (57), 29 states have return successors, (60), 58 states have call predecessors, (60), 56 states have call successors, (60) [2022-02-20 22:08:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 556 transitions. [2022-02-20 22:08:23,206 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 556 transitions. Word has length 64 [2022-02-20 22:08:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:08:23,207 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 556 transitions. [2022-02-20 22:08:23,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:08:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 556 transitions. [2022-02-20 22:08:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 22:08:23,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:08:23,208 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:08:23,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 22:08:23,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:08:23,421 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:08:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:08:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1864691340, now seen corresponding path program 1 times [2022-02-20 22:08:23,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:08:23,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907500003] [2022-02-20 22:08:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:08:23,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:08:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:08:23,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:08:23,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 22:08:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 22:08:23,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 22:08:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 22:08:24,114 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 22:08:24,114 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 22:08:24,115 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 22:08:24,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 22:08:24,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:08:24,332 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 22:08:24,334 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 22:08:24,409 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #Ultimate.meminit(#t~malloc16, 1bv64, ~size, ~size); [2022-02-20 22:08:24,410 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 22:08:24,415 INFO L158 Benchmark]: Toolchain (without parser) took 12026.65ms. Allocated memory was 65.0MB in the beginning and 188.7MB in the end (delta: 123.7MB). Free memory was 41.2MB in the beginning and 104.3MB in the end (delta: -63.1MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. [2022-02-20 22:08:24,415 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 22:08:24,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.81ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 41.0MB in the beginning and 48.4MB in the end (delta: -7.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-02-20 22:08:24,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.47ms. Allocated memory is still 88.1MB. Free memory was 48.4MB in the beginning and 43.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 22:08:24,418 INFO L158 Benchmark]: Boogie Preprocessor took 52.65ms. Allocated memory is still 88.1MB. Free memory was 43.1MB in the beginning and 37.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 22:08:24,419 INFO L158 Benchmark]: RCFGBuilder took 890.72ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 36.8MB in the beginning and 68.8MB in the end (delta: -32.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-02-20 22:08:24,419 INFO L158 Benchmark]: TraceAbstraction took 10398.03ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 68.2MB in the beginning and 105.3MB in the end (delta: -37.2MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2022-02-20 22:08:24,421 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.16ms. Allocated memory is still 65.0MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.81ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 41.0MB in the beginning and 48.4MB in the end (delta: -7.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.47ms. Allocated memory is still 88.1MB. Free memory was 48.4MB in the beginning and 43.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.65ms. Allocated memory is still 88.1MB. Free memory was 43.1MB in the beginning and 37.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 890.72ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 36.8MB in the beginning and 68.8MB in the end (delta: -32.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10398.03ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 68.2MB in the beginning and 105.3MB in the end (delta: -37.2MB). Peak memory consumption was 81.0MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 22:08:24,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator