./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 --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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 --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.3.0-?-798a7b3-m [2025-03-04 04:10:51,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:10:51,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:10:51,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:10:51,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:10:51,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:10:51,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:10:51,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:10:51,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:10:51,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:10:51,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:10:51,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:10:51,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:10:51,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:10:51,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:10:51,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:10:51,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:10:51,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:10:51,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:10:51,211 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 [2025-03-04 04:10:51,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:10:51,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:10:51,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:10:51,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:10:51,452 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:10:51,453 INFO L431 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 [2025-03-04 04:10:52,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a859eca9/a013aa4a4523489a8a194d5d45a0058e/FLAGe51ba4df0 [2025-03-04 04:10:52,933 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:10:52,934 INFO L180 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 [2025-03-04 04:10:52,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a859eca9/a013aa4a4523489a8a194d5d45a0058e/FLAGe51ba4df0 [2025-03-04 04:10:53,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a859eca9/a013aa4a4523489a8a194d5d45a0058e [2025-03-04 04:10:53,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:10:53,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:10:53,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:10:53,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:10:53,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:10:53,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:53,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db3f6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53, skipping insertion in model container [2025-03-04 04:10:53,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:53,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:10:53,701 WARN L250 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] [2025-03-04 04:10:53,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:10:53,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:10:53,870 WARN L250 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] [2025-03-04 04:10:53,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:10:53,904 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:10:53,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53 WrapperNode [2025-03-04 04:10:53,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:10:53,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:10:53,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:10:53,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:10:53,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:53,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:53,957 INFO L138 Inliner]: procedures = 90, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 594 [2025-03-04 04:10:53,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:10:53,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:10:53,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:10:53,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:10:53,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:53,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:53,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,019 INFO L175 MemorySlicer]: Split 42 memory accesses to 3 slices as follows [2, 25, 15]. 60 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 0, 4]. The 29 writes are split as follows [0, 25, 4]. [2025-03-04 04:10:54,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:10:54,078 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:10:54,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:10:54,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:10:54,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (1/1) ... [2025-03-04 04:10:54,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:10:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:10:54,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:10:54,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:10:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:10:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 04:10:54,163 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2025-03-04 04:10:54,163 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:10:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-04 04:10:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-04 04:10:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:10:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:10:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:10:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:10:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:10:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:10:54,165 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:10:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:10:54,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:10:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2025-03-04 04:10:54,166 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2025-03-04 04:10:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-03-04 04:10:54,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-03-04 04:10:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:10:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 04:10:54,166 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 04:10:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:10:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:10:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:10:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:10:54,167 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:10:54,168 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-04 04:10:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:10:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2025-03-04 04:10:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:10:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:10:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:10:54,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:10:54,171 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2025-03-04 04:10:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2025-03-04 04:10:54,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:10:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:10:54,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:10:54,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:10:54,434 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc #t~mem21.base, #t~mem21.offset; [2025-03-04 04:10:54,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; [2025-03-04 04:10:54,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3459: havoc request_threaded_irq_#t~nondet96#1; [2025-03-04 04:10:54,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452: havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset; [2025-03-04 04:10:54,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: havoc iio_trigger_register_#t~nondet94#1; [2025-03-04 04:10:54,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3433: havoc iio_trigger_alloc_#t~ret93#1.base, iio_trigger_alloc_#t~ret93#1.offset; [2025-03-04 04:10:54,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:10:58,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424: havoc __platform_driver_register_#t~nondet92#1; [2025-03-04 04:10:58,985 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-03-04 04:10:58,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:10:59,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:10:59,005 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:10:59,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:10:59 BoogieIcfgContainer [2025-03-04 04:10:59,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:10:59,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:10:59,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:10:59,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:10:59,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:10:53" (1/3) ... [2025-03-04 04:10:59,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ca28cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:10:59, skipping insertion in model container [2025-03-04 04:10:59,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:10:53" (2/3) ... [2025-03-04 04:10:59,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ca28cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:10:59, skipping insertion in model container [2025-03-04 04:10:59,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:10:59" (3/3) ... [2025-03-04 04:10:59,014 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-03-04 04:10:59,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:10:59,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i that has 16 procedures, 205 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 04:10:59,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:10:59,106 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77a64156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:10:59,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:10:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 155 states have (on average 1.367741935483871) internal successors, (212), 165 states have internal predecessors, (212), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 04:10:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 04:10:59,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:10:59,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:10:59,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:10:59,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:10:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1594809725, now seen corresponding path program 1 times [2025-03-04 04:10:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:10:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502329337] [2025-03-04 04:10:59,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:10:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:10:59,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 04:10:59,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 04:10:59,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:10:59,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:10:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 04:10:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:10:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502329337] [2025-03-04 04:10:59,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502329337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:10:59,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:10:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:10:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403669915] [2025-03-04 04:10:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:10:59,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:10:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:10:59,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:10:59,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:10:59,560 INFO L87 Difference]: Start difference. First operand has 204 states, 155 states have (on average 1.367741935483871) internal successors, (212), 165 states have internal predecessors, (212), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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) [2025-03-04 04:11:03,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:11:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:03,670 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2025-03-04 04:11:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:03,672 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 [2025-03-04 04:11:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:03,680 INFO L225 Difference]: With dead ends: 579 [2025-03-04 04:11:03,680 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 04:11:03,683 INFO L434 NwaCegarLoop]: 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 [2025-03-04 04:11:03,685 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 243 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:03,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 503 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 04:11:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 04:11:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2025-03-04 04:11:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 281 states have (on average 1.3202846975088969) internal successors, (371), 286 states have internal predecessors, (371), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 04:11:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 473 transitions. [2025-03-04 04:11:03,751 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 473 transitions. Word has length 16 [2025-03-04 04:11:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 473 transitions. [2025-03-04 04:11:03,752 INFO L472 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) [2025-03-04 04:11:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 473 transitions. [2025-03-04 04:11:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 04:11:03,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:03,754 INFO L218 NwaCegarLoop]: 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] [2025-03-04 04:11:03,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:11:03,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash -936763077, now seen corresponding path program 1 times [2025-03-04 04:11:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:03,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24414871] [2025-03-04 04:11:03,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 04:11:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 04:11:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:03,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 04:11:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24414871] [2025-03-04 04:11:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24414871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:03,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:03,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:11:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020867091] [2025-03-04 04:11:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:03,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:03,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:03,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:03,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:11:03,981 INFO L87 Difference]: Start difference. First operand 359 states and 473 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) [2025-03-04 04:11:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:04,027 INFO L93 Difference]: Finished difference Result 369 states and 481 transitions. [2025-03-04 04:11:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:04,028 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 [2025-03-04 04:11:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:04,031 INFO L225 Difference]: With dead ends: 369 [2025-03-04 04:11:04,033 INFO L226 Difference]: Without dead ends: 364 [2025-03-04 04:11:04,033 INFO L434 NwaCegarLoop]: 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 [2025-03-04 04:11:04,034 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 246 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:04,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 256 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-04 04:11:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 359. [2025-03-04 04:11:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 281 states have (on average 1.3167259786476868) internal successors, (370), 286 states have internal predecessors, (370), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 04:11:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2025-03-04 04:11:04,064 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 32 [2025-03-04 04:11:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:04,064 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2025-03-04 04:11:04,064 INFO L472 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) [2025-03-04 04:11:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2025-03-04 04:11:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 04:11:04,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:04,065 INFO L218 NwaCegarLoop]: 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] [2025-03-04 04:11:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:11:04,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -908133926, now seen corresponding path program 1 times [2025-03-04 04:11:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357594646] [2025-03-04 04:11:04,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:04,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 04:11:04,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 04:11:04,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:04,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 04:11:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357594646] [2025-03-04 04:11:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357594646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:11:04,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303927014] [2025-03-04 04:11:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:04,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:04,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:04,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:11:04,226 INFO L87 Difference]: Start difference. First operand 359 states and 472 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) [2025-03-04 04:11:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:04,258 INFO L93 Difference]: Finished difference Result 712 states and 950 transitions. [2025-03-04 04:11:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:04,258 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 [2025-03-04 04:11:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:04,261 INFO L225 Difference]: With dead ends: 712 [2025-03-04 04:11:04,261 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 04:11:04,262 INFO L434 NwaCegarLoop]: 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 [2025-03-04 04:11:04,263 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:04,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 244 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 04:11:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2025-03-04 04:11:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 273 states have (on average 1.3113553113553114) internal successors, (358), 277 states have internal predecessors, (358), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 04:11:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 459 transitions. [2025-03-04 04:11:04,290 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 459 transitions. Word has length 32 [2025-03-04 04:11:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:04,290 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 459 transitions. [2025-03-04 04:11:04,290 INFO L472 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) [2025-03-04 04:11:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 459 transitions. [2025-03-04 04:11:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 04:11:04,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:04,292 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 04:11:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:11:04,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash 245414114, now seen corresponding path program 1 times [2025-03-04 04:11:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220879573] [2025-03-04 04:11:04,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:04,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 04:11:04,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 04:11:04,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 04:11:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220879573] [2025-03-04 04:11:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220879573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:04,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:11:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475375239] [2025-03-04 04:11:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:04,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:04,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:11:04,412 INFO L87 Difference]: Start difference. First operand 350 states and 459 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 04:11:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:04,475 INFO L93 Difference]: Finished difference Result 780 states and 1034 transitions. [2025-03-04 04:11:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2025-03-04 04:11:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:04,478 INFO L225 Difference]: With dead ends: 780 [2025-03-04 04:11:04,479 INFO L226 Difference]: Without dead ends: 433 [2025-03-04 04:11:04,479 INFO L434 NwaCegarLoop]: 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 [2025-03-04 04:11:04,481 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 56 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:04,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 464 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-04 04:11:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2025-03-04 04:11:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 344 states have (on average 1.3284883720930232) internal successors, (457), 348 states have internal predecessors, (457), 59 states have call successors, (59), 28 states have call predecessors, (59), 27 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 04:11:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 574 transitions. [2025-03-04 04:11:04,514 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 574 transitions. Word has length 49 [2025-03-04 04:11:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:04,515 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 574 transitions. [2025-03-04 04:11:04,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 04:11:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 574 transitions. [2025-03-04 04:11:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 04:11:04,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:04,519 INFO L218 NwaCegarLoop]: 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] [2025-03-04 04:11:04,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:11:04,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -189718062, now seen corresponding path program 1 times [2025-03-04 04:11:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003282984] [2025-03-04 04:11:04,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:04,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 04:11:04,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 04:11:04,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:04,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 04:11:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003282984] [2025-03-04 04:11:04,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003282984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:11:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101255069] [2025-03-04 04:11:04,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:04,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:04,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:04,804 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) [2025-03-04 04:11:04,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:11:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 04:11:05,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 04:11:05,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:05,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:05,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:11:05,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 04:11:05,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:05,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101255069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:05,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:11:05,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 04:11:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218883340] [2025-03-04 04:11:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:05,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:05,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:05,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:05,186 INFO L87 Difference]: Start difference. First operand 431 states and 574 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) [2025-03-04 04:11:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:05,269 INFO L93 Difference]: Finished difference Result 1237 states and 1650 transitions. [2025-03-04 04:11:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:05,270 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 [2025-03-04 04:11:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:05,276 INFO L225 Difference]: With dead ends: 1237 [2025-03-04 04:11:05,277 INFO L226 Difference]: Without dead ends: 809 [2025-03-04 04:11:05,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:05,279 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 172 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:05,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 493 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-04 04:11:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 805. [2025-03-04 04:11:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 653 states have (on average 1.333843797856049) internal successors, (871), 661 states have internal predecessors, (871), 101 states have call successors, (101), 51 states have call predecessors, (101), 50 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 04:11:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1072 transitions. [2025-03-04 04:11:05,330 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1072 transitions. Word has length 73 [2025-03-04 04:11:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:05,332 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1072 transitions. [2025-03-04 04:11:05,332 INFO L472 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) [2025-03-04 04:11:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1072 transitions. [2025-03-04 04:11:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 04:11:05,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:05,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 04:11:05,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 04:11:05,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:05,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 396910448, now seen corresponding path program 1 times [2025-03-04 04:11:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:05,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328728956] [2025-03-04 04:11:05,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:05,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 04:11:05,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 04:11:05,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:05,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 04:11:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328728956] [2025-03-04 04:11:06,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328728956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:11:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052581095] [2025-03-04 04:11:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:06,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:06,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:06,018 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) [2025-03-04 04:11:06,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:11:06,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 04:11:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 04:11:06,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:06,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:06,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 04:11:06,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 04:11:06,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:06,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052581095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:06,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:11:06,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 04:11:06,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817892418] [2025-03-04 04:11:06,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:06,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:06,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:11:06,332 INFO L87 Difference]: Start difference. First operand 805 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:11:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:06,373 INFO L93 Difference]: Finished difference Result 1607 states and 2145 transitions. [2025-03-04 04:11:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2025-03-04 04:11:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:06,381 INFO L225 Difference]: With dead ends: 1607 [2025-03-04 04:11:06,382 INFO L226 Difference]: Without dead ends: 805 [2025-03-04 04:11:06,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:11:06,385 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:06,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 471 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-04 04:11:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-04 04:11:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 653 states have (on average 1.327718223583461) internal successors, (867), 661 states have internal predecessors, (867), 101 states have call successors, (101), 51 states have call predecessors, (101), 50 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 04:11:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1068 transitions. [2025-03-04 04:11:06,431 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1068 transitions. Word has length 75 [2025-03-04 04:11:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:06,431 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1068 transitions. [2025-03-04 04:11:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:11:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1068 transitions. [2025-03-04 04:11:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 04:11:06,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:06,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 04:11:06,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:11:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 04:11:06,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1570347036, now seen corresponding path program 1 times [2025-03-04 04:11:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221581148] [2025-03-04 04:11:06,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:06,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 04:11:06,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 04:11:06,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:06,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 04:11:07,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:07,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221581148] [2025-03-04 04:11:07,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221581148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:11:07,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687034217] [2025-03-04 04:11:07,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:07,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:07,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:07,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:07,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:11:07,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 04:11:07,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 04:11:07,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:07,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:07,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 04:11:07,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 04:11:07,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687034217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:11:07,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 04:11:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264419891] [2025-03-04 04:11:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:07,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:11:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:07,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:11:07,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:07,379 INFO L87 Difference]: Start difference. First operand 805 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:11:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:07,446 INFO L93 Difference]: Finished difference Result 1627 states and 2169 transitions. [2025-03-04 04:11:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:11:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-04 04:11:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:07,452 INFO L225 Difference]: With dead ends: 1627 [2025-03-04 04:11:07,452 INFO L226 Difference]: Without dead ends: 825 [2025-03-04 04:11:07,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:07,455 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:07,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1168 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-04 04:11:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 825. [2025-03-04 04:11:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 669 states have (on average 1.3198804185351272) internal successors, (883), 677 states have internal predecessors, (883), 101 states have call successors, (101), 51 states have call predecessors, (101), 54 states have return successors, (112), 104 states have call predecessors, (112), 100 states have call successors, (112) [2025-03-04 04:11:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1096 transitions. [2025-03-04 04:11:07,508 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1096 transitions. Word has length 77 [2025-03-04 04:11:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:07,509 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1096 transitions. [2025-03-04 04:11:07,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:11:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1096 transitions. [2025-03-04 04:11:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 04:11:07,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:07,513 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2025-03-04 04:11:07,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:11:07,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:07,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 260482915, now seen corresponding path program 1 times [2025-03-04 04:11:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783107750] [2025-03-04 04:11:07,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:07,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 04:11:07,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 04:11:07,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 04:11:08,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:11:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783107750] [2025-03-04 04:11:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783107750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:11:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579546814] [2025-03-04 04:11:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:08,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:08,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:11:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 04:11:08,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 04:11:08,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:08,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:08,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 04:11:08,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 04:11:08,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579546814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:08,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:11:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 04:11:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564394048] [2025-03-04 04:11:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:11:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:11:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:11:08,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:08,507 INFO L87 Difference]: Start difference. First operand 825 states and 1096 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 04:11:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:08,570 INFO L93 Difference]: Finished difference Result 1659 states and 2209 transitions. [2025-03-04 04:11:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:11:08,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2025-03-04 04:11:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:08,575 INFO L225 Difference]: With dead ends: 1659 [2025-03-04 04:11:08,575 INFO L226 Difference]: Without dead ends: 837 [2025-03-04 04:11:08,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:08,578 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:08,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1164 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-04 04:11:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2025-03-04 04:11:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 681 states have (on average 1.3142437591776799) internal successors, (895), 685 states have internal predecessors, (895), 101 states have call successors, (101), 51 states have call predecessors, (101), 54 states have return successors, (112), 108 states have call predecessors, (112), 100 states have call successors, (112) [2025-03-04 04:11:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1108 transitions. [2025-03-04 04:11:08,612 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1108 transitions. Word has length 83 [2025-03-04 04:11:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1108 transitions. [2025-03-04 04:11:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 04:11:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1108 transitions. [2025-03-04 04:11:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 04:11:08,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:08,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2025-03-04 04:11:08,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 04:11:08,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:08,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:08,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1334209750, now seen corresponding path program 2 times [2025-03-04 04:11:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:11:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894786968] [2025-03-04 04:11:08,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:11:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:11:08,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 04:11:08,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 04:11:08,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:11:08,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 04:11:08,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 04:11:08,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 04:11:09,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 04:11:09,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:09,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 04:11:09,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 04:11:09,074 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 04:11:09,075 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 04:11:09,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:11:09,079 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:11:09,198 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 04:11:09,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:11:09 BoogieIcfgContainer [2025-03-04 04:11:09,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 04:11:09,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 04:11:09,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 04:11:09,206 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 04:11:09,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:10:59" (3/4) ... [2025-03-04 04:11:09,207 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 04:11:09,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 04:11:09,209 INFO L158 Benchmark]: Toolchain (without parser) took 16029.09ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 101.7MB in the beginning and 207.4MB in the end (delta: -105.7MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.60ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 49.7MB in the end (delta: 52.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.87ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 45.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: Boogie Preprocessor took 119.11ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 37.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: IcfgBuilder took 4927.87ms. Allocated memory is still 142.6MB. Free memory was 37.4MB in the beginning and 43.9MB in the end (delta: -6.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: TraceAbstraction took 10197.60ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 43.2MB in the beginning and 211.6MB in the end (delta: -168.5MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-03-04 04:11:09,209 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 402.7MB. Free memory was 211.6MB in the beginning and 207.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 04:11:09,210 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.60ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 49.7MB in the end (delta: 52.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.87ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 45.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 119.11ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 37.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4927.87ms. Allocated memory is still 142.6MB. Free memory was 37.4MB in the beginning and 43.9MB in the end (delta: -6.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10197.60ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 43.2MB in the beginning and 211.6MB in the end (delta: -168.5MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 402.7MB. Free memory was 211.6MB in the beginning and 207.4MB in the end (delta: 4.2MB). There was no memory consumed. 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 - UnprovableResult [Line: 3317]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 2678. Possible FailurePath: [L2766] int ldv_irq_1_2 = 0; [L2767] int LDV_IN_INTERRUPT = 1; [L2768] int ldv_irq_1_3 = 0; [L2769] void *ldv_irq_data_1_1 ; [L2770] int ldv_irq_1_1 = 0; [L2771] int ldv_irq_1_0 = 0; [L2772] int probed_2 = 0; [L2773] int ldv_irq_line_1_3 ; [L2774] void *ldv_irq_data_1_0 ; [L2775] int ldv_state_variable_0 ; [L2776] int ldv_irq_line_1_0 ; [L2777] int ldv_state_variable_2 ; [L2778] void *ldv_irq_data_1_3 ; [L2779] int ref_cnt ; [L2780] int ldv_irq_line_1_1 ; [L2781] struct platform_device *iio_interrupt_trigger_driver_group1 ; [L2782] void *ldv_irq_data_1_2 ; [L2783] int ldv_state_variable_1 ; [L2784] int ldv_irq_line_1_2 ; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2984] int ldv_retval_0 ; [L2985] int ldv_retval_1 ; [L2988] int ldv_retval_2 ; [L3356] int ldv_module_refcounter = 1; VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3137] int tmp ; [L3138] int tmp___0 ; [L3139] int tmp___1 ; [L3141] FCALL ldv_initialize() [L3142] ldv_state_variable_1 = 1 [L3143] ref_cnt = 0 [L3144] ldv_state_variable_0 = 1 [L3145] ldv_state_variable_2 = 0 VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3147] tmp = __VERIFIER_nondet_int() [L3149] case 0: [L3155] case 1: [L3157] tmp___0 = __VERIFIER_nondet_int() [L3159] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0, tmp=1, tmp___0=1] [L3155] case 1: [L3167] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0, tmp=1] [L3155] case 1: [L3169] CALL, EXPR iio_interrupt_trigger_driver_init() [L2971] int tmp ; [L2973] CALL, EXPR ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L3294] ldv_func_ret_type___0 ldv_func_res ; [L3295] int tmp ; [L3297] CALL, EXPR __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3424] return __VERIFIER_nondet_int(); [L3297] RET, EXPR __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3297] tmp = __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3298] ldv_func_res = tmp [L3299] ldv_state_variable_2 = 1 [L3300] CALL ldv_platform_driver_init_2() [L3102] void *tmp ; [L3104] CALL, EXPR ldv_init_zalloc(1472UL) [L2726] void *p ; [L2727] void *tmp ; [L2729] EXPR, FCALL calloc(1UL, size) VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=1472] [L2729] tmp = calloc(1UL, size) [L2730] p = tmp VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, p={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2731] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2731] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, p={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2732] return (p); VAL [LDV_IN_INTERRUPT=1, \result={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=1472] [L3104] RET, EXPR ldv_init_zalloc(1472UL) [L3104] tmp = ldv_init_zalloc(1472UL) [L3105] iio_interrupt_trigger_driver_group1 = (struct platform_device *)tmp VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3300] RET ldv_platform_driver_init_2() [L3301] return (ldv_func_res); VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2973] RET, EXPR ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L2973] tmp = ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L2974] return (tmp); VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3169] RET, EXPR iio_interrupt_trigger_driver_init() [L3169] ldv_retval_0 = iio_interrupt_trigger_driver_init() [L3155] case 1: [L3171] ldv_state_variable_0 = 3 VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp=1] [L3155] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp=1] [L3147] tmp = __VERIFIER_nondet_int() [L3149] case 0: [L3155] case 1: [L3189] case 2: [L3191] tmp___1 = __VERIFIER_nondet_int() [L3193] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp___1=0] [L3189] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp___1=0] [L3195] CALL iio_interrupt_trigger_probe(iio_interrupt_trigger_driver_group1) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2884] struct iio_interrupt_trigger_info *trig_info ; [L2885] struct iio_trigger *trig ; [L2886] unsigned long irqflags ; [L2887] struct resource *irq_res ; [L2888] int irq ; [L2889] int ret ; [L2890] void *tmp ; [L2892] ret = 0 [L2893] CALL, EXPR platform_get_resource(pdev, 1024U, 0U) [L3452] CALL, EXPR ldv_malloc(sizeof(struct resource)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND FALSE !(tmp___0 != 0) [L2700] tmp = malloc(size) [L2701] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 1 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2702] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2702] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 1 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2703] return (p); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, \result={-(((__int128) 1 << 64) | 18446744073709551615U):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3452] RET, EXPR ldv_malloc(sizeof(struct resource)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3452] return ldv_malloc(sizeof(struct resource)); [L2893] RET, EXPR platform_get_resource(pdev, 1024U, 0U) [L2893] irq_res = platform_get_resource(pdev, 1024U, 0U) [L2894] COND FALSE !((unsigned long )irq_res == (unsigned long )((struct resource *)0)) [L2898] EXPR irq_res->flags VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq_res={-(((__int128) 1 << 64) | 18446744073709551615U):0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0] [L2898] EXPR (irq_res->flags & 15UL) | 128UL VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq_res={-(((__int128) 1 << 64) | 18446744073709551615U):0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0] [L2898] irqflags = (irq_res->flags & 15UL) | 128UL [L2899] EXPR irq_res->start [L2899] irq = (int )irq_res->start [L2900] CALL, EXPR iio_trigger_alloc("irqtrig%d", irq) [L3433] CALL, EXPR ldv_malloc(sizeof(struct iio_trigger)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND FALSE !(tmp___0 != 0) [L2700] tmp = malloc(size) [L2701] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 0 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2702] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2702] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 0 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2703] return (p); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, \result={-(((__int128) 0 << 64) | 18446744073709551615U):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3433] RET, EXPR ldv_malloc(sizeof(struct iio_trigger)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3433] return ldv_malloc(sizeof(struct iio_trigger)); [L2900] RET, EXPR iio_trigger_alloc("irqtrig%d", irq) [L2900] trig = iio_trigger_alloc("irqtrig%d", irq) [L2901] COND FALSE !((unsigned long )trig == (unsigned long )((struct iio_trigger *)0)) [L2906] CALL, EXPR kzalloc(4UL, 208U) [L2676] void *tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, flags=208, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2678] EXPR flags | 32768U VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2678] CALL, EXPR kmalloc(size, flags | 32768U) [L2667] void *tmp___2 ; [L2669] CALL, EXPR __kmalloc(size, flags) [L2662] CALL, EXPR ldv_malloc(size) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND TRUE tmp___0 != 0 [L2698] return ((void *)0); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, \result={0:0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2662] RET, EXPR ldv_malloc(size) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2662] return ldv_malloc(size); [L2669] RET, EXPR __kmalloc(size, flags) [L2669] tmp___2 = __kmalloc(size, flags) [L2670] return (tmp___2); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \result={0:0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2678] RET, EXPR kmalloc(size, flags | 32768U) [L2678] tmp = kmalloc(size, flags | 32768U) [L2679] return (tmp); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \result={0:0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2906] RET, EXPR kzalloc(4UL, 208U) [L2906] tmp = kzalloc(4UL, 208U) [L2907] trig_info = (struct iio_interrupt_trigger_info *)tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=1, irqflags=128, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, trig={-(((__int128) 0 << 64) | 18446744073709551615U):0}, trig_info={0:0}] [L2908] COND TRUE (unsigned long )trig_info == (unsigned long )((struct iio_interrupt_trigger_info *)0) [L2909] ret = -12 VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=1, irqflags=128, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, ret=-12, trig={-(((__int128) 0 << 64) | 18446744073709551615U):0}] [L2935] CALL iio_trigger_put(trig) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2850] EXPR trig->ops [L2850] EXPR (trig->ops)->owner [L2850] CALL ldv_module_put_5((trig->ops)->owner) [L3247] CALL ldv_module_put(ldv_func_arg1) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3387] COND TRUE (unsigned long )module != (unsigned long )((struct module *)0) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3388] COND TRUE ldv_module_refcounter <= 1 VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3389] CALL ldv_error() VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3317] reach_error() VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 205 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 944 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 4763 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2792 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1971 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=837occurred in iteration=8, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3094 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 100/113 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 04:11:09,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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 --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.3.0-?-798a7b3-m [2025-03-04 04:11:11,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:11:11,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-04 04:11:11,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:11:11,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:11:11,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:11:11,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:11:11,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:11:11,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:11:11,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:11:11,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:11:11,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:11:11,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:11:11,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:11:11,334 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:11:11,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:11:11,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:11:11,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:11:11,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:11:11,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:11:11,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:11:11,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:11:11,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:11:11,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 04:11:11,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:11:11,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:11:11,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:11:11,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:11:11,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 [2025-03-04 04:11:11,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:11:11,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:11:11,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:11:11,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:11:11,601 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:11:11,602 INFO L431 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 [2025-03-04 04:11:12,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb802188/c9e6784fdef7423294515d9d78df3413/FLAG43903386f [2025-03-04 04:11:13,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:11:13,237 INFO L180 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 [2025-03-04 04:11:13,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb802188/c9e6784fdef7423294515d9d78df3413/FLAG43903386f [2025-03-04 04:11:13,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb802188/c9e6784fdef7423294515d9d78df3413 [2025-03-04 04:11:13,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:11:13,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:11:13,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:11:13,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:11:13,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:11:13,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:11:13" (1/1) ... [2025-03-04 04:11:13,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d62728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:13, skipping insertion in model container [2025-03-04 04:11:13,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:11:13" (1/1) ... [2025-03-04 04:11:13,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:11:13,741 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,795 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,806 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,807 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,807 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,808 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,808 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,808 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,813 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,814 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,815 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,815 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,840 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,864 WARN L250 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] [2025-03-04 04:11:13,901 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 04:11:13,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:11:13,923 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:11:14,030 WARN L250 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] [2025-03-04 04:11:14,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:11:14,101 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:11:14,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14 WrapperNode [2025-03-04 04:11:14,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:11:14,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:11:14,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:11:14,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:11:14,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,179 INFO L138 Inliner]: procedures = 95, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 553 [2025-03-04 04:11:14,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:11:14,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:11:14,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:11:14,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:11:14,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,260 INFO L175 MemorySlicer]: Split 42 memory accesses to 3 slices as follows [2, 15, 25]. 60 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4, 0]. The 29 writes are split as follows [0, 4, 25]. [2025-03-04 04:11:14,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:11:14,310 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:11:14,310 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:11:14,310 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:11:14,311 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (1/1) ... [2025-03-04 04:11:14,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:11:14,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:14,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:11:14,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:11:14,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:11:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 04:11:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 04:11:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2025-03-04 04:11:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2025-03-04 04:11:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:11:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:11:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:11:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2025-03-04 04:11:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2025-03-04 04:11:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2025-03-04 04:11:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-04 04:11:14,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-04 04:11:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:11:14,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:11:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:11:14,371 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:11:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2025-03-04 04:11:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-03-04 04:11:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 04:11:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#2 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2025-03-04 04:11:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:11:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:11:14,655 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:11:14,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:11:14,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc #t~mem20.base, #t~mem20.offset; [2025-03-04 04:11:14,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; [2025-03-04 04:11:14,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3459: havoc request_threaded_irq_#t~nondet94#1; [2025-03-04 04:11:14,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452: havoc platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset; [2025-03-04 04:11:14,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: havoc iio_trigger_register_#t~nondet92#1; [2025-03-04 04:11:14,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3433: havoc iio_trigger_alloc_#t~ret91#1.base, iio_trigger_alloc_#t~ret91#1.offset; [2025-03-04 04:11:14,978 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:11:19,497 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424: havoc __platform_driver_register_#t~nondet90#1; [2025-03-04 04:11:19,552 INFO L? ?]: Removed 331 outVars from TransFormulas that were not future-live. [2025-03-04 04:11:19,552 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:11:19,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:11:19,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:11:19,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:11:19 BoogieIcfgContainer [2025-03-04 04:11:19,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:11:19,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:11:19,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:11:19,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:11:19,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:11:13" (1/3) ... [2025-03-04 04:11:19,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca20892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:11:19, skipping insertion in model container [2025-03-04 04:11:19,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:11:14" (2/3) ... [2025-03-04 04:11:19,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca20892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:11:19, skipping insertion in model container [2025-03-04 04:11:19,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:11:19" (3/3) ... [2025-03-04 04:11:19,573 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-03-04 04:11:19,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:11:19,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i that has 16 procedures, 197 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 04:11:19,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:11:19,634 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fb429f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:11:19,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:11:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 196 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 157 states have internal predecessors, (200), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 04:11:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 04:11:19,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:19,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:11:19,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:19,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash 555374763, now seen corresponding path program 1 times [2025-03-04 04:11:19,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 04:11:19,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942670183] [2025-03-04 04:11:19,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:19,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:19,656 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) [2025-03-04 04:11:19,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:11:19,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 04:11:19,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 04:11:19,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:19,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:19,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:11:19,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 04:11:20,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:20,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 04:11:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942670183] [2025-03-04 04:11:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942670183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:20,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:20,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 04:11:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441219372] [2025-03-04 04:11:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:20,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 04:11:20,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:11:20,064 INFO L87 Difference]: Start difference. First operand has 196 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 157 states have internal predecessors, (200), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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) [2025-03-04 04:11:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:20,124 INFO L93 Difference]: Finished difference Result 385 states and 526 transitions. [2025-03-04 04:11:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 [2025-03-04 04:11:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:20,131 INFO L225 Difference]: With dead ends: 385 [2025-03-04 04:11:20,131 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 04:11:20,134 INFO L434 NwaCegarLoop]: 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 [2025-03-04 04:11:20,136 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:20,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 250 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:11:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 04:11:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-04 04:11:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 138 states have internal predecessors, (178), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 04:11:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2025-03-04 04:11:20,202 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 16 [2025-03-04 04:11:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2025-03-04 04:11:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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) [2025-03-04 04:11:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2025-03-04 04:11:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 04:11:20,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:20,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:11:20,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:11:20,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:20,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:20,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash 323976607, now seen corresponding path program 1 times [2025-03-04 04:11:20,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 04:11:20,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868442374] [2025-03-04 04:11:20,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:20,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:20,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:20,409 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) [2025-03-04 04:11:20,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:11:20,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 04:11:20,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 04:11:20,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:20,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:20,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:11:20,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:11:20,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:20,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 04:11:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868442374] [2025-03-04 04:11:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868442374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:11:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018539865] [2025-03-04 04:11:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:11:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 04:11:20,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:11:20,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:11:20,748 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 04:11:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:20,863 INFO L93 Difference]: Finished difference Result 393 states and 520 transitions. [2025-03-04 04:11:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:11:20,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-04 04:11:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:20,867 INFO L225 Difference]: With dead ends: 393 [2025-03-04 04:11:20,867 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 04:11:20,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:11:20,868 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 56 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 446 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:20,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 446 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:11:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 04:11:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2025-03-04 04:11:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 174 states have internal predecessors, (229), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 04:11:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2025-03-04 04:11:20,892 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 46 [2025-03-04 04:11:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:20,892 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2025-03-04 04:11:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 04:11:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2025-03-04 04:11:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 04:11:20,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:20,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 04:11:20,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:11:21,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:21,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:21,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1002076478, now seen corresponding path program 1 times [2025-03-04 04:11:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 04:11:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227801666] [2025-03-04 04:11:21,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:21,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:21,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:21,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:11:21,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 04:11:21,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 04:11:21,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:21,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 04:11:21,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 04:11:21,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:21,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 04:11:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227801666] [2025-03-04 04:11:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227801666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:11:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216051959] [2025-03-04 04:11:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:11:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 04:11:21,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:11:21,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:21,646 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:11:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:21,752 INFO L93 Difference]: Finished difference Result 438 states and 586 transitions. [2025-03-04 04:11:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:11:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-04 04:11:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:21,757 INFO L225 Difference]: With dead ends: 438 [2025-03-04 04:11:21,757 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 04:11:21,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:21,761 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1134 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:21,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1134 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:11:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 04:11:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 04:11:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 176 states have (on average 1.3238636363636365) internal successors, (233), 178 states have internal predecessors, (233), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (33), 31 states have call predecessors, (33), 30 states have call successors, (33) [2025-03-04 04:11:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2025-03-04 04:11:21,788 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 71 [2025-03-04 04:11:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:21,788 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2025-03-04 04:11:21,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:11:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2025-03-04 04:11:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 04:11:21,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:21,793 INFO L218 NwaCegarLoop]: 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, 1] [2025-03-04 04:11:21,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 04:11:21,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:21,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:21,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 171419249, now seen corresponding path program 1 times [2025-03-04 04:11:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 04:11:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717259151] [2025-03-04 04:11:21,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:21,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:21,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:21,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:22,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:11:22,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 04:11:22,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 04:11:22,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:22,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:22,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:11:22,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 04:11:22,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:22,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 04:11:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717259151] [2025-03-04 04:11:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717259151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:11:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885483000] [2025-03-04 04:11:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:22,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:11:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 04:11:22,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:11:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:11:22,541 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2025-03-04 04:11:26,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:11:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:26,819 INFO L93 Difference]: Finished difference Result 734 states and 976 transitions. [2025-03-04 04:11:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:11:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 74 [2025-03-04 04:11:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:26,824 INFO L225 Difference]: With dead ends: 734 [2025-03-04 04:11:26,824 INFO L226 Difference]: Without dead ends: 514 [2025-03-04 04:11:26,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:11:26,826 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 420 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:26,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 775 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:11:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-04 04:11:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 504. [2025-03-04 04:11:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 403 states have (on average 1.3250620347394542) internal successors, (534), 407 states have internal predecessors, (534), 64 states have call successors, (64), 35 states have call predecessors, (64), 36 states have return successors, (69), 65 states have call predecessors, (69), 63 states have call successors, (69) [2025-03-04 04:11:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 667 transitions. [2025-03-04 04:11:26,867 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 667 transitions. Word has length 74 [2025-03-04 04:11:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:26,868 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 667 transitions. [2025-03-04 04:11:26,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2025-03-04 04:11:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 667 transitions. [2025-03-04 04:11:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 04:11:26,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:26,872 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 04:11:26,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 04:11:27,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:27,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:27,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2034907993, now seen corresponding path program 1 times [2025-03-04 04:11:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 04:11:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77696331] [2025-03-04 04:11:27,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:11:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:27,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:27,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 04:11:27,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 04:11:27,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 04:11:27,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:11:27,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:11:27,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 04:11:27,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:11:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 04:11:27,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:11:27,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 04:11:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77696331] [2025-03-04 04:11:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77696331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:11:27,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:11:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:11:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3654382] [2025-03-04 04:11:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:11:27,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:11:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 04:11:27,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:11:27,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:27,635 INFO L87 Difference]: Start difference. First operand 504 states and 667 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 04:11:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:11:27,848 INFO L93 Difference]: Finished difference Result 970 states and 1282 transitions. [2025-03-04 04:11:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:11:27,849 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-03-04 04:11:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:11:27,853 INFO L225 Difference]: With dead ends: 970 [2025-03-04 04:11:27,853 INFO L226 Difference]: Without dead ends: 510 [2025-03-04 04:11:27,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:11:27,855 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:11:27,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1129 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:11:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-04 04:11:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-04 04:11:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 409 states have (on average 1.3202933985330074) internal successors, (540), 411 states have internal predecessors, (540), 64 states have call successors, (64), 35 states have call predecessors, (64), 36 states have return successors, (69), 67 states have call predecessors, (69), 63 states have call successors, (69) [2025-03-04 04:11:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 673 transitions. [2025-03-04 04:11:27,892 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 673 transitions. Word has length 77 [2025-03-04 04:11:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:11:27,892 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 673 transitions. [2025-03-04 04:11:27,892 INFO L472 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 04:11:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 673 transitions. [2025-03-04 04:11:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 04:11:27,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:11:27,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-04 04:11:27,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 04:11:28,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:28,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:11:28,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:11:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash -672147508, now seen corresponding path program 2 times [2025-03-04 04:11:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 04:11:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944718380] [2025-03-04 04:11:28,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:11:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:11:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:11:28,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:11:28,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 04:11:28,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes.