./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:11:37,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:11:37,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:11:37,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:11:37,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:11:37,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:11:37,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:11:37,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:11:37,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:11:37,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:11:37,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:11:37,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:11:37,955 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:11:37,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:11:37,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:11:37,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:11:37,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:11:37,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:11:37,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 [2025-03-13 22:11:38,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:11:38,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:11:38,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:11:38,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:11:38,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:11:38,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-03-13 22:11:39,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c3e03c4/de9437d2f94b46158c358f623f5208fe/FLAGa1f5d01c1 [2025-03-13 22:11:39,797 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:11:39,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-03-13 22:11:39,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c3e03c4/de9437d2f94b46158c358f623f5208fe/FLAGa1f5d01c1 [2025-03-13 22:11:39,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c3e03c4/de9437d2f94b46158c358f623f5208fe [2025-03-13 22:11:39,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:11:39,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:11:39,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:11:39,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:11:39,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:11:39,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:11:39" (1/1) ... [2025-03-13 22:11:39,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67366e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:39, skipping insertion in model container [2025-03-13 22:11:39,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:11:39" (1/1) ... [2025-03-13 22:11:40,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:11:45,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:11:45,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:11:45,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-13 22:11:45,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-13 22:11:45,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-13 22:11:45,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-13 22:11:45,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-03-13 22:11:45,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:11:45,723 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:11:45,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45 WrapperNode [2025-03-13 22:11:45,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:11:45,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:11:45,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:11:45,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:11:45,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,870 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2025-03-13 22:11:45,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:11:45,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:11:45,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:11:45,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:11:45,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:11:45,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:11:45,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:11:45,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:11:45,958 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (1/1) ... [2025-03-13 22:11:45,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:11:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:11:45,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:11:45,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:11:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:11:46,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:11:46,010 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-13 22:11:46,010 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:11:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-03-13 22:11:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:11:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:11:46,013 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:11:46,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:11:46,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:11:46,571 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-03-13 22:11:46,571 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-03-13 22:11:46,571 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-03-13 22:11:46,871 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-03-13 22:11:46,871 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-03-13 22:11:46,871 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-03-13 22:11:46,940 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:11:46,941 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:11:46,941 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:11:47,007 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:11:47,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:11:47 BoogieIcfgContainer [2025-03-13 22:11:47,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:11:47,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:11:47,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:11:47,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:11:47,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:11:39" (1/3) ... [2025-03-13 22:11:47,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fa8d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:11:47, skipping insertion in model container [2025-03-13 22:11:47,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:11:45" (2/3) ... [2025-03-13 22:11:47,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fa8d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:11:47, skipping insertion in model container [2025-03-13 22:11:47,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:11:47" (3/3) ... [2025-03-13 22:11:47,013 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-03-13 22:11:47,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:11:47,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i that has 3 procedures, 575 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-03-13 22:11:47,026 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:11:47,113 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:11:47,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 581 places, 587 transitions, 1188 flow [2025-03-13 22:11:47,321 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2025-03-13 22:11:47,324 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:11:47,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 585 events. 13/585 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 617 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 516. Up to 4 conditions per place. [2025-03-13 22:11:47,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 581 places, 587 transitions, 1188 flow [2025-03-13 22:11:47,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 581 transitions, 1171 flow [2025-03-13 22:11:47,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:11:47,362 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;@754c8d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:11:47,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-13 22:11:47,379 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:11:47,379 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-13 22:11:47,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:11:47,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:47,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:47,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:47,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 166177313, now seen corresponding path program 1 times [2025-03-13 22:11:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138844384] [2025-03-13 22:11:47,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:47,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-13 22:11:47,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-13 22:11:47,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:47,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:47,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138844384] [2025-03-13 22:11:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138844384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945797941] [2025-03-13 22:11:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:47,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:47,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:47,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:47,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:47,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:47,940 INFO L124 PetriNetUnfolderBase]: 13/613 cut-off events. [2025-03-13 22:11:47,941 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-13 22:11:47,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 613 events. 13/613 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 835 event pairs, 2 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 515. Up to 13 conditions per place. [2025-03-13 22:11:47,948 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 8 selfloop transitions, 2 changer transitions 1/571 dead transitions. [2025-03-13 22:11:47,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 571 transitions, 1171 flow [2025-03-13 22:11:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2025-03-13 22:11:47,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744463373083475 [2025-03-13 22:11:47,968 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1171 flow. Second operand 3 states and 1716 transitions. [2025-03-13 22:11:47,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 571 transitions, 1171 flow [2025-03-13 22:11:47,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 571 transitions, 1166 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:11:47,986 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1148 flow [2025-03-13 22:11:47,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=568, PETRI_TRANSITIONS=570} [2025-03-13 22:11:47,993 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -7 predicate places. [2025-03-13 22:11:47,994 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1148 flow [2025-03-13 22:11:47,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:47,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:47,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:47,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:11:47,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash 744000344, now seen corresponding path program 1 times [2025-03-13 22:11:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:47,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47480338] [2025-03-13 22:11:47,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:48,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:11:48,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:11:48,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:48,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:48,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47480338] [2025-03-13 22:11:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47480338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187994802] [2025-03-13 22:11:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:48,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:48,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:48,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:48,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:48,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 570 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:48,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:48,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:48,244 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2025-03-13 22:11:48,245 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:48,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 611 events. 13/611 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 831 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 538. Up to 13 conditions per place. [2025-03-13 22:11:48,248 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2025-03-13 22:11:48,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 569 transitions, 1166 flow [2025-03-13 22:11:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:48,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:48,251 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1148 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:48,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 569 transitions, 1166 flow [2025-03-13 22:11:48,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 569 transitions, 1162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:48,258 INFO L231 Difference]: Finished difference. Result has 566 places, 569 transitions, 1146 flow [2025-03-13 22:11:48,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=566, PETRI_TRANSITIONS=569} [2025-03-13 22:11:48,259 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -9 predicate places. [2025-03-13 22:11:48,259 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 569 transitions, 1146 flow [2025-03-13 22:11:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:48,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:11:48,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 784792730, now seen corresponding path program 1 times [2025-03-13 22:11:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117280506] [2025-03-13 22:11:48,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:48,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-13 22:11:48,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-13 22:11:48,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:48,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117280506] [2025-03-13 22:11:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117280506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590258572] [2025-03-13 22:11:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:48,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:48,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:48,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:48,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 569 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:48,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:48,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:48,454 INFO L124 PetriNetUnfolderBase]: 13/610 cut-off events. [2025-03-13 22:11:48,454 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:48,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 610 events. 13/610 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 828 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 530. Up to 13 conditions per place. [2025-03-13 22:11:48,460 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-13 22:11:48,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1164 flow [2025-03-13 22:11:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:48,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:48,464 INFO L175 Difference]: Start difference. First operand has 566 places, 569 transitions, 1146 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:48,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1164 flow [2025-03-13 22:11:48,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:48,472 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1144 flow [2025-03-13 22:11:48,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=565, PETRI_TRANSITIONS=568} [2025-03-13 22:11:48,473 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -10 predicate places. [2025-03-13 22:11:48,474 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1144 flow [2025-03-13 22:11:48,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:48,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:48,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:11:48,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:48,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1895695037, now seen corresponding path program 1 times [2025-03-13 22:11:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215584322] [2025-03-13 22:11:48,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:48,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-13 22:11:48,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-13 22:11:48,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:48,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215584322] [2025-03-13 22:11:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215584322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:48,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:48,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:48,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769467429] [2025-03-13 22:11:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:48,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:48,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:48,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:48,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2025-03-13 22:11:48,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:48,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2025-03-13 22:11:48,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:48,742 INFO L124 PetriNetUnfolderBase]: 29/1066 cut-off events. [2025-03-13 22:11:48,743 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:11:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1066 events. 29/1066 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3022 event pairs, 5 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 988. Up to 20 conditions per place. [2025-03-13 22:11:48,747 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-13 22:11:48,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1164 flow [2025-03-13 22:11:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-13 22:11:48,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2025-03-13 22:11:48,750 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1144 flow. Second operand 3 states and 1707 transitions. [2025-03-13 22:11:48,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1164 flow [2025-03-13 22:11:48,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:48,759 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2025-03-13 22:11:48,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2025-03-13 22:11:48,761 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -11 predicate places. [2025-03-13 22:11:48,761 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2025-03-13 22:11:48,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:48,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:11:48,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 19953635, now seen corresponding path program 1 times [2025-03-13 22:11:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206299518] [2025-03-13 22:11:48,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:48,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:11:48,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:11:48,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:48,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206299518] [2025-03-13 22:11:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206299518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998182114] [2025-03-13 22:11:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:48,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:48,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:48,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:48,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:48,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:48,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:48,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:48,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:48,990 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2025-03-13 22:11:48,990 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 608 events. 13/608 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 514. Up to 13 conditions per place. [2025-03-13 22:11:48,994 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-03-13 22:11:48,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1160 flow [2025-03-13 22:11:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:49,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:49,000 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:49,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1160 flow [2025-03-13 22:11:49,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:49,008 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2025-03-13 22:11:49,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=563, PETRI_TRANSITIONS=566} [2025-03-13 22:11:49,012 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -12 predicate places. [2025-03-13 22:11:49,012 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2025-03-13 22:11:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:49,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:49,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:11:49,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:49,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1195549601, now seen corresponding path program 1 times [2025-03-13 22:11:49,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:49,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960391651] [2025-03-13 22:11:49,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:49,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:11:49,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:11:49,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:49,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960391651] [2025-03-13 22:11:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960391651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:49,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064817950] [2025-03-13 22:11:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:49,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:49,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:49,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:49,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2025-03-13 22:11:49,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:49,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2025-03-13 22:11:49,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:49,182 INFO L124 PetriNetUnfolderBase]: 14/627 cut-off events. [2025-03-13 22:11:49,182 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-13 22:11:49,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 627 events. 14/627 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 924 event pairs, 3 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 529. Up to 16 conditions per place. [2025-03-13 22:11:49,188 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-03-13 22:11:49,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1160 flow [2025-03-13 22:11:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-13 22:11:49,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2025-03-13 22:11:49,191 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1707 transitions. [2025-03-13 22:11:49,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1160 flow [2025-03-13 22:11:49,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:49,197 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2025-03-13 22:11:49,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=562, PETRI_TRANSITIONS=565} [2025-03-13 22:11:49,198 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -13 predicate places. [2025-03-13 22:11:49,198 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2025-03-13 22:11:49,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:49,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:49,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:11:49,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:49,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -382944156, now seen corresponding path program 1 times [2025-03-13 22:11:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899053019] [2025-03-13 22:11:49,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:49,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-13 22:11:49,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-13 22:11:49,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:49,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899053019] [2025-03-13 22:11:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899053019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942465657] [2025-03-13 22:11:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:49,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:49,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:49,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:49,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:49,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:49,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:49,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:49,341 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2025-03-13 22:11:49,341 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:49,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 606 events. 13/606 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 813 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 498. Up to 13 conditions per place. [2025-03-13 22:11:49,345 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-03-13 22:11:49,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2025-03-13 22:11:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:49,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:49,348 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:49,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2025-03-13 22:11:49,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:49,354 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2025-03-13 22:11:49,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=561, PETRI_TRANSITIONS=564} [2025-03-13 22:11:49,355 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -14 predicate places. [2025-03-13 22:11:49,355 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2025-03-13 22:11:49,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:49,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:49,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:11:49,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:49,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1940042161, now seen corresponding path program 1 times [2025-03-13 22:11:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390943017] [2025-03-13 22:11:49,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:49,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-13 22:11:49,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-13 22:11:49,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:49,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:49,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:49,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390943017] [2025-03-13 22:11:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390943017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:49,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:49,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773467606] [2025-03-13 22:11:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:49,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:49,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:49,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:49,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:49,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:49,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:49,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:49,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:49,527 INFO L124 PetriNetUnfolderBase]: 13/605 cut-off events. [2025-03-13 22:11:49,527 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:49,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 605 events. 13/605 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 803 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 490. Up to 13 conditions per place. [2025-03-13 22:11:49,530 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-03-13 22:11:49,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2025-03-13 22:11:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:49,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:49,533 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:49,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2025-03-13 22:11:49,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:49,541 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2025-03-13 22:11:49,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2025-03-13 22:11:49,544 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2025-03-13 22:11:49,544 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2025-03-13 22:11:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:49,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:49,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:11:49,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:49,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1944956659, now seen corresponding path program 1 times [2025-03-13 22:11:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074408071] [2025-03-13 22:11:49,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:49,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-13 22:11:49,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-13 22:11:49,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:49,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074408071] [2025-03-13 22:11:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074408071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244246286] [2025-03-13 22:11:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:49,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:49,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:49,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:49,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:49,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:49,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:49,709 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2025-03-13 22:11:49,709 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:49,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 604 events. 13/604 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 802 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 482. Up to 13 conditions per place. [2025-03-13 22:11:49,713 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-03-13 22:11:49,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2025-03-13 22:11:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:49,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:49,716 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2025-03-13 22:11:49,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:49,723 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2025-03-13 22:11:49,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=559, PETRI_TRANSITIONS=562} [2025-03-13 22:11:49,724 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -16 predicate places. [2025-03-13 22:11:49,724 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2025-03-13 22:11:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:49,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:49,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:11:49,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:49,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1310971171, now seen corresponding path program 1 times [2025-03-13 22:11:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:49,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801259172] [2025-03-13 22:11:49,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:49,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:49,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-13 22:11:49,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-13 22:11:49,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:49,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801259172] [2025-03-13 22:11:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801259172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012858925] [2025-03-13 22:11:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:49,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:49,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:49,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:49,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:49,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:49,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:49,907 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2025-03-13 22:11:49,907 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:49,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 603 events. 13/603 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 799 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 474. Up to 13 conditions per place. [2025-03-13 22:11:49,911 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-03-13 22:11:49,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2025-03-13 22:11:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:49,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:49,914 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:49,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2025-03-13 22:11:49,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:49,921 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2025-03-13 22:11:49,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=558, PETRI_TRANSITIONS=561} [2025-03-13 22:11:49,922 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -17 predicate places. [2025-03-13 22:11:49,922 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2025-03-13 22:11:49,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:49,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:49,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:49,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:11:49,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:49,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1511149240, now seen corresponding path program 1 times [2025-03-13 22:11:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:49,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503927005] [2025-03-13 22:11:49,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:49,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-13 22:11:49,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-13 22:11:49,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:49,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503927005] [2025-03-13 22:11:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503927005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149326968] [2025-03-13 22:11:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:50,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:50,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:50,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:50,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:50,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:50,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:50,217 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2025-03-13 22:11:50,217 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:50,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 602 events. 13/602 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 797 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 466. Up to 13 conditions per place. [2025-03-13 22:11:50,220 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-13 22:11:50,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2025-03-13 22:11:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:50,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:50,223 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:50,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2025-03-13 22:11:50,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:50,229 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2025-03-13 22:11:50,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=557, PETRI_TRANSITIONS=560} [2025-03-13 22:11:50,231 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -18 predicate places. [2025-03-13 22:11:50,231 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2025-03-13 22:11:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:50,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:50,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:11:50,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:50,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash 317152258, now seen corresponding path program 1 times [2025-03-13 22:11:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413274357] [2025-03-13 22:11:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:50,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-13 22:11:50,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:11:50,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:50,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413274357] [2025-03-13 22:11:50,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413274357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:50,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128790761] [2025-03-13 22:11:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:50,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:50,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:50,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2025-03-13 22:11:50,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:50,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2025-03-13 22:11:50,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:50,504 INFO L124 PetriNetUnfolderBase]: 29/1049 cut-off events. [2025-03-13 22:11:50,505 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:11:50,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 1049 events. 29/1049 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2948 event pairs, 5 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2025-03-13 22:11:50,510 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-13 22:11:50,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1148 flow [2025-03-13 22:11:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-13 22:11:50,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2025-03-13 22:11:50,514 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1707 transitions. [2025-03-13 22:11:50,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1148 flow [2025-03-13 22:11:50,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:50,523 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2025-03-13 22:11:50,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=556, PETRI_TRANSITIONS=559} [2025-03-13 22:11:50,524 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2025-03-13 22:11:50,524 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2025-03-13 22:11:50,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:50,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:50,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:11:50,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:50,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -22390167, now seen corresponding path program 1 times [2025-03-13 22:11:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:50,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765161366] [2025-03-13 22:11:50,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:50,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-13 22:11:50,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-13 22:11:50,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:50,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765161366] [2025-03-13 22:11:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765161366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005172803] [2025-03-13 22:11:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:50,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:50,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:50,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:50,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:50,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:50,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:50,714 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2025-03-13 22:11:50,715 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:50,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 600 events. 13/600 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 792 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 450. Up to 13 conditions per place. [2025-03-13 22:11:50,720 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-13 22:11:50,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2025-03-13 22:11:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:50,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:50,724 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:50,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2025-03-13 22:11:50,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:50,732 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2025-03-13 22:11:50,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2025-03-13 22:11:50,734 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -20 predicate places. [2025-03-13 22:11:50,734 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2025-03-13 22:11:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:50,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:11:50,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash -859840092, now seen corresponding path program 1 times [2025-03-13 22:11:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843316413] [2025-03-13 22:11:50,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:50,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-13 22:11:50,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-13 22:11:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:50,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843316413] [2025-03-13 22:11:50,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843316413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727036421] [2025-03-13 22:11:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:50,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:50,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:50,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:50,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:50,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:50,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:50,914 INFO L124 PetriNetUnfolderBase]: 13/599 cut-off events. [2025-03-13 22:11:50,914 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:50,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 599 events. 13/599 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 788 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 442. Up to 13 conditions per place. [2025-03-13 22:11:50,918 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-03-13 22:11:50,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2025-03-13 22:11:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:50,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:50,920 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:50,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2025-03-13 22:11:50,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:50,926 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2025-03-13 22:11:50,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2025-03-13 22:11:50,928 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -21 predicate places. [2025-03-13 22:11:50,928 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2025-03-13 22:11:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:50,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:50,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:50,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:11:50,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1020474100, now seen corresponding path program 1 times [2025-03-13 22:11:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845957240] [2025-03-13 22:11:50,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:50,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-13 22:11:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-13 22:11:50,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845957240] [2025-03-13 22:11:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845957240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180712738] [2025-03-13 22:11:51,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:51,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:51,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:51,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:51,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:51,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:51,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:51,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:51,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:51,084 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2025-03-13 22:11:51,084 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:51,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 598 events. 13/598 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 788 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 434. Up to 13 conditions per place. [2025-03-13 22:11:51,087 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-03-13 22:11:51,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2025-03-13 22:11:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:51,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:51,090 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:51,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2025-03-13 22:11:51,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:51,096 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2025-03-13 22:11:51,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2025-03-13 22:11:51,098 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -22 predicate places. [2025-03-13 22:11:51,098 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2025-03-13 22:11:51,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:51,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:51,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:11:51,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:51,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1474964243, now seen corresponding path program 1 times [2025-03-13 22:11:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710392141] [2025-03-13 22:11:51,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:51,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-13 22:11:51,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-13 22:11:51,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:51,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710392141] [2025-03-13 22:11:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710392141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801498286] [2025-03-13 22:11:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:51,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:51,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:51,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:51,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:51,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:51,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:51,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:51,402 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2025-03-13 22:11:51,403 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:51,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 597 events. 13/597 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 786 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 426. Up to 13 conditions per place. [2025-03-13 22:11:51,407 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-03-13 22:11:51,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2025-03-13 22:11:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-13 22:11:51,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-13 22:11:51,410 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1709 transitions. [2025-03-13 22:11:51,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2025-03-13 22:11:51,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:51,416 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2025-03-13 22:11:51,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-03-13 22:11:51,418 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -23 predicate places. [2025-03-13 22:11:51,419 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2025-03-13 22:11:51,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:51,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:51,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:11:51,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:51,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash -787753335, now seen corresponding path program 1 times [2025-03-13 22:11:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:51,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942709990] [2025-03-13 22:11:51,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:51,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-13 22:11:51,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-13 22:11:51,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:51,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942709990] [2025-03-13 22:11:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942709990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708150589] [2025-03-13 22:11:51,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:51,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:51,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:51,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 587 [2025-03-13 22:11:51,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:51,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 587 [2025-03-13 22:11:51,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:51,606 INFO L124 PetriNetUnfolderBase]: 18/662 cut-off events. [2025-03-13 22:11:51,606 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 662 events. 18/662 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1124 event pairs, 5 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 494. Up to 21 conditions per place. [2025-03-13 22:11:51,610 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 10 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2025-03-13 22:11:51,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1140 flow [2025-03-13 22:11:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2025-03-13 22:11:51,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2025-03-13 22:11:51,613 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1705 transitions. [2025-03-13 22:11:51,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1140 flow [2025-03-13 22:11:51,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:51,619 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2025-03-13 22:11:51,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2025-03-13 22:11:51,620 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -24 predicate places. [2025-03-13 22:11:51,620 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2025-03-13 22:11:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:51,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:11:51,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 607817619, now seen corresponding path program 1 times [2025-03-13 22:11:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984533652] [2025-03-13 22:11:51,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-13 22:11:51,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-13 22:11:51,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:51,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984533652] [2025-03-13 22:11:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984533652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:51,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161828278] [2025-03-13 22:11:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:51,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:51,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:51,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:51,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-13 22:11:51,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:51,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-13 22:11:51,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:51,820 INFO L124 PetriNetUnfolderBase]: 34/1084 cut-off events. [2025-03-13 22:11:51,820 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:11:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1084 events. 34/1084 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3226 event pairs, 8 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 915. Up to 25 conditions per place. [2025-03-13 22:11:51,826 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2025-03-13 22:11:51,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1132 flow [2025-03-13 22:11:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2025-03-13 22:11:51,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710391822827938 [2025-03-13 22:11:51,828 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1710 transitions. [2025-03-13 22:11:51,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1132 flow [2025-03-13 22:11:51,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:51,835 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1110 flow [2025-03-13 22:11:51,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=549, PETRI_TRANSITIONS=552} [2025-03-13 22:11:51,836 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -26 predicate places. [2025-03-13 22:11:51,836 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1110 flow [2025-03-13 22:11:51,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:51,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:51,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:51,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:11:51,840 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2091354257, now seen corresponding path program 1 times [2025-03-13 22:11:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492181603] [2025-03-13 22:11:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 22:11:51,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 22:11:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:54,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:54,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492181603] [2025-03-13 22:11:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492181603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:54,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:54,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:11:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437675882] [2025-03-13 22:11:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:54,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:11:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:54,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:11:54,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:11:54,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 587 [2025-03-13 22:11:54,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 552 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:54,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:54,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 587 [2025-03-13 22:11:54,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:54,695 INFO L124 PetriNetUnfolderBase]: 126/1121 cut-off events. [2025-03-13 22:11:54,696 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-13 22:11:54,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1121 events. 126/1121 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5216 event pairs, 98 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1233. Up to 242 conditions per place. [2025-03-13 22:11:54,702 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 42 selfloop transitions, 9 changer transitions 0/551 dead transitions. [2025-03-13 22:11:54,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 551 transitions, 1210 flow [2025-03-13 22:11:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:11:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:11:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5302 transitions. [2025-03-13 22:11:54,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903236797274276 [2025-03-13 22:11:54,712 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1110 flow. Second operand 10 states and 5302 transitions. [2025-03-13 22:11:54,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 551 transitions, 1210 flow [2025-03-13 22:11:54,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 551 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:54,719 INFO L231 Difference]: Finished difference. Result has 556 places, 551 transitions, 1125 flow [2025-03-13 22:11:54,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1125, PETRI_PLACES=556, PETRI_TRANSITIONS=551} [2025-03-13 22:11:54,720 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2025-03-13 22:11:54,720 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 551 transitions, 1125 flow [2025-03-13 22:11:54,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:54,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:54,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:54,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:11:54,725 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:54,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1711547455, now seen corresponding path program 1 times [2025-03-13 22:11:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874638044] [2025-03-13 22:11:54,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:54,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-13 22:11:54,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-13 22:11:54,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874638044] [2025-03-13 22:11:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874638044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:54,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762342102] [2025-03-13 22:11:54,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:54,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:54,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:54,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:54,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:54,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2025-03-13 22:11:54,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 551 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:54,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:54,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2025-03-13 22:11:54,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:54,992 INFO L124 PetriNetUnfolderBase]: 43/1348 cut-off events. [2025-03-13 22:11:54,992 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:11:54,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 1348 events. 43/1348 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5334 event pairs, 9 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1191. Up to 31 conditions per place. [2025-03-13 22:11:54,998 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-13 22:11:54,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 550 transitions, 1151 flow [2025-03-13 22:11:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-03-13 22:11:55,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659284497444633 [2025-03-13 22:11:55,001 INFO L175 Difference]: Start difference. First operand has 556 places, 551 transitions, 1125 flow. Second operand 3 states and 1701 transitions. [2025-03-13 22:11:55,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 550 transitions, 1151 flow [2025-03-13 22:11:55,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 550 transitions, 1133 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-13 22:11:55,006 INFO L231 Difference]: Finished difference. Result has 548 places, 550 transitions, 1109 flow [2025-03-13 22:11:55,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=548, PETRI_TRANSITIONS=550} [2025-03-13 22:11:55,007 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -27 predicate places. [2025-03-13 22:11:55,007 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 550 transitions, 1109 flow [2025-03-13 22:11:55,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:55,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:55,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:11:55,008 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1048763303, now seen corresponding path program 1 times [2025-03-13 22:11:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:55,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763219082] [2025-03-13 22:11:55,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:55,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-13 22:11:55,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-13 22:11:55,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:55,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:11:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:55,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763219082] [2025-03-13 22:11:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763219082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448180938] [2025-03-13 22:11:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:55,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:55,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:55,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 587 [2025-03-13 22:11:55,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 550 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:55,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 587 [2025-03-13 22:11:55,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:55,192 INFO L124 PetriNetUnfolderBase]: 45/1038 cut-off events. [2025-03-13 22:11:55,193 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:11:55,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1038 events. 45/1038 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3569 event pairs, 20 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 899. Up to 53 conditions per place. [2025-03-13 22:11:55,198 INFO L140 encePairwiseOnDemand]: 582/587 looper letters, 13 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2025-03-13 22:11:55,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 546 transitions, 1129 flow [2025-03-13 22:11:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2025-03-13 22:11:55,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642248722316865 [2025-03-13 22:11:55,201 INFO L175 Difference]: Start difference. First operand has 548 places, 550 transitions, 1109 flow. Second operand 3 states and 1698 transitions. [2025-03-13 22:11:55,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 546 transitions, 1129 flow [2025-03-13 22:11:55,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 546 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:55,206 INFO L231 Difference]: Finished difference. Result has 544 places, 546 transitions, 1099 flow [2025-03-13 22:11:55,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=546} [2025-03-13 22:11:55,207 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2025-03-13 22:11:55,207 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 546 transitions, 1099 flow [2025-03-13 22:11:55,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:55,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:11:55,208 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 994640436, now seen corresponding path program 1 times [2025-03-13 22:11:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990112130] [2025-03-13 22:11:55,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:55,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-13 22:11:55,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-13 22:11:55,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:55,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990112130] [2025-03-13 22:11:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990112130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074738117] [2025-03-13 22:11:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:55,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:55,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:55,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 587 [2025-03-13 22:11:55,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 546 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:55,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 587 [2025-03-13 22:11:55,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:55,378 INFO L124 PetriNetUnfolderBase]: 13/587 cut-off events. [2025-03-13 22:11:55,378 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 587 events. 13/587 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 771 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 400. Up to 11 conditions per place. [2025-03-13 22:11:55,381 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 6 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2025-03-13 22:11:55,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 545 transitions, 1111 flow [2025-03-13 22:11:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1718 transitions. [2025-03-13 22:11:55,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755820556501987 [2025-03-13 22:11:55,384 INFO L175 Difference]: Start difference. First operand has 544 places, 546 transitions, 1099 flow. Second operand 3 states and 1718 transitions. [2025-03-13 22:11:55,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 545 transitions, 1111 flow [2025-03-13 22:11:55,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 545 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:55,389 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1098 flow [2025-03-13 22:11:55,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-03-13 22:11:55,390 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2025-03-13 22:11:55,390 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1098 flow [2025-03-13 22:11:55,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:55,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:55,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:11:55,391 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:55,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash 344169928, now seen corresponding path program 1 times [2025-03-13 22:11:55,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:55,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108384927] [2025-03-13 22:11:55,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:55,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-13 22:11:55,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-13 22:11:55,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:55,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:55,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:55,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108384927] [2025-03-13 22:11:55,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108384927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:55,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875859005] [2025-03-13 22:11:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:55,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:55,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:55,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:55,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2025-03-13 22:11:55,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1098 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:55,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2025-03-13 22:11:55,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:55,582 INFO L124 PetriNetUnfolderBase]: 23/714 cut-off events. [2025-03-13 22:11:55,582 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-13 22:11:55,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 714 events. 23/714 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1573 event pairs, 8 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 552. Up to 30 conditions per place. [2025-03-13 22:11:55,586 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 13 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-03-13 22:11:55,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 544 transitions, 1126 flow [2025-03-13 22:11:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2025-03-13 22:11:55,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966496308915389 [2025-03-13 22:11:55,589 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1098 flow. Second operand 3 states and 1702 transitions. [2025-03-13 22:11:55,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 544 transitions, 1126 flow [2025-03-13 22:11:55,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 544 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:55,594 INFO L231 Difference]: Finished difference. Result has 544 places, 544 transitions, 1099 flow [2025-03-13 22:11:55,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=544} [2025-03-13 22:11:55,596 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2025-03-13 22:11:55,596 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 544 transitions, 1099 flow [2025-03-13 22:11:55,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:55,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:55,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:11:55,597 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:55,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash -872231578, now seen corresponding path program 1 times [2025-03-13 22:11:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:55,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476069901] [2025-03-13 22:11:55,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:55,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:55,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-13 22:11:55,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-13 22:11:55,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:55,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476069901] [2025-03-13 22:11:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476069901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:55,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:55,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334715361] [2025-03-13 22:11:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:55,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:55,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:55,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:55,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2025-03-13 22:11:55,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 544 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:55,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2025-03-13 22:11:55,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:55,881 INFO L124 PetriNetUnfolderBase]: 44/1078 cut-off events. [2025-03-13 22:11:55,881 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-13 22:11:55,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 1078 events. 44/1078 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3631 event pairs, 2 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 983. Up to 43 conditions per place. [2025-03-13 22:11:55,887 INFO L140 encePairwiseOnDemand]: 581/587 looper letters, 16 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2025-03-13 22:11:55,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 547 transitions, 1147 flow [2025-03-13 22:11:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-03-13 22:11:55,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699034639409426 [2025-03-13 22:11:55,890 INFO L175 Difference]: Start difference. First operand has 544 places, 544 transitions, 1099 flow. Second operand 3 states and 1708 transitions. [2025-03-13 22:11:55,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 547 transitions, 1147 flow [2025-03-13 22:11:55,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 547 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:11:55,906 INFO L231 Difference]: Finished difference. Result has 542 places, 542 transitions, 1102 flow [2025-03-13 22:11:55,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=542, PETRI_TRANSITIONS=542} [2025-03-13 22:11:55,908 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2025-03-13 22:11:55,908 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 542 transitions, 1102 flow [2025-03-13 22:11:55,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:55,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:55,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:55,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:11:55,912 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:55,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash 448301061, now seen corresponding path program 1 times [2025-03-13 22:11:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:55,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47295310] [2025-03-13 22:11:55,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:55,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-13 22:11:55,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-13 22:11:55,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:55,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:56,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:56,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47295310] [2025-03-13 22:11:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47295310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:56,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164761772] [2025-03-13 22:11:56,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:56,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:56,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:56,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:56,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:56,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2025-03-13 22:11:56,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 542 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:56,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:56,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2025-03-13 22:11:56,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:56,200 INFO L124 PetriNetUnfolderBase]: 49/1463 cut-off events. [2025-03-13 22:11:56,200 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:11:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1463 events. 49/1463 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6341 event pairs, 10 based on Foata normal form. 0/1386 useless extension candidates. Maximal degree in co-relation 1338. Up to 38 conditions per place. [2025-03-13 22:11:56,213 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2025-03-13 22:11:56,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 544 transitions, 1130 flow [2025-03-13 22:11:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2025-03-13 22:11:56,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2025-03-13 22:11:56,217 INFO L175 Difference]: Start difference. First operand has 542 places, 542 transitions, 1102 flow. Second operand 3 states and 1719 transitions. [2025-03-13 22:11:56,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 544 transitions, 1130 flow [2025-03-13 22:11:56,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 544 transitions, 1127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:56,227 INFO L231 Difference]: Finished difference. Result has 542 places, 541 transitions, 1099 flow [2025-03-13 22:11:56,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=542, PETRI_TRANSITIONS=541} [2025-03-13 22:11:56,228 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2025-03-13 22:11:56,228 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 541 transitions, 1099 flow [2025-03-13 22:11:56,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:56,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:56,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:11:56,230 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash 679079126, now seen corresponding path program 1 times [2025-03-13 22:11:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088913076] [2025-03-13 22:11:56,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:56,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-13 22:11:56,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-13 22:11:56,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088913076] [2025-03-13 22:11:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088913076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90626545] [2025-03-13 22:11:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:56,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:56,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:56,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:56,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 587 [2025-03-13 22:11:56,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 541 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:56,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:56,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 587 [2025-03-13 22:11:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:56,497 INFO L124 PetriNetUnfolderBase]: 30/861 cut-off events. [2025-03-13 22:11:56,497 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-13 22:11:56,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 861 events. 30/861 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2466 event pairs, 10 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 728. Up to 44 conditions per place. [2025-03-13 22:11:56,505 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 14 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-03-13 22:11:56,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 541 transitions, 1131 flow [2025-03-13 22:11:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2025-03-13 22:11:56,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2025-03-13 22:11:56,508 INFO L175 Difference]: Start difference. First operand has 542 places, 541 transitions, 1099 flow. Second operand 3 states and 1705 transitions. [2025-03-13 22:11:56,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 541 transitions, 1131 flow [2025-03-13 22:11:56,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 541 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:56,514 INFO L231 Difference]: Finished difference. Result has 543 places, 541 transitions, 1106 flow [2025-03-13 22:11:56,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=543, PETRI_TRANSITIONS=541} [2025-03-13 22:11:56,516 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2025-03-13 22:11:56,516 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 541 transitions, 1106 flow [2025-03-13 22:11:56,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:56,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:56,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:11:56,517 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1320629670, now seen corresponding path program 1 times [2025-03-13 22:11:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891085668] [2025-03-13 22:11:56,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-13 22:11:56,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-13 22:11:56,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891085668] [2025-03-13 22:11:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891085668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293035944] [2025-03-13 22:11:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:56,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:56,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:56,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2025-03-13 22:11:56,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 541 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:56,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:56,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2025-03-13 22:11:56,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:56,886 INFO L124 PetriNetUnfolderBase]: 49/1445 cut-off events. [2025-03-13 22:11:56,886 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 22:11:56,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1445 events. 49/1445 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6210 event pairs, 10 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 1517. Up to 38 conditions per place. [2025-03-13 22:11:56,895 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2025-03-13 22:11:56,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 543 transitions, 1134 flow [2025-03-13 22:11:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2025-03-13 22:11:56,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2025-03-13 22:11:56,898 INFO L175 Difference]: Start difference. First operand has 543 places, 541 transitions, 1106 flow. Second operand 3 states and 1719 transitions. [2025-03-13 22:11:56,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 543 transitions, 1134 flow [2025-03-13 22:11:56,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 543 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:56,905 INFO L231 Difference]: Finished difference. Result has 543 places, 540 transitions, 1104 flow [2025-03-13 22:11:56,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=543, PETRI_TRANSITIONS=540} [2025-03-13 22:11:56,906 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2025-03-13 22:11:56,906 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 540 transitions, 1104 flow [2025-03-13 22:11:56,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:56,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:56,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:11:56,907 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:56,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1502269747, now seen corresponding path program 1 times [2025-03-13 22:11:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863867101] [2025-03-13 22:11:56,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:56,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-13 22:11:56,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-13 22:11:56,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:56,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863867101] [2025-03-13 22:11:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863867101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:56,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:11:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361516900] [2025-03-13 22:11:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:57,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:11:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:57,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:11:57,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:11:57,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2025-03-13 22:11:57,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 540 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:57,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:57,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2025-03-13 22:11:57,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:57,121 INFO L124 PetriNetUnfolderBase]: 23/800 cut-off events. [2025-03-13 22:11:57,122 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2025-03-13 22:11:57,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 800 events. 23/800 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2053 event pairs, 0 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 648. Up to 24 conditions per place. [2025-03-13 22:11:57,128 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 7 selfloop transitions, 1 changer transitions 1/540 dead transitions. [2025-03-13 22:11:57,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 540 transitions, 1123 flow [2025-03-13 22:11:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:11:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:11:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2025-03-13 22:11:57,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9750141964792731 [2025-03-13 22:11:57,132 INFO L175 Difference]: Start difference. First operand has 543 places, 540 transitions, 1104 flow. Second operand 3 states and 1717 transitions. [2025-03-13 22:11:57,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 540 transitions, 1123 flow [2025-03-13 22:11:57,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 540 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:11:57,141 INFO L231 Difference]: Finished difference. Result has 543 places, 539 transitions, 1103 flow [2025-03-13 22:11:57,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=543, PETRI_TRANSITIONS=539} [2025-03-13 22:11:57,142 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2025-03-13 22:11:57,142 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 539 transitions, 1103 flow [2025-03-13 22:11:57,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:57,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:11:57,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:11:57,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:11:57,143 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:11:57,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:11:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash 501329262, now seen corresponding path program 1 times [2025-03-13 22:11:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:11:57,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130270673] [2025-03-13 22:11:57,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:11:57,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:11:57,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-13 22:11:57,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-13 22:11:57,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:11:57,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:11:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:11:59,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:11:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130270673] [2025-03-13 22:11:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130270673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:11:59,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:11:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:11:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871360373] [2025-03-13 22:11:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:11:59,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:11:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:11:59,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:11:59,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:11:59,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 587 [2025-03-13 22:11:59,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 539 transitions, 1103 flow. Second operand has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:11:59,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:11:59,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 587 [2025-03-13 22:11:59,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:11:59,979 INFO L124 PetriNetUnfolderBase]: 303/2861 cut-off events. [2025-03-13 22:11:59,980 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:11:59,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 2861 events. 303/2861 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 22072 event pairs, 47 based on Foata normal form. 0/2715 useless extension candidates. Maximal degree in co-relation 3322. Up to 323 conditions per place. [2025-03-13 22:11:59,994 INFO L140 encePairwiseOnDemand]: 553/587 looper letters, 67 selfloop transitions, 45 changer transitions 6/597 dead transitions. [2025-03-13 22:11:59,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 597 transitions, 1461 flow [2025-03-13 22:11:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:11:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:12:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5346 transitions. [2025-03-13 22:12:00,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107325383304941 [2025-03-13 22:12:00,005 INFO L175 Difference]: Start difference. First operand has 543 places, 539 transitions, 1103 flow. Second operand 10 states and 5346 transitions. [2025-03-13 22:12:00,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 597 transitions, 1461 flow [2025-03-13 22:12:00,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 597 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:12:00,016 INFO L231 Difference]: Finished difference. Result has 560 places, 576 transitions, 1419 flow [2025-03-13 22:12:00,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=560, PETRI_TRANSITIONS=576} [2025-03-13 22:12:00,018 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2025-03-13 22:12:00,018 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 576 transitions, 1419 flow [2025-03-13 22:12:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:00,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:12:00,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:12:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:12:00,020 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:12:00,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:12:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash -451464284, now seen corresponding path program 1 times [2025-03-13 22:12:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:12:00,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793133678] [2025-03-13 22:12:00,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:12:00,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:12:00,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-13 22:12:00,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-13 22:12:00,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:12:00,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:12:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:12:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:12:07,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793133678] [2025-03-13 22:12:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793133678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:12:07,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:12:07,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-13 22:12:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830433412] [2025-03-13 22:12:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:12:07,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 22:12:07,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:12:07,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 22:12:07,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-13 22:12:10,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 587 [2025-03-13 22:12:10,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 576 transitions, 1419 flow. Second operand has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:10,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:12:10,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 587 [2025-03-13 22:12:10,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:12:12,814 INFO L124 PetriNetUnfolderBase]: 1150/5598 cut-off events. [2025-03-13 22:12:12,814 INFO L125 PetriNetUnfolderBase]: For 962/1110 co-relation queries the response was YES. [2025-03-13 22:12:12,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9660 conditions, 5598 events. 1150/5598 cut-off events. For 962/1110 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 48431 event pairs, 72 based on Foata normal form. 24/5390 useless extension candidates. Maximal degree in co-relation 9427. Up to 980 conditions per place. [2025-03-13 22:12:12,836 INFO L140 encePairwiseOnDemand]: 542/587 looper letters, 278 selfloop transitions, 93 changer transitions 6/833 dead transitions. [2025-03-13 22:12:12,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 833 transitions, 3333 flow [2025-03-13 22:12:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-13 22:12:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-13 22:12:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 12197 transitions. [2025-03-13 22:12:12,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8657722884724588 [2025-03-13 22:12:12,843 INFO L175 Difference]: Start difference. First operand has 560 places, 576 transitions, 1419 flow. Second operand 24 states and 12197 transitions. [2025-03-13 22:12:12,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 833 transitions, 3333 flow [2025-03-13 22:12:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 833 transitions, 3333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:12:12,858 INFO L231 Difference]: Finished difference. Result has 590 places, 654 transitions, 2251 flow [2025-03-13 22:12:12,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2251, PETRI_PLACES=590, PETRI_TRANSITIONS=654} [2025-03-13 22:12:12,859 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 15 predicate places. [2025-03-13 22:12:12,859 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 654 transitions, 2251 flow [2025-03-13 22:12:12,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:12,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:12:12,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:12:12,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:12:12,863 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:12:12,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:12:12,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1417893396, now seen corresponding path program 2 times [2025-03-13 22:12:12,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:12:12,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794770281] [2025-03-13 22:12:12,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:12:12,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:12:12,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 356 statements into 2 equivalence classes. [2025-03-13 22:12:12,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 352 of 356 statements. [2025-03-13 22:12:12,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:12:12,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:12:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:12:18,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:12:18,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794770281] [2025-03-13 22:12:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794770281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:12:18,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:12:18,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-13 22:12:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131482030] [2025-03-13 22:12:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:12:18,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 22:12:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:12:18,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 22:12:18,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-13 22:12:20,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 587 [2025-03-13 22:12:20,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 654 transitions, 2251 flow. Second operand has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:20,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:12:20,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 587 [2025-03-13 22:12:20,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:12:23,104 INFO L124 PetriNetUnfolderBase]: 1758/8032 cut-off events. [2025-03-13 22:12:23,104 INFO L125 PetriNetUnfolderBase]: For 6201/6501 co-relation queries the response was YES. [2025-03-13 22:12:23,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17459 conditions, 8032 events. 1758/8032 cut-off events. For 6201/6501 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 75101 event pairs, 98 based on Foata normal form. 90/7802 useless extension candidates. Maximal degree in co-relation 17199. Up to 1249 conditions per place. [2025-03-13 22:12:23,149 INFO L140 encePairwiseOnDemand]: 542/587 looper letters, 379 selfloop transitions, 154 changer transitions 0/989 dead transitions. [2025-03-13 22:12:23,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 989 transitions, 5394 flow [2025-03-13 22:12:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-13 22:12:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-13 22:12:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 12739 transitions. [2025-03-13 22:12:23,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680749574105622 [2025-03-13 22:12:23,155 INFO L175 Difference]: Start difference. First operand has 590 places, 654 transitions, 2251 flow. Second operand 25 states and 12739 transitions. [2025-03-13 22:12:23,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 989 transitions, 5394 flow [2025-03-13 22:12:23,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 989 transitions, 5379 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 22:12:23,187 INFO L231 Difference]: Finished difference. Result has 621 places, 764 transitions, 3819 flow [2025-03-13 22:12:23,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3819, PETRI_PLACES=621, PETRI_TRANSITIONS=764} [2025-03-13 22:12:23,188 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 46 predicate places. [2025-03-13 22:12:23,188 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 764 transitions, 3819 flow [2025-03-13 22:12:23,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:23,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:12:23,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:12:23,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:12:23,191 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:12:23,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:12:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1748236916, now seen corresponding path program 3 times [2025-03-13 22:12:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:12:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432935930] [2025-03-13 22:12:23,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:12:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:12:23,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 356 statements into 3 equivalence classes. [2025-03-13 22:12:23,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 352 of 356 statements. [2025-03-13 22:12:23,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:12:23,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:12:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:12:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:12:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432935930] [2025-03-13 22:12:28,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432935930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:12:28,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:12:28,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-13 22:12:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993822332] [2025-03-13 22:12:28,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:12:28,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 22:12:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:12:28,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 22:12:28,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-13 22:12:30,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 587 [2025-03-13 22:12:30,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 764 transitions, 3819 flow. Second operand has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:30,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:12:30,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 587 [2025-03-13 22:12:30,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:12:33,269 INFO L124 PetriNetUnfolderBase]: 2049/9745 cut-off events. [2025-03-13 22:12:33,269 INFO L125 PetriNetUnfolderBase]: For 17696/18072 co-relation queries the response was YES. [2025-03-13 22:12:33,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24175 conditions, 9745 events. 2049/9745 cut-off events. For 17696/18072 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 96630 event pairs, 151 based on Foata normal form. 178/9509 useless extension candidates. Maximal degree in co-relation 23894. Up to 1074 conditions per place. [2025-03-13 22:12:33,378 INFO L140 encePairwiseOnDemand]: 542/587 looper letters, 407 selfloop transitions, 212 changer transitions 0/1075 dead transitions. [2025-03-13 22:12:33,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 1075 transitions, 7543 flow [2025-03-13 22:12:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-13 22:12:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-13 22:12:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 12727 transitions. [2025-03-13 22:12:33,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672572402044293 [2025-03-13 22:12:33,386 INFO L175 Difference]: Start difference. First operand has 621 places, 764 transitions, 3819 flow. Second operand 25 states and 12727 transitions. [2025-03-13 22:12:33,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 1075 transitions, 7543 flow [2025-03-13 22:12:33,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 1075 transitions, 7422 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-03-13 22:12:33,470 INFO L231 Difference]: Finished difference. Result has 652 places, 865 transitions, 5751 flow [2025-03-13 22:12:33,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=3702, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5751, PETRI_PLACES=652, PETRI_TRANSITIONS=865} [2025-03-13 22:12:33,471 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 77 predicate places. [2025-03-13 22:12:33,471 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 865 transitions, 5751 flow [2025-03-13 22:12:33,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:12:33,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:12:33,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:12:33,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:12:33,475 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-13 22:12:33,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:12:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash 711936464, now seen corresponding path program 4 times [2025-03-13 22:12:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:12:33,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947537428] [2025-03-13 22:12:33,477 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:12:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:12:33,498 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 356 statements into 2 equivalence classes. [2025-03-13 22:12:33,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 356 of 356 statements. [2025-03-13 22:12:33,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:12:33,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:12:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:12:38,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:12:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947537428] [2025-03-13 22:12:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947537428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:12:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417492433] [2025-03-13 22:12:38,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:12:38,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:12:38,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:12:38,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:12:38,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:12:38,723 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 356 statements into 2 equivalence classes. [2025-03-13 22:12:39,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 356 of 356 statements. [2025-03-13 22:12:39,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:12:39,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:12:39,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-13 22:12:39,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:12:39,317 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,374 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 22:12:39,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-13 22:12:39,450 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,501 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,555 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,601 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,645 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,688 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,735 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,778 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,824 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,870 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,911 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:39,956 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:39,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:40,000 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:40,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:40,038 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:12:40,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-13 22:12:40,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:12:40,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:12:40,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:12:40,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-13 22:12:40,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-13 22:12:40,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-13 22:12:41,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-03-13 22:12:41,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2025-03-13 22:12:41,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2025-03-13 22:12:41,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2025-03-13 22:12:41,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2025-03-13 22:12:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:12:41,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:12:41,572 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) is different from false [2025-03-13 22:12:41,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))) is different from false [2025-03-13 22:12:41,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0))))) is different from false [2025-03-13 22:12:41,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2025-03-13 22:12:43,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:12:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 91 [2025-03-13 22:12:43,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:12:43,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 52 [2025-03-13 22:12:43,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-13 22:12:43,121 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 1 [2025-03-13 22:12:43,128 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-13 22:12:43,139 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-13 22:12:43,151 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-13 22:12:43,159 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-13 22:12:43,164 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-13 22:12:43,169 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-13 22:12:43,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1