./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.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 aa00a102435cd9be2574d2e777aad2e91126f080f8422a74b94328a4b8d020d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:09:08,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:09:08,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:09:08,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:09:08,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:09:08,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:09:08,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:09:08,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:09:08,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:09:08,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:09:08,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:09:08,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:09:08,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:09:08,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:09:08,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:09:08,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:09:08,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:09:08,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:09:08,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:09:08,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:09:08,295 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 -> aa00a102435cd9be2574d2e777aad2e91126f080f8422a74b94328a4b8d020d8 [2025-03-04 04:09:08,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:09:08,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:09:08,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:09:08,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:09:08,519 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:09:08,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-04 04:09:09,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f845729a/597e3850e6814a03a8b87e439b7748e0/FLAG77b7b1ef5 [2025-03-04 04:09:10,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:09:10,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-04 04:09:10,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f845729a/597e3850e6814a03a8b87e439b7748e0/FLAG77b7b1ef5 [2025-03-04 04:09:10,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f845729a/597e3850e6814a03a8b87e439b7748e0 [2025-03-04 04:09:10,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:09:10,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:09:10,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:09:10,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:09:10,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:09:10,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:09:10" (1/1) ... [2025-03-04 04:09:10,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513b7c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:10, skipping insertion in model container [2025-03-04 04:09:10,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:09:10" (1/1) ... [2025-03-04 04:09:10,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:09:10,799 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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] [2025-03-04 04:09:10,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:09:10,848 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:09:10,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [2762] [2025-03-04 04:09:10,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapq %0": "=r" (val): "0" (val)); [2769] [2025-03-04 04:09:11,023 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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] [2025-03-04 04:09:11,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:09:11,080 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:09:11,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11 WrapperNode [2025-03-04 04:09:11,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:09:11,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:09:11,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:09:11,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:09:11,088 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:09:11" (1/1) ... [2025-03-04 04:09:11,127 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:09:11" (1/1) ... [2025-03-04 04:09:11,222 INFO L138 Inliner]: procedures = 150, calls = 795, calls flagged for inlining = 63, calls inlined = 45, statements flattened = 1727 [2025-03-04 04:09:11,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:09:11,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:09:11,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:09:11,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:09:11,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,341 INFO L175 MemorySlicer]: Split 400 memory accesses to 11 slices as follows [10, 2, 4, 4, 54, 14, 1, 9, 27, 267, 8]. 67 percent of accesses are in the largest equivalence class. The 84 initializations are split as follows [10, 2, 0, 4, 9, 14, 0, 3, 8, 26, 8]. The 187 writes are split as follows [0, 0, 2, 0, 41, 0, 0, 0, 14, 130, 0]. [2025-03-04 04:09:11,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:09:11,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:09:11,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:09:11,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:09:11,428 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (1/1) ... [2025-03-04 04:09:11,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:09:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:11,454 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:09:11,458 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:09:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 04:09:11,476 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:09:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-04 04:09:11,477 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2025-03-04 04:09:11,477 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:09:11,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:09:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:09:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_ipmi_data [2025-03-04 04:09:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_ipmi_data [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2025-03-04 04:09:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2025-03-04 04:09:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:09:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure aem_delete [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_delete [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_get [2025-03-04 04:09:11,479 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_get [2025-03-04 04:09:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2025-03-04 04:09:11,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2025-03-04 04:09:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 04:09:11,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:09:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:09:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kzalloc_6 [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kzalloc_6 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure aem_send_message [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_send_message [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_sensors [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_sensors [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_put [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_put [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 04:09:11,485 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 04:09:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2025-03-04 04:09:11,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:09:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-03-04 04:09:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:09:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:09:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure aem_remove_sensors [2025-03-04 04:09:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_remove_sensors [2025-03-04 04:09:11,489 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2025-03-04 04:09:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2025-03-04 04:09:11,489 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 04:09:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 04:09:11,789 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:09:11,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:09:11,812 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4428: havoc #t~ret421.base, #t~ret421.offset; [2025-03-04 04:09:11,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4412: havoc #t~nondet419; [2025-03-04 04:09:11,831 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4512: havoc #t~nondet434; [2025-03-04 04:09:11,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:09:11,929 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906: call ULTIMATE.dealloc(init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset);havoc init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset; [2025-03-04 04:09:11,929 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4465: havoc ipmi_create_user_#t~nondet426#1; [2025-03-04 04:09:11,931 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4530: havoc #t~nondet438; [2025-03-04 04:09:12,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-03-04 04:09:12,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4458: havoc idr_pre_get_#t~nondet425#1; [2025-03-04 04:09:12,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4454: havoc idr_get_new_#t~nondet424#1; [2025-03-04 04:09:12,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4469: havoc #t~nondet427; [2025-03-04 04:09:12,064 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4447: havoc #t~ret423.base, #t~ret423.offset; [2025-03-04 04:09:12,125 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: havoc ipmi_request_settime_#t~nondet428#1; [2025-03-04 04:09:12,126 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4488: havoc ipmi_validate_addr_#t~nondet431#1; [2025-03-04 04:09:12,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc #t~nondet420; [2025-03-04 04:09:17,153 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: call ULTIMATE.dealloc(aem_init_aem2_inst_~#__key~2#1.base, aem_init_aem2_inst_~#__key~2#1.offset);havoc aem_init_aem2_inst_~#__key~2#1.base, aem_init_aem2_inst_~#__key~2#1.offset; [2025-03-04 04:09:17,153 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc ipmi_smi_watcher_register_#t~nondet429#1; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3638: call ULTIMATE.dealloc(aem_init_aem2_~#fi_resp~0#1.base, aem_init_aem2_~#fi_resp~0#1.offset);havoc aem_init_aem2_~#fi_resp~0#1.base, aem_init_aem2_~#fi_resp~0#1.offset; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3672: call ULTIMATE.dealloc(aem_register_bmc_~#probe~0#1.base, aem_register_bmc_~#probe~0#1.offset);havoc aem_register_bmc_~#probe~0#1.base, aem_register_bmc_~#probe~0#1.offset; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: havoc aem_find_aem1_count_#t~mem190#1;call ULTIMATE.dealloc(aem_find_aem1_count_~#ff_req~0#1.base, aem_find_aem1_count_~#ff_req~0#1.offset);havoc aem_find_aem1_count_~#ff_req~0#1.base, aem_find_aem1_count_~#ff_req~0#1.offset;call ULTIMATE.dealloc(aem_find_aem1_count_~#ff_resp~0#1.base, aem_find_aem1_count_~#ff_resp~0#1.offset);havoc aem_find_aem1_count_~#ff_resp~0#1.base, aem_find_aem1_count_~#ff_resp~0#1.offset; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4484: havoc ipmi_smi_watcher_unregister_#t~nondet430#1; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4438: havoc driver_register_#t~nondet422#1; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3514: call ULTIMATE.dealloc(aem_find_aem2_~#fi_req~0#1.base, aem_find_aem2_~#fi_req~0#1.offset);havoc aem_find_aem2_~#fi_req~0#1.base, aem_find_aem2_~#fi_req~0#1.offset; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4522: havoc printk_#t~nondet436#1; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4096: call ULTIMATE.dealloc(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset);havoc main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset; [2025-03-04 04:09:17,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3403: call ULTIMATE.dealloc(aem_init_aem1_inst_~#__key~1#1.base, aem_init_aem1_inst_~#__key~1#1.offset);havoc aem_init_aem1_inst_~#__key~1#1.base, aem_init_aem1_inst_~#__key~1#1.offset; [2025-03-04 04:09:17,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4515: havoc #t~ret435.base, #t~ret435.offset; [2025-03-04 04:09:17,435 INFO L? ?]: Removed 609 outVars from TransFormulas that were not future-live. [2025-03-04 04:09:17,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:09:17,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:09:17,455 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:09:17,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:09:17 BoogieIcfgContainer [2025-03-04 04:09:17,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:09:17,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:09:17,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:09:17,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:09:17,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:09:10" (1/3) ... [2025-03-04 04:09:17,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351d803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:09:17, skipping insertion in model container [2025-03-04 04:09:17,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:11" (2/3) ... [2025-03-04 04:09:17,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351d803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:09:17, skipping insertion in model container [2025-03-04 04:09:17,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:09:17" (3/3) ... [2025-03-04 04:09:17,463 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-04 04:09:17,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:09:17,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i that has 39 procedures, 500 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 04:09:17,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:09:17,542 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;@37032455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:09:17,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:09:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 360 states have internal predecessors, (441), 113 states have call successors, (113), 38 states have call predecessors, (113), 37 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-04 04:09:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-04 04:09:17,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:17,570 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:17,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:17,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash -271713063, now seen corresponding path program 1 times [2025-03-04 04:09:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163678226] [2025-03-04 04:09:17,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:18,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 04:09:18,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 04:09:18,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:18,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 04:09:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163678226] [2025-03-04 04:09:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163678226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788574250] [2025-03-04 04:09:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:18,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:18,924 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:09:18,926 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:09:19,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 04:09:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 04:09:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:20,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:09:20,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-04 04:09:20,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788574250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:09:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745730584] [2025-03-04 04:09:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:20,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:09:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:09:20,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:09:20,399 INFO L87 Difference]: Start difference. First operand has 499 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 360 states have internal predecessors, (441), 113 states have call successors, (113), 38 states have call predecessors, (113), 37 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) Second operand has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 04:09:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:20,460 INFO L93 Difference]: Finished difference Result 994 states and 1348 transitions. [2025-03-04 04:09:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:09:20,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 296 [2025-03-04 04:09:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:20,472 INFO L225 Difference]: With dead ends: 994 [2025-03-04 04:09:20,472 INFO L226 Difference]: Without dead ends: 479 [2025-03-04 04:09:20,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:09:20,479 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:20,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:09:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-04 04:09:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-03-04 04:09:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 336 states have (on average 1.2470238095238095) internal successors, (419), 342 states have internal predecessors, (419), 105 states have call successors, (105), 37 states have call predecessors, (105), 37 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 04:09:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 629 transitions. [2025-03-04 04:09:20,530 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 629 transitions. Word has length 296 [2025-03-04 04:09:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:20,531 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 629 transitions. [2025-03-04 04:09:20,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 04:09:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 629 transitions. [2025-03-04 04:09:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 04:09:20,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:20,537 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:20,550 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:09:20,738 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,SelfDestructingSolverStorable0 [2025-03-04 04:09:20,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:20,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1150987636, now seen corresponding path program 1 times [2025-03-04 04:09:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133382468] [2025-03-04 04:09:20,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:21,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 04:09:21,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 04:09:21,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:21,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 04:09:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133382468] [2025-03-04 04:09:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133382468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746205351] [2025-03-04 04:09:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:21,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:21,811 INFO L87 Difference]: Start difference. First operand 479 states and 629 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 04:09:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:21,947 INFO L93 Difference]: Finished difference Result 996 states and 1306 transitions. [2025-03-04 04:09:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 297 [2025-03-04 04:09:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:21,955 INFO L225 Difference]: With dead ends: 996 [2025-03-04 04:09:21,955 INFO L226 Difference]: Without dead ends: 554 [2025-03-04 04:09:21,956 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:09:21,957 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 138 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1211 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:09:21,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-04 04:09:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-04 04:09:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 396 states have (on average 1.2601010101010102) internal successors, (499), 402 states have internal predecessors, (499), 113 states have call successors, (113), 44 states have call predecessors, (113), 44 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-04 04:09:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 725 transitions. [2025-03-04 04:09:21,997 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 725 transitions. Word has length 297 [2025-03-04 04:09:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 725 transitions. [2025-03-04 04:09:21,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 04:09:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 725 transitions. [2025-03-04 04:09:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-04 04:09:22,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:22,004 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:22,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:09:22,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -752636067, now seen corresponding path program 1 times [2025-03-04 04:09:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633631300] [2025-03-04 04:09:22,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:22,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-04 04:09:22,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-04 04:09:22,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:22,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-03-04 04:09:23,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:23,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633631300] [2025-03-04 04:09:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633631300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:23,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:23,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:23,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591634924] [2025-03-04 04:09:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:23,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:23,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:23,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:23,036 INFO L87 Difference]: Start difference. First operand 554 states and 725 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 04:09:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:23,091 INFO L93 Difference]: Finished difference Result 1070 states and 1402 transitions. [2025-03-04 04:09:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:23,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 308 [2025-03-04 04:09:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:23,095 INFO L225 Difference]: With dead ends: 1070 [2025-03-04 04:09:23,095 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 04:09:23,096 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:09:23,096 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:23,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:09:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 04:09:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 555. [2025-03-04 04:09:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 397 states have (on average 1.2594458438287153) internal successors, (500), 403 states have internal predecessors, (500), 113 states have call successors, (113), 44 states have call predecessors, (113), 44 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-04 04:09:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 726 transitions. [2025-03-04 04:09:23,114 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 726 transitions. Word has length 308 [2025-03-04 04:09:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 726 transitions. [2025-03-04 04:09:23,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 04:09:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 726 transitions. [2025-03-04 04:09:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 04:09:23,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:23,118 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:09:23,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1009457104, now seen corresponding path program 1 times [2025-03-04 04:09:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678887792] [2025-03-04 04:09:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:23,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 04:09:23,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 04:09:23,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:23,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-04 04:09:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678887792] [2025-03-04 04:09:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678887792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:09:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484088223] [2025-03-04 04:09:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:25,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:09:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:25,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:09:25,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:25,091 INFO L87 Difference]: Start difference. First operand 555 states and 726 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-04 04:09:29,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:09:33,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:09:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:36,000 INFO L93 Difference]: Finished difference Result 1585 states and 2089 transitions. [2025-03-04 04:09:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:09:36,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 312 [2025-03-04 04:09:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:36,014 INFO L225 Difference]: With dead ends: 1585 [2025-03-04 04:09:36,014 INFO L226 Difference]: Without dead ends: 1583 [2025-03-04 04:09:36,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:36,017 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 1424 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 149 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:36,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 2104 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 443 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2025-03-04 04:09:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-04 04:09:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2025-03-04 04:09:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1142 states have (on average 1.2670753064798599) internal successors, (1447), 1160 states have internal predecessors, (1447), 313 states have call successors, (313), 127 states have call predecessors, (313), 127 states have return successors, (327), 313 states have call predecessors, (327), 313 states have call successors, (327) [2025-03-04 04:09:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2087 transitions. [2025-03-04 04:09:36,121 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2087 transitions. Word has length 312 [2025-03-04 04:09:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:36,122 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2087 transitions. [2025-03-04 04:09:36,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-04 04:09:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2087 transitions. [2025-03-04 04:09:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 04:09:36,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:36,127 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:36,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:09:36,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 180510479, now seen corresponding path program 1 times [2025-03-04 04:09:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42252258] [2025-03-04 04:09:36,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 04:09:36,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 04:09:36,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:36,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-04 04:09:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:37,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42252258] [2025-03-04 04:09:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42252258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:37,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:09:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724919585] [2025-03-04 04:09:37,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:37,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:09:37,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:37,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:09:37,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:37,291 INFO L87 Difference]: Start difference. First operand 1583 states and 2087 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 04:09:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:37,422 INFO L93 Difference]: Finished difference Result 3134 states and 4138 transitions. [2025-03-04 04:09:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:09:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 326 [2025-03-04 04:09:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:37,434 INFO L225 Difference]: With dead ends: 3134 [2025-03-04 04:09:37,435 INFO L226 Difference]: Without dead ends: 1595 [2025-03-04 04:09:37,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:37,440 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:37,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2500 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-03-04 04:09:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2025-03-04 04:09:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1151 states have (on average 1.26498696785404) internal successors, (1456), 1169 states have internal predecessors, (1456), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2102 transitions. [2025-03-04 04:09:37,496 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2102 transitions. Word has length 326 [2025-03-04 04:09:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:37,497 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2102 transitions. [2025-03-04 04:09:37,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 04:09:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2102 transitions. [2025-03-04 04:09:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-04 04:09:37,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:37,501 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:37,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:09:37,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:37,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1964704172, now seen corresponding path program 1 times [2025-03-04 04:09:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:37,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011311337] [2025-03-04 04:09:37,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:38,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-04 04:09:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-04 04:09:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:38,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 04:09:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011311337] [2025-03-04 04:09:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011311337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599744061] [2025-03-04 04:09:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:38,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:38,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:38,411 INFO L87 Difference]: Start difference. First operand 1595 states and 2102 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:09:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:38,490 INFO L93 Difference]: Finished difference Result 3152 states and 4159 transitions. [2025-03-04 04:09:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 347 [2025-03-04 04:09:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:38,500 INFO L225 Difference]: With dead ends: 3152 [2025-03-04 04:09:38,500 INFO L226 Difference]: Without dead ends: 1601 [2025-03-04 04:09:38,505 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:09:38,506 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:38,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:09:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-03-04 04:09:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1598. [2025-03-04 04:09:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1154 states have (on average 1.2642980935875217) internal successors, (1459), 1172 states have internal predecessors, (1459), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2105 transitions. [2025-03-04 04:09:38,561 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2105 transitions. Word has length 347 [2025-03-04 04:09:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:38,561 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2105 transitions. [2025-03-04 04:09:38,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:09:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2105 transitions. [2025-03-04 04:09:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 04:09:38,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:38,565 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:38,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:09:38,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:38,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash -24204691, now seen corresponding path program 1 times [2025-03-04 04:09:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:38,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549746357] [2025-03-04 04:09:38,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:39,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 04:09:39,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 04:09:39,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-04 04:09:40,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:40,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549746357] [2025-03-04 04:09:40,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549746357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:40,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613420506] [2025-03-04 04:09:40,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:40,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:40,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:40,180 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:09:40,182 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:09:41,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 04:09:41,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 04:09:41,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:41,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:41,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 3710 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:09:41,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2025-03-04 04:09:41,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613420506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:41,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:41,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-04 04:09:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137209689] [2025-03-04 04:09:41,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:41,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:41,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:41,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:41,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:41,644 INFO L87 Difference]: Start difference. First operand 1598 states and 2105 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 04:09:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:42,444 INFO L93 Difference]: Finished difference Result 3158 states and 4165 transitions. [2025-03-04 04:09:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:42,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 350 [2025-03-04 04:09:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:42,453 INFO L225 Difference]: With dead ends: 3158 [2025-03-04 04:09:42,453 INFO L226 Difference]: Without dead ends: 1604 [2025-03-04 04:09:42,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:42,459 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:42,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1871 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 04:09:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2025-03-04 04:09:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2025-03-04 04:09:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1160 states have (on average 1.2629310344827587) internal successors, (1465), 1178 states have internal predecessors, (1465), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2111 transitions. [2025-03-04 04:09:42,529 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2111 transitions. Word has length 350 [2025-03-04 04:09:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:42,533 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2111 transitions. [2025-03-04 04:09:42,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 04:09:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2111 transitions. [2025-03-04 04:09:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-04 04:09:42,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:42,539 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:42,553 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:09:42,739 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,SelfDestructingSolverStorable6 [2025-03-04 04:09:42,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:42,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1720950094, now seen corresponding path program 1 times [2025-03-04 04:09:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:42,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810747803] [2025-03-04 04:09:42,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-04 04:09:43,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-04 04:09:43,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:43,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 04:09:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810747803] [2025-03-04 04:09:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810747803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60275523] [2025-03-04 04:09:43,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:43,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:43,815 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:09:43,817 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:09:44,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-04 04:09:45,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-04 04:09:45,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:45,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:45,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 3964 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:09:45,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-03-04 04:09:45,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60275523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:45,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:45,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 04:09:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971296809] [2025-03-04 04:09:45,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:45,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:45,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:45,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:09:45,370 INFO L87 Difference]: Start difference. First operand 1604 states and 2111 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:09:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:45,616 INFO L93 Difference]: Finished difference Result 3170 states and 4177 transitions. [2025-03-04 04:09:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 349 [2025-03-04 04:09:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:45,625 INFO L225 Difference]: With dead ends: 3170 [2025-03-04 04:09:45,625 INFO L226 Difference]: Without dead ends: 1610 [2025-03-04 04:09:45,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:09:45,629 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:45,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1872 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:09:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-03-04 04:09:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2025-03-04 04:09:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1166 states have (on average 1.2615780445969125) internal successors, (1471), 1184 states have internal predecessors, (1471), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2025-03-04 04:09:45,673 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 349 [2025-03-04 04:09:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:45,674 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2025-03-04 04:09:45,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:09:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2025-03-04 04:09:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-04 04:09:45,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:45,678 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:45,693 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:09:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:45,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash 149584640, now seen corresponding path program 1 times [2025-03-04 04:09:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642839639] [2025-03-04 04:09:45,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:46,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-04 04:09:46,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-04 04:09:46,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:46,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-04 04:09:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642839639] [2025-03-04 04:09:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642839639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504283655] [2025-03-04 04:09:46,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:46,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:46,756 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:09:46,757 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:09:47,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-04 04:09:48,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-04 04:09:48,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:48,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:48,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 4017 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:09:48,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-03-04 04:09:48,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:48,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504283655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:48,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:48,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 04:09:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606389572] [2025-03-04 04:09:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:48,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:48,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:48,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:09:48,326 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:09:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:48,537 INFO L93 Difference]: Finished difference Result 3182 states and 4189 transitions. [2025-03-04 04:09:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 352 [2025-03-04 04:09:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:48,545 INFO L225 Difference]: With dead ends: 3182 [2025-03-04 04:09:48,546 INFO L226 Difference]: Without dead ends: 1616 [2025-03-04 04:09:48,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:09:48,551 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1872 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:48,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1872 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:09:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-03-04 04:09:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1610. [2025-03-04 04:09:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1166 states have (on average 1.2615780445969125) internal successors, (1471), 1184 states have internal predecessors, (1471), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2025-03-04 04:09:48,601 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 352 [2025-03-04 04:09:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:48,603 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2025-03-04 04:09:48,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:09:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2025-03-04 04:09:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 04:09:48,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:48,606 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:48,624 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:09:48,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:48,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 427969645, now seen corresponding path program 1 times [2025-03-04 04:09:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304970927] [2025-03-04 04:09:48,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:49,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 04:09:49,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 04:09:49,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:49,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-03-04 04:09:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304970927] [2025-03-04 04:09:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304970927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030590603] [2025-03-04 04:09:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:49,495 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:09:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:49,754 INFO L93 Difference]: Finished difference Result 3179 states and 4186 transitions. [2025-03-04 04:09:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:49,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 353 [2025-03-04 04:09:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:49,763 INFO L225 Difference]: With dead ends: 3179 [2025-03-04 04:09:49,764 INFO L226 Difference]: Without dead ends: 1613 [2025-03-04 04:09:49,767 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:09:49,768 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:49,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:09:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2025-03-04 04:09:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2025-03-04 04:09:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1169 states have (on average 1.260906757912746) internal successors, (1474), 1187 states have internal predecessors, (1474), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2120 transitions. [2025-03-04 04:09:49,819 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2120 transitions. Word has length 353 [2025-03-04 04:09:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2120 transitions. [2025-03-04 04:09:49,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:09:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2120 transitions. [2025-03-04 04:09:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 04:09:49,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:49,822 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:09:49,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:49,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1766886093, now seen corresponding path program 1 times [2025-03-04 04:09:49,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644172033] [2025-03-04 04:09:49,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:50,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 04:09:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 04:09:50,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:50,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-04 04:09:51,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644172033] [2025-03-04 04:09:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644172033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659319262] [2025-03-04 04:09:51,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:51,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:51,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:51,260 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:09:51,262 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:09:52,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 04:09:52,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 04:09:52,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:52,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 3780 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:09:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-04 04:09:52,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659319262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-04 04:09:52,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376114343] [2025-03-04 04:09:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:52,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:52,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:52,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:52,978 INFO L87 Difference]: Start difference. First operand 1613 states and 2120 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 04:09:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:53,338 INFO L93 Difference]: Finished difference Result 3188 states and 4195 transitions. [2025-03-04 04:09:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 355 [2025-03-04 04:09:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:53,351 INFO L225 Difference]: With dead ends: 3188 [2025-03-04 04:09:53,352 INFO L226 Difference]: Without dead ends: 1619 [2025-03-04 04:09:53,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:53,356 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:53,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1871 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:09:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-03-04 04:09:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1613. [2025-03-04 04:09:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1169 states have (on average 1.260906757912746) internal successors, (1474), 1187 states have internal predecessors, (1474), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2120 transitions. [2025-03-04 04:09:53,401 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2120 transitions. Word has length 355 [2025-03-04 04:09:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:53,401 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2120 transitions. [2025-03-04 04:09:53,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 04:09:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2120 transitions. [2025-03-04 04:09:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 04:09:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:53,404 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:53,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 04:09:53,605 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,SelfDestructingSolverStorable10 [2025-03-04 04:09:53,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1502261204, now seen corresponding path program 1 times [2025-03-04 04:09:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542488472] [2025-03-04 04:09:53,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:54,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 04:09:54,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 04:09:54,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:54,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 04:09:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542488472] [2025-03-04 04:09:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542488472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520743755] [2025-03-04 04:09:54,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:54,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:54,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:54,506 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:09:54,507 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:09:55,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 04:09:56,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 04:09:56,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:56,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:56,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 3978 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:09:56,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-04 04:09:56,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:09:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 04:09:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520743755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:09:57,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:09:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 04:09:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253855889] [2025-03-04 04:09:57,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:09:57,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:09:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:57,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:09:57,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:57,625 INFO L87 Difference]: Start difference. First operand 1613 states and 2120 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 2 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-04 04:09:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:57,728 INFO L93 Difference]: Finished difference Result 3188 states and 4195 transitions. [2025-03-04 04:09:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 2 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 353 [2025-03-04 04:09:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:57,736 INFO L225 Difference]: With dead ends: 3188 [2025-03-04 04:09:57,737 INFO L226 Difference]: Without dead ends: 1619 [2025-03-04 04:09:57,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 704 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:57,741 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:57,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1873 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-03-04 04:09:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2025-03-04 04:09:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1175 states have (on average 1.2595744680851064) internal successors, (1480), 1193 states have internal predecessors, (1480), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-03-04 04:09:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2126 transitions. [2025-03-04 04:09:57,794 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2126 transitions. Word has length 353 [2025-03-04 04:09:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:57,795 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2126 transitions. [2025-03-04 04:09:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 2 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-04 04:09:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2126 transitions. [2025-03-04 04:09:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 04:09:57,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:57,803 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 04:09:58,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:58,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1433121842, now seen corresponding path program 2 times [2025-03-04 04:09:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231520493] [2025-03-04 04:09:58,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:09:58,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:58,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 355 statements into 2 equivalence classes. [2025-03-04 04:09:58,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 82 of 355 statements. [2025-03-04 04:09:58,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:09:58,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:10:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-04 04:10:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:10:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231520493] [2025-03-04 04:10:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231520493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:10:02,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:10:02,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:10:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950755777] [2025-03-04 04:10:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:10:02,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:10:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:10:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:10:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:10:02,369 INFO L87 Difference]: Start difference. First operand 1619 states and 2126 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 3 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-04 04:10:06,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:10:10,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:10:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:10:12,479 INFO L93 Difference]: Finished difference Result 3305 states and 4366 transitions. [2025-03-04 04:10:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:10:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 3 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 355 [2025-03-04 04:10:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:10:12,489 INFO L225 Difference]: With dead ends: 3305 [2025-03-04 04:10:12,489 INFO L226 Difference]: Without dead ends: 1730 [2025-03-04 04:10:12,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:10:12,494 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 574 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:10:12,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 2148 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 474 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-03-04 04:10:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-04 04:10:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1714. [2025-03-04 04:10:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1248 states have (on average 1.2572115384615385) internal successors, (1569), 1268 states have internal predecessors, (1569), 331 states have call successors, (331), 130 states have call predecessors, (331), 134 states have return successors, (362), 333 states have call predecessors, (362), 331 states have call successors, (362) [2025-03-04 04:10:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2262 transitions. [2025-03-04 04:10:12,582 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2262 transitions. Word has length 355 [2025-03-04 04:10:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:10:12,582 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2262 transitions. [2025-03-04 04:10:12,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 3 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-04 04:10:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2262 transitions. [2025-03-04 04:10:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 04:10:12,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:10:12,587 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:10:12,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:10:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:10:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1901353116, now seen corresponding path program 1 times [2025-03-04 04:10:12,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:10:12,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823189495] [2025-03-04 04:10:12,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:10:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:10:13,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 04:10:13,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 04:10:13,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:10:13,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:10:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-04 04:10:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:10:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823189495] [2025-03-04 04:10:14,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823189495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:10:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903577459] [2025-03-04 04:10:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:10:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:10:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:10:14,024 INFO L229 MonitoredProcess]: Starting monitored process 8 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:10:14,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 04:10:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 04:10:15,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 04:10:15,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:10:15,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:10:15,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 3721 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 04:10:15,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:10:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-03-04 04:10:19,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:10:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-03-04 04:10:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903577459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:10:21,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:10:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-04 04:10:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534212273] [2025-03-04 04:10:21,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:10:21,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 04:10:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:10:21,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 04:10:21,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-03-04 04:10:21,397 INFO L87 Difference]: Start difference. First operand 1714 states and 2262 transitions. Second operand has 18 states, 18 states have (on average 21.22222222222222) internal successors, (382), 18 states have internal predecessors, (382), 12 states have call successors, (102), 11 states have call predecessors, (102), 8 states have return successors, (97), 12 states have call predecessors, (97), 12 states have call successors, (97) [2025-03-04 04:10:25,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:10:29,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:10:33,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []