./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 06:33:07,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:33:07,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:33:07,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:33:07,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:33:07,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:33:07,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:33:07,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:33:07,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:33:07,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:33:07,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:33:07,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:33:07,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:33:07,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:33:07,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:33:07,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:33:07,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:33:07,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:33:07,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:33:07,967 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-jdk21/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-02-06 06:33:08,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:33:08,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:33:08,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:33:08,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:33:08,203 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:33:08,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-02-06 06:33:09,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47366b0bc/aaafeb39d9e847e59cc6e9fe0ad38d3a/FLAGe7038bfbb [2025-02-06 06:33:09,732 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:33:09,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-02-06 06:33:09,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47366b0bc/aaafeb39d9e847e59cc6e9fe0ad38d3a/FLAGe7038bfbb [2025-02-06 06:33:09,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47366b0bc/aaafeb39d9e847e59cc6e9fe0ad38d3a [2025-02-06 06:33:09,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:33:09,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:33:09,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:33:09,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:33:09,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:33:09,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:33:09" (1/1) ... [2025-02-06 06:33:09,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d88cb25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:09, skipping insertion in model container [2025-02-06 06:33:09,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:33:09" (1/1) ... [2025-02-06 06:33:09,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:33:10,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 06:33:10,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:33:10,708 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:33:10,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [2762] [2025-02-06 06:33:10,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapq %0": "=r" (val): "0" (val)); [2769] [2025-02-06 06:33:10,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-02-06 06:33:10,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:33:10,905 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:33:10,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10 WrapperNode [2025-02-06 06:33:10,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:33:10,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:33:10,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:33:10,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:33:10,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:10,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,043 INFO L138 Inliner]: procedures = 150, calls = 795, calls flagged for inlining = 63, calls inlined = 45, statements flattened = 1727 [2025-02-06 06:33:11,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:33:11,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:33:11,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:33:11,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:33:11,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,191 INFO L175 MemorySlicer]: Split 400 memory accesses to 11 slices as follows [2, 14, 8, 4, 54, 4, 1, 9, 10, 267, 27]. 67 percent of accesses are in the largest equivalence class. The 84 initializations are split as follows [2, 14, 8, 4, 9, 0, 0, 3, 10, 26, 8]. The 187 writes are split as follows [0, 0, 0, 0, 41, 2, 0, 0, 0, 130, 14]. [2025-02-06 06:33:11,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:33:11,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:33:11,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:33:11,287 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:33:11,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (1/1) ... [2025-02-06 06:33:11,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:33:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:11,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:33:11,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:33:11,342 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-02-06 06:33:11,343 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-02-06 06:33:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:33:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:33:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:33:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:33:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:33:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-02-06 06:33:11,344 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2025-02-06 06:33:11,344 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2025-02-06 06:33:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:33:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:33:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:33:11,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:33:11,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_ipmi_data [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_ipmi_data [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-02-06 06:33:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:33:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure aem_delete [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_delete [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_get [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_get [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:33:11,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:33:11,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:33:11,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kzalloc_6 [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kzalloc_6 [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure aem_send_message [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_send_message [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_sensors [2025-02-06 06:33:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_sensors [2025-02-06 06:33:11,353 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_put [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_put [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2025-02-06 06:33:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:33:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:33:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:33:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:33:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:33:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 06:33:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 06:33:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 06:33:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-02-06 06:33:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-02-06 06:33:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:33:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:33:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure aem_remove_sensors [2025-02-06 06:33:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_remove_sensors [2025-02-06 06:33:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2025-02-06 06:33:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2025-02-06 06:33:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 06:33:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 06:33:11,674 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:33:11,677 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:33:11,701 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4428: havoc #t~ret421.base, #t~ret421.offset; [2025-02-06 06:33:11,718 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4412: havoc #t~nondet419; [2025-02-06 06:33:11,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4512: havoc #t~nondet434; [2025-02-06 06:33:11,750 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:33:11,841 INFO L1309 $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-02-06 06:33:11,841 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4465: havoc ipmi_create_user_#t~nondet426#1; [2025-02-06 06:33:11,844 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4530: havoc #t~nondet438; [2025-02-06 06:33:12,017 INFO L1309 $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-02-06 06:33:12,018 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4458: havoc idr_pre_get_#t~nondet425#1; [2025-02-06 06:33:12,018 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4454: havoc idr_get_new_#t~nondet424#1; [2025-02-06 06:33:12,022 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4469: havoc #t~nondet427; [2025-02-06 06:33:12,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4447: havoc #t~ret423.base, #t~ret423.offset; [2025-02-06 06:33:12,093 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: havoc ipmi_request_settime_#t~nondet428#1; [2025-02-06 06:33:12,093 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4488: havoc ipmi_validate_addr_#t~nondet431#1; [2025-02-06 06:33:12,185 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc #t~nondet420; [2025-02-06 06:33:17,174 INFO L1309 $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-02-06 06:33:17,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc ipmi_smi_watcher_register_#t~nondet429#1; [2025-02-06 06:33:17,175 INFO L1309 $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-02-06 06:33:17,175 INFO L1309 $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-02-06 06:33:17,175 INFO L1309 $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-02-06 06:33:17,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4484: havoc ipmi_smi_watcher_unregister_#t~nondet430#1; [2025-02-06 06:33:17,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4438: havoc driver_register_#t~nondet422#1; [2025-02-06 06:33:17,175 INFO L1309 $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-02-06 06:33:17,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4522: havoc printk_#t~nondet436#1; [2025-02-06 06:33:17,176 INFO L1309 $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-02-06 06:33:17,176 INFO L1309 $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-02-06 06:33:17,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4515: havoc #t~ret435.base, #t~ret435.offset; [2025-02-06 06:33:17,454 INFO L? ?]: Removed 609 outVars from TransFormulas that were not future-live. [2025-02-06 06:33:17,456 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:33:17,470 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:33:17,471 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:33:17,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:33:17 BoogieIcfgContainer [2025-02-06 06:33:17,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:33:17,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:33:17,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:33:17,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:33:17,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:33:09" (1/3) ... [2025-02-06 06:33:17,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706843b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:33:17, skipping insertion in model container [2025-02-06 06:33:17,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:10" (2/3) ... [2025-02-06 06:33:17,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706843b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:33:17, skipping insertion in model container [2025-02-06 06:33:17,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:33:17" (3/3) ... [2025-02-06 06:33:17,478 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-02-06 06:33:17,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:33:17,489 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-02-06 06:33:17,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:33:17,556 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;@65d2ee59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:33:17,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:33:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 503 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 364 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-02-06 06:33:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-06 06:33:17,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:17,587 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] [2025-02-06 06:33:17,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:17,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1370601944, now seen corresponding path program 1 times [2025-02-06 06:33:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344151996] [2025-02-06 06:33:17,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:18,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 06:33:18,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 06:33:18,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:18,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 06:33:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344151996] [2025-02-06 06:33:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344151996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:18,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285467011] [2025-02-06 06:33:18,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:18,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:18,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:18,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:33:19,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 06:33:20,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 06:33:20,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:20,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:20,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 3484 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 06:33:20,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-02-06 06:33:20,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:33:20,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285467011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:20,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:33:20,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 06:33:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269668981] [2025-02-06 06:33:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:20,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 06:33:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:20,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 06:33:20,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:33:20,278 INFO L87 Difference]: Start difference. First operand has 503 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 364 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.0) internal successors, (122), 2 states have internal predecessors, (122), 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-02-06 06:33:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:20,370 INFO L93 Difference]: Finished difference Result 1002 states and 1348 transitions. [2025-02-06 06:33:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 06:33:20,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 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 295 [2025-02-06 06:33:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:20,380 INFO L225 Difference]: With dead ends: 1002 [2025-02-06 06:33:20,381 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 06:33:20,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 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-02-06 06:33:20,387 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-02-06 06:33:20,387 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-02-06 06:33:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 06:33:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-02-06 06:33:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 336 states have (on average 1.2351190476190477) internal successors, (415), 342 states have internal predecessors, (415), 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-02-06 06:33:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 625 transitions. [2025-02-06 06:33:20,457 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 625 transitions. Word has length 295 [2025-02-06 06:33:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:20,458 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 625 transitions. [2025-02-06 06:33:20,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 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-02-06 06:33:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 625 transitions. [2025-02-06 06:33:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-06 06:33:20,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:20,468 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-02-06 06:33:20,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:33:20,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 06:33:20,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:20,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1668984162, now seen corresponding path program 1 times [2025-02-06 06:33:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108922885] [2025-02-06 06:33:20,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:21,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-06 06:33:21,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-06 06:33:21,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:21,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-02-06 06:33:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108922885] [2025-02-06 06:33:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108922885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491883909] [2025-02-06 06:33:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:21,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:21,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:21,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:21,679 INFO L87 Difference]: Start difference. First operand 479 states and 625 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-02-06 06:33:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:21,795 INFO L93 Difference]: Finished difference Result 996 states and 1294 transitions. [2025-02-06 06:33:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 296 [2025-02-06 06:33:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:21,800 INFO L225 Difference]: With dead ends: 996 [2025-02-06 06:33:21,802 INFO L226 Difference]: Without dead ends: 553 [2025-02-06 06:33:21,804 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-02-06 06:33:21,804 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 134 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:21,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1205 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-06 06:33:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-02-06 06:33:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 395 states have (on average 1.240506329113924) internal successors, (490), 401 states have internal predecessors, (490), 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-02-06 06:33:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 716 transitions. [2025-02-06 06:33:21,841 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 716 transitions. Word has length 296 [2025-02-06 06:33:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:21,842 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 716 transitions. [2025-02-06 06:33:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-02-06 06:33:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 716 transitions. [2025-02-06 06:33:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-06 06:33:21,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:21,848 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] [2025-02-06 06:33:21,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:33:21,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359940, now seen corresponding path program 1 times [2025-02-06 06:33:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777990473] [2025-02-06 06:33:21,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-06 06:33:22,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-06 06:33:22,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:22,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-02-06 06:33:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777990473] [2025-02-06 06:33:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777990473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:22,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:22,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686495809] [2025-02-06 06:33:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:22,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:22,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:22,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:22,872 INFO L87 Difference]: Start difference. First operand 553 states and 716 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-02-06 06:33:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:22,938 INFO L93 Difference]: Finished difference Result 997 states and 1295 transitions. [2025-02-06 06:33:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 309 [2025-02-06 06:33:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:22,946 INFO L225 Difference]: With dead ends: 997 [2025-02-06 06:33:22,946 INFO L226 Difference]: Without dead ends: 555 [2025-02-06 06:33:22,948 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-02-06 06:33:22,949 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1242 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-02-06 06:33:22,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-06 06:33:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2025-02-06 06:33:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 396 states have (on average 1.2398989898989898) internal successors, (491), 402 states have internal predecessors, (491), 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-02-06 06:33:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 717 transitions. [2025-02-06 06:33:22,975 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 717 transitions. Word has length 309 [2025-02-06 06:33:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:22,976 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 717 transitions. [2025-02-06 06:33:22,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-02-06 06:33:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 717 transitions. [2025-02-06 06:33:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-06 06:33:22,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:22,982 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] [2025-02-06 06:33:22,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:33:22,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:22,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1637102043, now seen corresponding path program 1 times [2025-02-06 06:33:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808579729] [2025-02-06 06:33:22,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 06:33:23,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 06:33:23,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:23,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-02-06 06:33:24,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808579729] [2025-02-06 06:33:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808579729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:24,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:24,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:33:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898926776] [2025-02-06 06:33:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:33:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:24,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:33:24,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:24,738 INFO L87 Difference]: Start difference. First operand 554 states and 717 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-02-06 06:33:28,763 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-02-06 06:33:32,780 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-02-06 06:33:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:35,468 INFO L93 Difference]: Finished difference Result 1440 states and 1884 transitions. [2025-02-06 06:33:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:33:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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 310 [2025-02-06 06:33:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:35,484 INFO L225 Difference]: With dead ends: 1440 [2025-02-06 06:33:35,485 INFO L226 Difference]: Without dead ends: 1438 [2025-02-06 06:33:35,485 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-02-06 06:33:35,486 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1416 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 149 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 2088 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:35,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 2088 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 443 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2025-02-06 06:33:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-02-06 06:33:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1438. [2025-02-06 06:33:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1025 states have (on average 1.2429268292682927) internal successors, (1274), 1043 states have internal predecessors, (1274), 297 states have call successors, (297), 115 states have call predecessors, (297), 115 states have return successors, (311), 297 states have call predecessors, (311), 297 states have call successors, (311) [2025-02-06 06:33:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2025-02-06 06:33:35,554 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 310 [2025-02-06 06:33:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2025-02-06 06:33:35,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-02-06 06:33:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2025-02-06 06:33:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 06:33:35,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:35,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:33:35,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1074517295, now seen corresponding path program 1 times [2025-02-06 06:33:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836804207] [2025-02-06 06:33:35,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:36,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 06:33:36,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 06:33:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-02-06 06:33:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836804207] [2025-02-06 06:33:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836804207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:33:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603158355] [2025-02-06 06:33:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:33:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:36,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:33:36,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:36,591 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-02-06 06:33:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:36,706 INFO L93 Difference]: Finished difference Result 2773 states and 3639 transitions. [2025-02-06 06:33:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:33:36,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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 329 [2025-02-06 06:33:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:36,717 INFO L225 Difference]: With dead ends: 2773 [2025-02-06 06:33:36,718 INFO L226 Difference]: Without dead ends: 1450 [2025-02-06 06:33:36,722 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-02-06 06:33:36,723 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2484 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-02-06 06:33:36,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2484 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-02-06 06:33:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2025-02-06 06:33:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1034 states have (on average 1.2408123791102514) internal successors, (1283), 1052 states have internal predecessors, (1283), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1897 transitions. [2025-02-06 06:33:36,805 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1897 transitions. Word has length 329 [2025-02-06 06:33:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:36,806 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1897 transitions. [2025-02-06 06:33:36,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-02-06 06:33:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1897 transitions. [2025-02-06 06:33:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-06 06:33:36,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:36,811 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-02-06 06:33:36,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:33:36,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1964704172, now seen corresponding path program 1 times [2025-02-06 06:33:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119638103] [2025-02-06 06:33:36,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:37,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-06 06:33:37,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-06 06:33:37,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-02-06 06:33:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119638103] [2025-02-06 06:33:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119638103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:37,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:37,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356248670] [2025-02-06 06:33:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:37,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:37,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:37,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:37,650 INFO L87 Difference]: Start difference. First operand 1450 states and 1897 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-02-06 06:33:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:37,723 INFO L93 Difference]: Finished difference Result 2791 states and 3660 transitions. [2025-02-06 06:33:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:37,724 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-02-06 06:33:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:37,731 INFO L225 Difference]: With dead ends: 2791 [2025-02-06 06:33:37,731 INFO L226 Difference]: Without dead ends: 1456 [2025-02-06 06:33:37,734 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-02-06 06:33:37,736 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1242 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-02-06 06:33:37,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-02-06 06:33:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1453. [2025-02-06 06:33:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1037 states have (on average 1.240115718418515) internal successors, (1286), 1055 states have internal predecessors, (1286), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1900 transitions. [2025-02-06 06:33:37,786 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1900 transitions. Word has length 347 [2025-02-06 06:33:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:37,786 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 1900 transitions. [2025-02-06 06:33:37,786 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-02-06 06:33:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1900 transitions. [2025-02-06 06:33:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-06 06:33:37,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:37,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:37,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:33:37,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:37,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 450995024, now seen corresponding path program 1 times [2025-02-06 06:33:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:37,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351204478] [2025-02-06 06:33:37,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:38,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-06 06:33:38,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-06 06:33:38,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:38,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-02-06 06:33:38,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:38,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351204478] [2025-02-06 06:33:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351204478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:38,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265729119] [2025-02-06 06:33:38,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:38,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:38,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:38,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:38,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:33:39,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-06 06:33:40,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-06 06:33:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:40,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 3901 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:33:40,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-02-06 06:33:40,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:33:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265729119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:40,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:33:40,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 06:33:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595546575] [2025-02-06 06:33:40,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:40,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:40,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:33:40,287 INFO L87 Difference]: Start difference. First operand 1453 states and 1900 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-06 06:33:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:40,646 INFO L93 Difference]: Finished difference Result 2797 states and 3666 transitions. [2025-02-06 06:33:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:40,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 346 [2025-02-06 06:33:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:40,653 INFO L225 Difference]: With dead ends: 2797 [2025-02-06 06:33:40,653 INFO L226 Difference]: Without dead ends: 1459 [2025-02-06 06:33:40,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 345 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-02-06 06:33:40,657 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1860 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:40,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1860 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:33:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-02-06 06:33:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2025-02-06 06:33:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1043 states have (on average 1.2387344199424737) internal successors, (1292), 1061 states have internal predecessors, (1292), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1906 transitions. [2025-02-06 06:33:40,696 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1906 transitions. Word has length 346 [2025-02-06 06:33:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:40,697 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1906 transitions. [2025-02-06 06:33:40,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-06 06:33:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1906 transitions. [2025-02-06 06:33:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-06 06:33:40,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:40,701 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] [2025-02-06 06:33:40,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:33:40,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:40,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:40,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash -25887146, now seen corresponding path program 1 times [2025-02-06 06:33:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904440229] [2025-02-06 06:33:40,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:40,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:41,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-06 06:33:41,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-06 06:33:41,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:41,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-02-06 06:33:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904440229] [2025-02-06 06:33:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904440229] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974519040] [2025-02-06 06:33:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:41,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:41,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:41,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:41,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:33:42,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-06 06:33:43,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-06 06:33:43,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:43,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:43,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 3968 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:33:43,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-02-06 06:33:43,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:33:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974519040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:43,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:33:43,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 06:33:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845395305] [2025-02-06 06:33:43,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:43,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:43,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:43,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:33:43,265 INFO L87 Difference]: Start difference. First operand 1459 states and 1906 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, (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-02-06 06:33:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:44,073 INFO L93 Difference]: Finished difference Result 2809 states and 3678 transitions. [2025-02-06 06:33:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:44,073 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, (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 351 [2025-02-06 06:33:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:44,080 INFO L225 Difference]: With dead ends: 2809 [2025-02-06 06:33:44,080 INFO L226 Difference]: Without dead ends: 1465 [2025-02-06 06:33:44,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 350 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-02-06 06:33:44,084 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1860 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.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1860 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 06:33:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-02-06 06:33:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1459. [2025-02-06 06:33:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1043 states have (on average 1.2387344199424737) internal successors, (1292), 1061 states have internal predecessors, (1292), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1906 transitions. [2025-02-06 06:33:44,120 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1906 transitions. Word has length 351 [2025-02-06 06:33:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:44,121 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1906 transitions. [2025-02-06 06:33:44,121 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, (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-02-06 06:33:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1906 transitions. [2025-02-06 06:33:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-06 06:33:44,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:44,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:44,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:33:44,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:44,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:44,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1062953105, now seen corresponding path program 1 times [2025-02-06 06:33:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960246670] [2025-02-06 06:33:44,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:44,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-06 06:33:44,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-06 06:33:44,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-02-06 06:33:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960246670] [2025-02-06 06:33:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960246670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637203419] [2025-02-06 06:33:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:45,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:45,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:45,129 INFO L87 Difference]: Start difference. First operand 1459 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-02-06 06:33:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:45,398 INFO L93 Difference]: Finished difference Result 2806 states and 3675 transitions. [2025-02-06 06:33:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 350 [2025-02-06 06:33:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:45,405 INFO L225 Difference]: With dead ends: 2806 [2025-02-06 06:33:45,405 INFO L226 Difference]: Without dead ends: 1462 [2025-02-06 06:33:45,408 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-02-06 06:33:45,408 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 0 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1242 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-02-06 06:33:45,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:33:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-02-06 06:33:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2025-02-06 06:33:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1046 states have (on average 1.2380497131931167) internal successors, (1295), 1064 states have internal predecessors, (1295), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1909 transitions. [2025-02-06 06:33:45,445 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1909 transitions. Word has length 350 [2025-02-06 06:33:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:45,446 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1909 transitions. [2025-02-06 06:33:45,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-02-06 06:33:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1909 transitions. [2025-02-06 06:33:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-06 06:33:45,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:45,448 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-02-06 06:33:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:33:45,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:45,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash 171890484, now seen corresponding path program 1 times [2025-02-06 06:33:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183710165] [2025-02-06 06:33:45,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:45,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-06 06:33:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-06 06:33:45,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:45,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-02-06 06:33:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:46,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183710165] [2025-02-06 06:33:46,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183710165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:46,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066164340] [2025-02-06 06:33:46,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:46,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:46,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 06:33:47,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-06 06:33:47,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-06 06:33:47,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:47,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:47,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 4005 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:33:47,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-02-06 06:33:47,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:33:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-02-06 06:33:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066164340] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:33:48,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:33:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 06:33:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770449584] [2025-02-06 06:33:48,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:33:48,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:33:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:48,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:33:48,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:48,781 INFO L87 Difference]: Start difference. First operand 1462 states and 1909 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-02-06 06:33:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:48,862 INFO L93 Difference]: Finished difference Result 2815 states and 3684 transitions. [2025-02-06 06:33:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:48,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 352 [2025-02-06 06:33:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:48,870 INFO L225 Difference]: With dead ends: 2815 [2025-02-06 06:33:48,870 INFO L226 Difference]: Without dead ends: 1468 [2025-02-06 06:33:48,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 702 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-02-06 06:33:48,873 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:48,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1861 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-02-06 06:33:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-02-06 06:33:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1052 states have (on average 1.2366920152091254) internal successors, (1301), 1070 states have internal predecessors, (1301), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1915 transitions. [2025-02-06 06:33:48,906 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1915 transitions. Word has length 352 [2025-02-06 06:33:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:48,907 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1915 transitions. [2025-02-06 06:33:48,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-02-06 06:33:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1915 transitions. [2025-02-06 06:33:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-06 06:33:48,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:48,909 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-02-06 06:33:48,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 06:33:49,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 06:33:49,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:49,110 INFO L85 PathProgramCache]: Analyzing trace with hash -24204691, now seen corresponding path program 1 times [2025-02-06 06:33:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76606331] [2025-02-06 06:33:49,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:49,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-06 06:33:49,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-06 06:33:49,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-02-06 06:33:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76606331] [2025-02-06 06:33:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76606331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082552771] [2025-02-06 06:33:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:50,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:50,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 06:33:51,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-06 06:33:52,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-06 06:33:52,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:52,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:52,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 3710 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:33:52,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2025-02-06 06:33:52,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:33:52,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082552771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:52,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:33:52,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-02-06 06:33:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018326335] [2025-02-06 06:33:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:52,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:52,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 06:33:52,419 INFO L87 Difference]: Start difference. First operand 1468 states and 1915 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-02-06 06:33:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:52,801 INFO L93 Difference]: Finished difference Result 2827 states and 3696 transitions. [2025-02-06 06:33:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:52,801 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-02-06 06:33:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:52,809 INFO L225 Difference]: With dead ends: 2827 [2025-02-06 06:33:52,809 INFO L226 Difference]: Without dead ends: 1474 [2025-02-06 06:33:52,813 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-02-06 06:33:52,813 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1859 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:52,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1859 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:33:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-02-06 06:33:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2025-02-06 06:33:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1058 states have (on average 1.2353497164461247) internal successors, (1307), 1076 states have internal predecessors, (1307), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 300 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1921 transitions. [2025-02-06 06:33:52,866 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1921 transitions. Word has length 350 [2025-02-06 06:33:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:52,867 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1921 transitions. [2025-02-06 06:33:52,867 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-02-06 06:33:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1921 transitions. [2025-02-06 06:33:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-06 06:33:52,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:52,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:52,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 06:33:53,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 06:33:53,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:53,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:53,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1170441424, now seen corresponding path program 1 times [2025-02-06 06:33:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:53,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140858434] [2025-02-06 06:33:53,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:53,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:53,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-06 06:33:53,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-06 06:33:53,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:53,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-02-06 06:33:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140858434] [2025-02-06 06:33:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140858434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:33:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137787747] [2025-02-06 06:33:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:33:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:53,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:33:53,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:53,942 INFO L87 Difference]: Start difference. First operand 1474 states and 1921 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-06 06:33:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:54,052 INFO L93 Difference]: Finished difference Result 2839 states and 3708 transitions. [2025-02-06 06:33:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:33:54,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 352 [2025-02-06 06:33:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:54,059 INFO L225 Difference]: With dead ends: 2839 [2025-02-06 06:33:54,059 INFO L226 Difference]: Without dead ends: 1480 [2025-02-06 06:33:54,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:54,062 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2484 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-02-06 06:33:54,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2484 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-02-06 06:33:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-02-06 06:33:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1064 states have (on average 1.2340225563909775) internal successors, (1313), 1079 states have internal predecessors, (1313), 297 states have call successors, (297), 115 states have call predecessors, (297), 118 states have return successors, (317), 303 states have call predecessors, (317), 297 states have call successors, (317) [2025-02-06 06:33:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1927 transitions. [2025-02-06 06:33:54,094 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1927 transitions. Word has length 352 [2025-02-06 06:33:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 1927 transitions. [2025-02-06 06:33:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-06 06:33:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1927 transitions. [2025-02-06 06:33:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-02-06 06:33:54,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:54,097 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, 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, 1, 1, 1, 1] [2025-02-06 06:33:54,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 06:33:54,097 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1191301456, now seen corresponding path program 1 times [2025-02-06 06:33:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513080873] [2025-02-06 06:33:54,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-06 06:33:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-06 06:33:54,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-06 06:33:55,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:55,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513080873] [2025-02-06 06:33:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513080873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523028765] [2025-02-06 06:33:55,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:55,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:55,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 06:33:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-06 06:33:57,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-06 06:33:57,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:57,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:57,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 4120 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 06:33:57,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:34:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-02-06 06:34:03,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:34:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-06 06:34:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523028765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:34:06,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:34:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-02-06 06:34:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226849930] [2025-02-06 06:34:06,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:34:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 06:34:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:34:06,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 06:34:06,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-02-06 06:34:06,028 INFO L87 Difference]: Start difference. First operand 1480 states and 1927 transitions. Second operand has 18 states, 18 states have (on average 23.11111111111111) internal successors, (416), 18 states have internal predecessors, (416), 12 states have call successors, (108), 11 states have call predecessors, (108), 8 states have return successors, (103), 12 states have call predecessors, (103), 12 states have call successors, (103) [2025-02-06 06:34:10,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:34:14,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:34:18,122 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-02-06 06:34:22,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:34:26,173 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-02-06 06:34:30,220 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-02-06 06:34:34,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:34:38,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []