./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 11:00:21,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:00:21,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:00:21,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:00:21,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:00:21,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:00:21,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:00:21,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:00:21,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:00:21,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:00:21,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:00:21,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:00:21,145 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:00:21,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:00:21,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:00:21,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:00:21,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:00:21,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:00:21,148 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-17 11:00:21,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:00:21,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:00:21,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:00:21,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:00:21,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:00:21,385 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-17 11:00:22,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4cdade6/6650650161504b429467a2f65828041d/FLAG50dafa4c1 [2025-03-17 11:00:22,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:00:22,976 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-17 11:00:23,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4cdade6/6650650161504b429467a2f65828041d/FLAG50dafa4c1 [2025-03-17 11:00:23,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4cdade6/6650650161504b429467a2f65828041d [2025-03-17 11:00:23,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:00:23,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:00:23,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:00:23,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:00:23,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:00:23,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f05e003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23, skipping insertion in model container [2025-03-17 11:00:23,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:00:27,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:00:27,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:00:27,815 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-17 11:00:27,818 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-17 11:00:27,818 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-17 11:00:27,819 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-17 11:00:27,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-03-17 11:00:27,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:00:28,308 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:00:28,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28 WrapperNode [2025-03-17 11:00:28,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:00:28,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:00:28,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:00:28,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:00:28,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,443 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2025-03-17 11:00:28,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:00:28,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:00:28,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:00:28,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:00:28,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:00:28,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:00:28,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:00:28,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:00:28,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (1/1) ... [2025-03-17 11:00:28,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:00:28,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:00:28,553 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-17 11:00:28,561 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-17 11:00:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:00:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:00:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-17 11:00:28,578 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-17 11:00:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:00:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:00:28,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:00:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:00:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-03-17 11:00:28,579 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-03-17 11:00:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:00:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:00:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:00:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:00:28,581 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:00:28,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:00:28,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:00:29,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-03-17 11:00:29,183 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-03-17 11:00:29,183 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-03-17 11:00:29,458 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-03-17 11:00:29,459 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-03-17 11:00:29,459 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-03-17 11:00:29,518 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:00:29,518 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:00:29,586 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:00:29,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:00:29,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:00:29 BoogieIcfgContainer [2025-03-17 11:00:29,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:00:29,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:00:29,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:00:29,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:00:29,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:00:23" (1/3) ... [2025-03-17 11:00:29,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58922eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:00:29, skipping insertion in model container [2025-03-17 11:00:29,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:28" (2/3) ... [2025-03-17 11:00:29,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58922eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:00:29, skipping insertion in model container [2025-03-17 11:00:29,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:00:29" (3/3) ... [2025-03-17 11:00:29,594 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-03-17 11:00:29,605 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:00:29,607 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i that has 3 procedures, 574 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-03-17 11:00:29,607 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:00:29,701 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:00:29,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 580 places, 586 transitions, 1186 flow [2025-03-17 11:00:29,899 INFO L124 PetriNetUnfolderBase]: 13/584 cut-off events. [2025-03-17 11:00:29,900 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:00:29,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 584 events. 13/584 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 612 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 516. Up to 4 conditions per place. [2025-03-17 11:00:29,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 580 places, 586 transitions, 1186 flow [2025-03-17 11:00:29,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 574 places, 580 transitions, 1169 flow [2025-03-17 11:00:29,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:00:29,936 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;@33182d88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:00:29,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 11:00:29,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:00:29,951 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-17 11:00:29,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:00:29,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:29,951 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-17 11:00:29,952 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-17 11:00:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1822968733, now seen corresponding path program 1 times [2025-03-17 11:00:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30798837] [2025-03-17 11:00:29,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:30,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:00:30,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:00:30,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:30,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:30,286 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-17 11:00:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:30,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30798837] [2025-03-17 11:00:30,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30798837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:30,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:30,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:30,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675335131] [2025-03-17 11:00:30,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:30,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:30,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:30,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:30,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:30,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1169 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-17 11:00:30,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:30,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:30,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:30,467 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2025-03-17 11:00:30,467 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-17 11:00:30,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 611 events. 13/611 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 838 event pairs, 2 based on Foata normal form. 4/564 useless extension candidates. Maximal degree in co-relation 515. Up to 13 conditions per place. [2025-03-17 11:00:30,473 INFO L140 encePairwiseOnDemand]: 576/586 looper letters, 8 selfloop transitions, 2 changer transitions 1/570 dead transitions. [2025-03-17 11:00:30,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1169 flow [2025-03-17 11:00:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1713 transitions. [2025-03-17 11:00:30,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744027303754266 [2025-03-17 11:00:30,492 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1169 flow. Second operand 3 states and 1713 transitions. [2025-03-17 11:00:30,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1169 flow [2025-03-17 11:00:30,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 570 transitions, 1164 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:00:30,507 INFO L231 Difference]: Finished difference. Result has 567 places, 569 transitions, 1146 flow [2025-03-17 11:00:30,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=567, PETRI_TRANSITIONS=569} [2025-03-17 11:00:30,513 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -7 predicate places. [2025-03-17 11:00:30,513 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 569 transitions, 1146 flow [2025-03-17 11:00:30,515 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-17 11:00:30,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:30,515 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-17 11:00:30,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:00:30,515 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-17 11:00:30,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash -674431718, now seen corresponding path program 1 times [2025-03-17 11:00:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:30,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667414949] [2025-03-17 11:00:30,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:30,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:00:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:00:30,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:30,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:30,672 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-17 11:00:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667414949] [2025-03-17 11:00:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667414949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:30,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:30,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767938129] [2025-03-17 11:00:30,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:30,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:30,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:30,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:30,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:30,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 569 transitions, 1146 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-17 11:00:30,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:30,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:30,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:30,765 INFO L124 PetriNetUnfolderBase]: 13/609 cut-off events. [2025-03-17 11:00:30,765 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:30,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 609 events. 13/609 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 834 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 536. Up to 13 conditions per place. [2025-03-17 11:00:30,771 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-17 11:00:30,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1164 flow [2025-03-17 11:00:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:30,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:30,777 INFO L175 Difference]: Start difference. First operand has 567 places, 569 transitions, 1146 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:30,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1164 flow [2025-03-17 11:00:30,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:30,786 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1144 flow [2025-03-17 11:00:30,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:30,788 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -9 predicate places. [2025-03-17 11:00:30,788 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1144 flow [2025-03-17 11:00:30,790 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-17 11:00:30,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:30,790 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-17 11:00:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:00:30,790 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-17 11:00:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1255362161, now seen corresponding path program 1 times [2025-03-17 11:00:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23744426] [2025-03-17 11:00:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:30,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:00:30,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:00:30,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:30,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:30,901 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-17 11:00:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:30,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23744426] [2025-03-17 11:00:30,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23744426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:30,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:30,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877128217] [2025-03-17 11:00:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:30,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:30,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:30,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:30,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:30,915 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-17 11:00:30,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:30,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:30,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:30,996 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2025-03-17 11:00:30,996 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:31,000 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 830 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 528. Up to 13 conditions per place. [2025-03-17 11:00:31,003 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-17 11:00:31,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1162 flow [2025-03-17 11:00:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:31,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:31,008 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1144 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:31,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1162 flow [2025-03-17 11:00:31,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:31,015 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2025-03-17 11:00:31,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:31,017 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -10 predicate places. [2025-03-17 11:00:31,017 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2025-03-17 11:00:31,018 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-17 11:00:31,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,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] [2025-03-17 11:00:31,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:00:31,019 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-17 11:00:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 148098830, now seen corresponding path program 1 times [2025-03-17 11:00:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448253067] [2025-03-17 11:00:31,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 11:00:31,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 11:00:31,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,124 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-17 11:00:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448253067] [2025-03-17 11:00:31,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448253067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563797920] [2025-03-17 11:00:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 586 [2025-03-17 11:00:31,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1142 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-17 11:00:31,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 586 [2025-03-17 11:00:31,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,284 INFO L124 PetriNetUnfolderBase]: 29/1065 cut-off events. [2025-03-17 11:00:31,284 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:00:31,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 1065 events. 29/1065 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3021 event pairs, 5 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 987. Up to 20 conditions per place. [2025-03-17 11:00:31,289 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 9 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-03-17 11:00:31,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1162 flow [2025-03-17 11:00:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-03-17 11:00:31,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692832764505119 [2025-03-17 11:00:31,292 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1704 transitions. [2025-03-17 11:00:31,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1162 flow [2025-03-17 11:00:31,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:31,301 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2025-03-17 11:00:31,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:31,303 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -11 predicate places. [2025-03-17 11:00:31,303 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2025-03-17 11:00:31,304 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-17 11:00:31,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,305 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-17 11:00:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:00:31,305 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-17 11:00:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 744230069, now seen corresponding path program 1 times [2025-03-17 11:00:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943226758] [2025-03-17 11:00:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 11:00:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 11:00:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,379 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-17 11:00:31,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943226758] [2025-03-17 11:00:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943226758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39824451] [2025-03-17 11:00:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:31,389 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-17 11:00:31,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:31,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,453 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2025-03-17 11:00:31,453 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:31,455 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 819 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 512. Up to 13 conditions per place. [2025-03-17 11:00:31,456 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-03-17 11:00:31,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1158 flow [2025-03-17 11:00:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:31,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:31,462 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:31,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1158 flow [2025-03-17 11:00:31,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:31,470 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2025-03-17 11:00:31,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:31,472 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -12 predicate places. [2025-03-17 11:00:31,472 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2025-03-17 11:00:31,473 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-17 11:00:31,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:00:31,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:00:31,475 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-17 11:00:31,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash -155614554, now seen corresponding path program 1 times [2025-03-17 11:00:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070757190] [2025-03-17 11:00:31,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:00:31,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:00:31,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,541 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-17 11:00:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070757190] [2025-03-17 11:00:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070757190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503190639] [2025-03-17 11:00:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 586 [2025-03-17 11:00:31,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 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-17 11:00:31,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 586 [2025-03-17 11:00:31,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,657 INFO L124 PetriNetUnfolderBase]: 14/625 cut-off events. [2025-03-17 11:00:31,657 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:00:31,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 625 events. 14/625 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 909 event pairs, 3 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 527. Up to 16 conditions per place. [2025-03-17 11:00:31,662 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 9 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-03-17 11:00:31,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1158 flow [2025-03-17 11:00:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-03-17 11:00:31,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692832764505119 [2025-03-17 11:00:31,669 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1704 transitions. [2025-03-17 11:00:31,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1158 flow [2025-03-17 11:00:31,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:31,711 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2025-03-17 11:00:31,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:31,716 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -13 predicate places. [2025-03-17 11:00:31,719 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2025-03-17 11:00:31,721 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-17 11:00:31,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,721 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-17 11:00:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:00:31,721 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-17 11:00:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash 564756928, now seen corresponding path program 1 times [2025-03-17 11:00:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335105510] [2025-03-17 11:00:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:00:31,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:00:31,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,812 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-17 11:00:31,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335105510] [2025-03-17 11:00:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335105510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622978724] [2025-03-17 11:00:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:31,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 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-17 11:00:31,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,901 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2025-03-17 11:00:31,902 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:31,905 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 812 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 496. Up to 13 conditions per place. [2025-03-17 11:00:31,907 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-03-17 11:00:31,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2025-03-17 11:00:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:31,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:31,912 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:31,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2025-03-17 11:00:31,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:31,921 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2025-03-17 11:00:31,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:31,924 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -14 predicate places. [2025-03-17 11:00:31,925 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2025-03-17 11:00:31,926 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-17 11:00:31,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,926 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-17 11:00:31,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:00:31,926 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-17 11:00:31,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 747383789, now seen corresponding path program 1 times [2025-03-17 11:00:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544185730] [2025-03-17 11:00:31,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 11:00:31,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 11:00:31,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,004 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-17 11:00:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544185730] [2025-03-17 11:00:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544185730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437071933] [2025-03-17 11:00:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:32,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 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-17 11:00:32,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:32,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,101 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2025-03-17 11:00:32,101 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:32,104 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 804 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 488. Up to 13 conditions per place. [2025-03-17 11:00:32,106 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-03-17 11:00:32,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2025-03-17 11:00:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:32,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:32,110 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:32,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2025-03-17 11:00:32,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:32,118 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2025-03-17 11:00:32,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:32,120 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -15 predicate places. [2025-03-17 11:00:32,120 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2025-03-17 11:00:32,122 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-17 11:00:32,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,122 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-17 11:00:32,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:00:32,122 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-17 11:00:32,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1744165895, now seen corresponding path program 1 times [2025-03-17 11:00:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324318265] [2025-03-17 11:00:32,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 11:00:32,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:00:32,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,223 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-17 11:00:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324318265] [2025-03-17 11:00:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324318265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717759771] [2025-03-17 11:00:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:32,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 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-17 11:00:32,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:32,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,307 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2025-03-17 11:00:32,307 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:32,310 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 802 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 480. Up to 13 conditions per place. [2025-03-17 11:00:32,312 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-03-17 11:00:32,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2025-03-17 11:00:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:32,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:32,315 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:32,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2025-03-17 11:00:32,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:32,323 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2025-03-17 11:00:32,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:32,325 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -16 predicate places. [2025-03-17 11:00:32,325 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2025-03-17 11:00:32,326 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-17 11:00:32,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,326 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-17 11:00:32,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:00:32,327 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-17 11:00:32,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash 874800097, now seen corresponding path program 1 times [2025-03-17 11:00:32,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248253042] [2025-03-17 11:00:32,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 11:00:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 11:00:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,409 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-17 11:00:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248253042] [2025-03-17 11:00:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248253042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560507794] [2025-03-17 11:00:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:32,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 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-17 11:00:32,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:32,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,498 INFO L124 PetriNetUnfolderBase]: 13/601 cut-off events. [2025-03-17 11:00:32,498 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:32,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 601 events. 13/601 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/560 useless extension candidates. Maximal degree in co-relation 472. Up to 13 conditions per place. [2025-03-17 11:00:32,503 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-17 11:00:32,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2025-03-17 11:00:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:32,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:32,507 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:32,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2025-03-17 11:00:32,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:32,515 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2025-03-17 11:00:32,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:32,516 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -17 predicate places. [2025-03-17 11:00:32,517 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2025-03-17 11:00:32,518 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-17 11:00:32,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,519 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-17 11:00:32,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:00:32,519 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-17 11:00:32,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash 953971376, now seen corresponding path program 1 times [2025-03-17 11:00:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265189361] [2025-03-17 11:00:32,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:00:32,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:00:32,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,600 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-17 11:00:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265189361] [2025-03-17 11:00:32,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265189361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954024151] [2025-03-17 11:00:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:32,613 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-17 11:00:32,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:32,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,711 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2025-03-17 11:00:32,712 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:32,714 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 799 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 464. Up to 13 conditions per place. [2025-03-17 11:00:32,716 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-17 11:00:32,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1146 flow [2025-03-17 11:00:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:32,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:32,721 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:32,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1146 flow [2025-03-17 11:00:32,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:32,731 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2025-03-17 11:00:32,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:32,733 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -18 predicate places. [2025-03-17 11:00:32,733 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2025-03-17 11:00:32,734 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-17 11:00:32,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,734 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-17 11:00:32,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:00:32,734 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-17 11:00:32,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1774165663, now seen corresponding path program 1 times [2025-03-17 11:00:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490387065] [2025-03-17 11:00:32,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 11:00:32,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 11:00:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,825 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-17 11:00:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490387065] [2025-03-17 11:00:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490387065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504984564] [2025-03-17 11:00:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 586 [2025-03-17 11:00:32,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 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-17 11:00:32,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 586 [2025-03-17 11:00:32,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,972 INFO L124 PetriNetUnfolderBase]: 29/1048 cut-off events. [2025-03-17 11:00:32,973 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:00:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 1048 events. 29/1048 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2952 event pairs, 5 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 914. Up to 20 conditions per place. [2025-03-17 11:00:32,980 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 9 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-17 11:00:32,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1146 flow [2025-03-17 11:00:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-03-17 11:00:32,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692832764505119 [2025-03-17 11:00:32,984 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1704 transitions. [2025-03-17 11:00:32,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1146 flow [2025-03-17 11:00:32,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:32,992 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2025-03-17 11:00:32,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:32,994 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -19 predicate places. [2025-03-17 11:00:32,994 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2025-03-17 11:00:32,995 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-17 11:00:32,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,997 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-17 11:00:32,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:00:32,997 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-17 11:00:32,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1632519135, now seen corresponding path program 1 times [2025-03-17 11:00:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80933680] [2025-03-17 11:00:32,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 11:00:33,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 11:00:33,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:33,095 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-17 11:00:33,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:33,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80933680] [2025-03-17 11:00:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80933680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:33,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:33,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:33,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944260079] [2025-03-17 11:00:33,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:33,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:33,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:33,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:33,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:33,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 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-17 11:00:33,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:33,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:33,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:33,176 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2025-03-17 11:00:33,176 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:33,179 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 792 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 448. Up to 13 conditions per place. [2025-03-17 11:00:33,181 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-03-17 11:00:33,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2025-03-17 11:00:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:33,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:33,185 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:33,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2025-03-17 11:00:33,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:33,193 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2025-03-17 11:00:33,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:33,195 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -20 predicate places. [2025-03-17 11:00:33,195 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2025-03-17 11:00:33,196 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-17 11:00:33,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:33,197 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-17 11:00:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:00:33,197 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-17 11:00:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2128842469, now seen corresponding path program 1 times [2025-03-17 11:00:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126216113] [2025-03-17 11:00:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:00:33,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:00:33,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:33,369 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-17 11:00:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126216113] [2025-03-17 11:00:33,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126216113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:33,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:33,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938161061] [2025-03-17 11:00:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:33,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:33,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:33,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:33,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 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-17 11:00:33,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:33,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:33,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:33,488 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2025-03-17 11:00:33,489 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:33,491 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 789 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 440. Up to 13 conditions per place. [2025-03-17 11:00:33,493 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-03-17 11:00:33,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2025-03-17 11:00:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:33,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:33,496 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:33,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2025-03-17 11:00:33,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:33,502 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2025-03-17 11:00:33,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:33,503 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -21 predicate places. [2025-03-17 11:00:33,503 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2025-03-17 11:00:33,505 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-17 11:00:33,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:33,505 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-17 11:00:33,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:00:33,505 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-17 11:00:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash 980289795, now seen corresponding path program 1 times [2025-03-17 11:00:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951176728] [2025-03-17 11:00:33,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 11:00:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 11:00:33,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:33,587 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-17 11:00:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951176728] [2025-03-17 11:00:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951176728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:33,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319271900] [2025-03-17 11:00:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:33,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:33,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:33,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:33,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 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-17 11:00:33,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:33,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:33,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:33,653 INFO L124 PetriNetUnfolderBase]: 13/596 cut-off events. [2025-03-17 11:00:33,653 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:33,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 596 events. 13/596 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/560 useless extension candidates. Maximal degree in co-relation 432. Up to 13 conditions per place. [2025-03-17 11:00:33,656 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-03-17 11:00:33,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2025-03-17 11:00:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:33,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:33,686 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:33,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2025-03-17 11:00:33,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:33,692 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2025-03-17 11:00:33,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:33,694 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -22 predicate places. [2025-03-17 11:00:33,694 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2025-03-17 11:00:33,695 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-17 11:00:33,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:33,695 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-17 11:00:33,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:00:33,695 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-17 11:00:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1941277111, now seen corresponding path program 1 times [2025-03-17 11:00:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122054137] [2025-03-17 11:00:33,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 11:00:33,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 11:00:33,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:33,795 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-17 11:00:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:33,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122054137] [2025-03-17 11:00:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122054137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:33,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743695688] [2025-03-17 11:00:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:33,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:33,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:33,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:33,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:33,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 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-17 11:00:33,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:33,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:33,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:33,865 INFO L124 PetriNetUnfolderBase]: 13/595 cut-off events. [2025-03-17 11:00:33,865 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:33,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 595 events. 13/595 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 784 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 424. Up to 13 conditions per place. [2025-03-17 11:00:33,869 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 8 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2025-03-17 11:00:33,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1136 flow [2025-03-17 11:00:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-17 11:00:33,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:00:33,872 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1706 transitions. [2025-03-17 11:00:33,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1136 flow [2025-03-17 11:00:33,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:33,879 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2025-03-17 11:00:33,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, 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-17 11:00:33,880 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -23 predicate places. [2025-03-17 11:00:33,880 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2025-03-17 11:00:33,881 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-17 11:00:33,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:33,882 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-17 11:00:33,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:00:33,882 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-17 11:00:33,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash 969930049, now seen corresponding path program 1 times [2025-03-17 11:00:33,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:33,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840738731] [2025-03-17 11:00:33,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:33,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:00:33,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:00:33,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:33,956 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-17 11:00:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840738731] [2025-03-17 11:00:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840738731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:33,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:33,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679300956] [2025-03-17 11:00:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:33,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:33,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:33,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:33,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 586 [2025-03-17 11:00:33,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 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-17 11:00:33,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:33,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 586 [2025-03-17 11:00:33,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:34,062 INFO L124 PetriNetUnfolderBase]: 18/659 cut-off events. [2025-03-17 11:00:34,063 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:34,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 659 events. 18/659 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1109 event pairs, 5 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 491. Up to 21 conditions per place. [2025-03-17 11:00:34,066 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 10 selfloop transitions, 2 changer transitions 0/553 dead transitions. [2025-03-17 11:00:34,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 553 transitions, 1138 flow [2025-03-17 11:00:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2025-03-17 11:00:34,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681456200227532 [2025-03-17 11:00:34,069 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1702 transitions. [2025-03-17 11:00:34,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 553 transitions, 1138 flow [2025-03-17 11:00:34,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 553 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:34,074 INFO L231 Difference]: Finished difference. Result has 550 places, 553 transitions, 1114 flow [2025-03-17 11:00:34,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=550, PETRI_TRANSITIONS=553} [2025-03-17 11:00:34,075 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -24 predicate places. [2025-03-17 11:00:34,076 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 553 transitions, 1114 flow [2025-03-17 11:00:34,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 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-17 11:00:34,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:34,076 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-17 11:00:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:00:34,077 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-17 11:00:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1004447113, now seen corresponding path program 1 times [2025-03-17 11:00:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:34,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000751596] [2025-03-17 11:00:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:34,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 11:00:34,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 11:00:34,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:34,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:34,142 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-17 11:00:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000751596] [2025-03-17 11:00:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000751596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312268025] [2025-03-17 11:00:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:34,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:34,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:34,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:34,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 586 [2025-03-17 11:00:34,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 553 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 566.0) internal successors, (1698), 3 states have internal predecessors, (1698), 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-17 11:00:34,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:34,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 586 [2025-03-17 11:00:34,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:34,283 INFO L124 PetriNetUnfolderBase]: 34/1082 cut-off events. [2025-03-17 11:00:34,283 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:00:34,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 1082 events. 34/1082 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3217 event pairs, 8 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 913. Up to 25 conditions per place. [2025-03-17 11:00:34,287 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 9 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2025-03-17 11:00:34,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 551 transitions, 1130 flow [2025-03-17 11:00:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-17 11:00:34,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9709897610921502 [2025-03-17 11:00:34,290 INFO L175 Difference]: Start difference. First operand has 550 places, 553 transitions, 1114 flow. Second operand 3 states and 1707 transitions. [2025-03-17 11:00:34,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 551 transitions, 1130 flow [2025-03-17 11:00:34,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 551 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:34,296 INFO L231 Difference]: Finished difference. Result has 548 places, 551 transitions, 1108 flow [2025-03-17 11:00:34,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1108, PETRI_PLACES=548, PETRI_TRANSITIONS=551} [2025-03-17 11:00:34,297 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -26 predicate places. [2025-03-17 11:00:34,297 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 551 transitions, 1108 flow [2025-03-17 11:00:34,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.0) internal successors, (1698), 3 states have internal predecessors, (1698), 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-17 11:00:34,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:34,298 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-17 11:00:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:00:34,299 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-17 11:00:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 662659152, now seen corresponding path program 1 times [2025-03-17 11:00:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844936733] [2025-03-17 11:00:34,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:34,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:00:34,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:00:34,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:34,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:36,270 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-17 11:00:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:36,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844936733] [2025-03-17 11:00:36,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844936733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:36,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:36,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:00:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154438054] [2025-03-17 11:00:36,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:36,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:00:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:36,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:00:36,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:00:36,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 586 [2025-03-17 11:00:36,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 551 transitions, 1108 flow. Second operand has 10 states, 10 states have (on average 525.3) internal successors, (5253), 10 states have internal predecessors, (5253), 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-17 11:00:36,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:36,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 586 [2025-03-17 11:00:36,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:36,845 INFO L124 PetriNetUnfolderBase]: 126/1118 cut-off events. [2025-03-17 11:00:36,845 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-17 11:00:36,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1118 events. 126/1118 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5214 event pairs, 98 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1230. Up to 242 conditions per place. [2025-03-17 11:00:36,852 INFO L140 encePairwiseOnDemand]: 576/586 looper letters, 42 selfloop transitions, 9 changer transitions 0/550 dead transitions. [2025-03-17 11:00:36,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 550 transitions, 1208 flow [2025-03-17 11:00:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:00:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:00:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5292 transitions. [2025-03-17 11:00:36,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030716723549488 [2025-03-17 11:00:36,860 INFO L175 Difference]: Start difference. First operand has 548 places, 551 transitions, 1108 flow. Second operand 10 states and 5292 transitions. [2025-03-17 11:00:36,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 550 transitions, 1208 flow [2025-03-17 11:00:36,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 550 transitions, 1207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:36,866 INFO L231 Difference]: Finished difference. Result has 555 places, 550 transitions, 1123 flow [2025-03-17 11:00:36,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1123, PETRI_PLACES=555, PETRI_TRANSITIONS=550} [2025-03-17 11:00:36,867 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -19 predicate places. [2025-03-17 11:00:36,867 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 550 transitions, 1123 flow [2025-03-17 11:00:36,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 525.3) internal successors, (5253), 10 states have internal predecessors, (5253), 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-17 11:00:36,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:36,874 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-17 11:00:36,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:00:36,874 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-17 11:00:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1438187805, now seen corresponding path program 1 times [2025-03-17 11:00:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868381915] [2025-03-17 11:00:36,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 11:00:36,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 11:00:36,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:36,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:36,967 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-17 11:00:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868381915] [2025-03-17 11:00:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868381915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797502793] [2025-03-17 11:00:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:36,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:36,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:36,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:36,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 586 [2025-03-17 11:00:36,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 550 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 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-17 11:00:36,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:36,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 586 [2025-03-17 11:00:36,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:37,050 INFO L124 PetriNetUnfolderBase]: 22/675 cut-off events. [2025-03-17 11:00:37,051 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-17 11:00:37,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 675 events. 22/675 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1263 event pairs, 9 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 518. Up to 31 conditions per place. [2025-03-17 11:00:37,054 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 12 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-03-17 11:00:37,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 549 transitions, 1149 flow [2025-03-17 11:00:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2025-03-17 11:00:37,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9658703071672355 [2025-03-17 11:00:37,057 INFO L175 Difference]: Start difference. First operand has 555 places, 550 transitions, 1123 flow. Second operand 3 states and 1698 transitions. [2025-03-17 11:00:37,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 549 transitions, 1149 flow [2025-03-17 11:00:37,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 549 transitions, 1131 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-17 11:00:37,062 INFO L231 Difference]: Finished difference. Result has 547 places, 549 transitions, 1107 flow [2025-03-17 11:00:37,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=547, PETRI_TRANSITIONS=549} [2025-03-17 11:00:37,063 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -27 predicate places. [2025-03-17 11:00:37,063 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 549 transitions, 1107 flow [2025-03-17 11:00:37,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 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-17 11:00:37,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:37,064 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-17 11:00:37,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:00:37,064 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-17 11:00:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 543181753, now seen corresponding path program 1 times [2025-03-17 11:00:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641608149] [2025-03-17 11:00:37,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:37,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 11:00:37,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 11:00:37,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:37,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:37,142 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-17 11:00:37,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:37,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641608149] [2025-03-17 11:00:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641608149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:37,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:37,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447022263] [2025-03-17 11:00:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:37,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:37,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:37,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:37,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 586 [2025-03-17 11:00:37,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 549 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 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-17 11:00:37,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:37,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 586 [2025-03-17 11:00:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:37,285 INFO L124 PetriNetUnfolderBase]: 45/1040 cut-off events. [2025-03-17 11:00:37,285 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:00:37,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 1040 events. 45/1040 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3558 event pairs, 20 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 901. Up to 53 conditions per place. [2025-03-17 11:00:37,290 INFO L140 encePairwiseOnDemand]: 581/586 looper letters, 13 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2025-03-17 11:00:37,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 545 transitions, 1127 flow [2025-03-17 11:00:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1695 transitions. [2025-03-17 11:00:37,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641638225255973 [2025-03-17 11:00:37,293 INFO L175 Difference]: Start difference. First operand has 547 places, 549 transitions, 1107 flow. Second operand 3 states and 1695 transitions. [2025-03-17 11:00:37,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 545 transitions, 1127 flow [2025-03-17 11:00:37,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 545 transitions, 1123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:37,300 INFO L231 Difference]: Finished difference. Result has 543 places, 545 transitions, 1097 flow [2025-03-17 11:00:37,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=541, 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=1097, PETRI_PLACES=543, PETRI_TRANSITIONS=545} [2025-03-17 11:00:37,301 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -31 predicate places. [2025-03-17 11:00:37,301 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 545 transitions, 1097 flow [2025-03-17 11:00:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 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-17 11:00:37,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:37,302 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-17 11:00:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:00:37,303 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-17 11:00:37,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1263267206, now seen corresponding path program 1 times [2025-03-17 11:00:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:37,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695237408] [2025-03-17 11:00:37,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:37,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 11:00:37,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 11:00:37,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:37,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695237408] [2025-03-17 11:00:37,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695237408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:37,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:37,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989526661] [2025-03-17 11:00:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:37,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:37,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:37,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:37,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 586 [2025-03-17 11:00:37,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 545 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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-17 11:00:37,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:37,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 586 [2025-03-17 11:00:37,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:37,485 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2025-03-17 11:00:37,486 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:37,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 585 events. 13/585 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 764 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 398. Up to 11 conditions per place. [2025-03-17 11:00:37,491 INFO L140 encePairwiseOnDemand]: 584/586 looper letters, 6 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2025-03-17 11:00:37,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 544 transitions, 1109 flow [2025-03-17 11:00:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1715 transitions. [2025-03-17 11:00:37,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755403868031854 [2025-03-17 11:00:37,495 INFO L175 Difference]: Start difference. First operand has 543 places, 545 transitions, 1097 flow. Second operand 3 states and 1715 transitions. [2025-03-17 11:00:37,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 544 transitions, 1109 flow [2025-03-17 11:00:37,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 544 transitions, 1108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:37,503 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1096 flow [2025-03-17 11:00:37,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-03-17 11:00:37,505 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -31 predicate places. [2025-03-17 11:00:37,505 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1096 flow [2025-03-17 11:00:37,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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-17 11:00:37,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:37,506 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-17 11:00:37,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:00:37,506 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-17 11:00:37,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash -588099739, now seen corresponding path program 1 times [2025-03-17 11:00:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:37,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294664611] [2025-03-17 11:00:37,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:37,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-17 11:00:37,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-17 11:00:37,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294664611] [2025-03-17 11:00:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294664611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500219035] [2025-03-17 11:00:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:37,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:37,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:37,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:37,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 586 [2025-03-17 11:00:37,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1096 flow. Second operand has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 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-17 11:00:37,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:37,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 586 [2025-03-17 11:00:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:37,787 INFO L124 PetriNetUnfolderBase]: 23/710 cut-off events. [2025-03-17 11:00:37,788 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:37,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 710 events. 23/710 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1539 event pairs, 8 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 548. Up to 30 conditions per place. [2025-03-17 11:00:37,794 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 13 selfloop transitions, 2 changer transitions 0/543 dead transitions. [2025-03-17 11:00:37,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 543 transitions, 1124 flow [2025-03-17 11:00:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1699 transitions. [2025-03-17 11:00:37,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664391353811149 [2025-03-17 11:00:37,798 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1096 flow. Second operand 3 states and 1699 transitions. [2025-03-17 11:00:37,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 543 transitions, 1124 flow [2025-03-17 11:00:37,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 543 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:37,804 INFO L231 Difference]: Finished difference. Result has 543 places, 543 transitions, 1097 flow [2025-03-17 11:00:37,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=543, PETRI_TRANSITIONS=543} [2025-03-17 11:00:37,805 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -31 predicate places. [2025-03-17 11:00:37,805 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 543 transitions, 1097 flow [2025-03-17 11:00:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 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-17 11:00:37,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:37,806 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-17 11:00:37,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:00:37,807 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-17 11:00:37,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1951599457, now seen corresponding path program 1 times [2025-03-17 11:00:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581579548] [2025-03-17 11:00:37,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:37,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-17 11:00:37,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-17 11:00:37,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:37,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:37,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:37,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581579548] [2025-03-17 11:00:37,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581579548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:37,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:37,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960652381] [2025-03-17 11:00:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:37,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:37,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:37,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 586 [2025-03-17 11:00:37,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 543 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 562.0) internal successors, (1686), 3 states have internal predecessors, (1686), 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-17 11:00:37,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:37,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 586 [2025-03-17 11:00:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:38,088 INFO L124 PetriNetUnfolderBase]: 44/1075 cut-off events. [2025-03-17 11:00:38,089 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-17 11:00:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 1075 events. 44/1075 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3592 event pairs, 2 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 981. Up to 43 conditions per place. [2025-03-17 11:00:38,096 INFO L140 encePairwiseOnDemand]: 580/586 looper letters, 16 selfloop transitions, 3 changer transitions 0/546 dead transitions. [2025-03-17 11:00:38,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 546 transitions, 1145 flow [2025-03-17 11:00:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2025-03-17 11:00:38,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698521046643913 [2025-03-17 11:00:38,100 INFO L175 Difference]: Start difference. First operand has 543 places, 543 transitions, 1097 flow. Second operand 3 states and 1705 transitions. [2025-03-17 11:00:38,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 546 transitions, 1145 flow [2025-03-17 11:00:38,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 546 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:38,111 INFO L231 Difference]: Finished difference. Result has 541 places, 541 transitions, 1100 flow [2025-03-17 11:00:38,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=541, PETRI_TRANSITIONS=541} [2025-03-17 11:00:38,113 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -33 predicate places. [2025-03-17 11:00:38,113 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 541 transitions, 1100 flow [2025-03-17 11:00:38,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.0) internal successors, (1686), 3 states have internal predecessors, (1686), 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-17 11:00:38,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:38,114 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-17 11:00:38,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:00:38,114 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-17 11:00:38,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2073309528, now seen corresponding path program 1 times [2025-03-17 11:00:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836251933] [2025-03-17 11:00:38,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:38,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-17 11:00:38,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-17 11:00:38,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:38,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836251933] [2025-03-17 11:00:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836251933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:38,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:38,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:38,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122049803] [2025-03-17 11:00:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:38,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:38,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:38,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 586 [2025-03-17 11:00:38,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 541 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 569.3333333333334) internal successors, (1708), 3 states have internal predecessors, (1708), 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-17 11:00:38,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:38,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 586 [2025-03-17 11:00:38,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:38,483 INFO L124 PetriNetUnfolderBase]: 49/1459 cut-off events. [2025-03-17 11:00:38,483 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:00:38,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 1459 events. 49/1459 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6274 event pairs, 10 based on Foata normal form. 0/1382 useless extension candidates. Maximal degree in co-relation 1334. Up to 38 conditions per place. [2025-03-17 11:00:38,488 INFO L140 encePairwiseOnDemand]: 584/586 looper letters, 10 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2025-03-17 11:00:38,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 543 transitions, 1128 flow [2025-03-17 11:00:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2025-03-17 11:00:38,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761092150170648 [2025-03-17 11:00:38,491 INFO L175 Difference]: Start difference. First operand has 541 places, 541 transitions, 1100 flow. Second operand 3 states and 1716 transitions. [2025-03-17 11:00:38,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 543 transitions, 1128 flow [2025-03-17 11:00:38,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 543 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:38,498 INFO L231 Difference]: Finished difference. Result has 541 places, 540 transitions, 1097 flow [2025-03-17 11:00:38,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=539, 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=1097, PETRI_PLACES=541, PETRI_TRANSITIONS=540} [2025-03-17 11:00:38,499 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -33 predicate places. [2025-03-17 11:00:38,499 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 540 transitions, 1097 flow [2025-03-17 11:00:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.3333333333334) internal successors, (1708), 3 states have internal predecessors, (1708), 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-17 11:00:38,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:38,500 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-17 11:00:38,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:00:38,501 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-17 11:00:38,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash -173818570, now seen corresponding path program 1 times [2025-03-17 11:00:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919221684] [2025-03-17 11:00:38,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:38,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 11:00:38,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 11:00:38,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:38,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919221684] [2025-03-17 11:00:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919221684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111352314] [2025-03-17 11:00:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:38,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:38,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:38,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:38,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 586 [2025-03-17 11:00:38,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 540 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 564.0) internal successors, (1692), 3 states have internal predecessors, (1692), 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-17 11:00:38,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:38,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 586 [2025-03-17 11:00:38,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:38,785 INFO L124 PetriNetUnfolderBase]: 30/856 cut-off events. [2025-03-17 11:00:38,786 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-17 11:00:38,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 856 events. 30/856 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2425 event pairs, 10 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 723. Up to 44 conditions per place. [2025-03-17 11:00:38,791 INFO L140 encePairwiseOnDemand]: 583/586 looper letters, 14 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-03-17 11:00:38,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 540 transitions, 1129 flow [2025-03-17 11:00:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2025-03-17 11:00:38,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681456200227532 [2025-03-17 11:00:38,795 INFO L175 Difference]: Start difference. First operand has 541 places, 540 transitions, 1097 flow. Second operand 3 states and 1702 transitions. [2025-03-17 11:00:38,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 540 transitions, 1129 flow [2025-03-17 11:00:38,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 540 transitions, 1128 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:38,800 INFO L231 Difference]: Finished difference. Result has 542 places, 540 transitions, 1104 flow [2025-03-17 11:00:38,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=542, PETRI_TRANSITIONS=540} [2025-03-17 11:00:38,801 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -32 predicate places. [2025-03-17 11:00:38,801 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 540 transitions, 1104 flow [2025-03-17 11:00:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.0) internal successors, (1692), 3 states have internal predecessors, (1692), 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-17 11:00:38,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:38,802 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-17 11:00:38,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:00:38,803 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-17 11:00:38,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 414408361, now seen corresponding path program 1 times [2025-03-17 11:00:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:38,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145131241] [2025-03-17 11:00:38,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:38,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 11:00:38,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 11:00:38,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:38,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145131241] [2025-03-17 11:00:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145131241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174885245] [2025-03-17 11:00:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:38,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:38,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:38,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:38,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 586 [2025-03-17 11:00:38,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 540 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 569.3333333333334) internal successors, (1708), 3 states have internal predecessors, (1708), 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-17 11:00:38,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:38,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 586 [2025-03-17 11:00:38,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:39,042 INFO L124 PetriNetUnfolderBase]: 45/1327 cut-off events. [2025-03-17 11:00:39,043 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:00:39,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1327 events. 45/1327 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5269 event pairs, 0 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1399. Up to 38 conditions per place. [2025-03-17 11:00:39,052 INFO L140 encePairwiseOnDemand]: 584/586 looper letters, 10 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2025-03-17 11:00:39,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 542 transitions, 1132 flow [2025-03-17 11:00:39,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2025-03-17 11:00:39,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761092150170648 [2025-03-17 11:00:39,055 INFO L175 Difference]: Start difference. First operand has 542 places, 540 transitions, 1104 flow. Second operand 3 states and 1716 transitions. [2025-03-17 11:00:39,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 542 transitions, 1132 flow [2025-03-17 11:00:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 542 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:39,064 INFO L231 Difference]: Finished difference. Result has 542 places, 539 transitions, 1102 flow [2025-03-17 11:00:39,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=540, 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=1102, PETRI_PLACES=542, PETRI_TRANSITIONS=539} [2025-03-17 11:00:39,065 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -32 predicate places. [2025-03-17 11:00:39,065 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 539 transitions, 1102 flow [2025-03-17 11:00:39,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.3333333333334) internal successors, (1708), 3 states have internal predecessors, (1708), 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-17 11:00:39,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:39,066 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-17 11:00:39,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:00:39,066 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-17 11:00:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1236203091, now seen corresponding path program 1 times [2025-03-17 11:00:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899068187] [2025-03-17 11:00:39,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:39,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-17 11:00:39,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-17 11:00:39,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:39,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:39,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:39,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899068187] [2025-03-17 11:00:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899068187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:39,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471831302] [2025-03-17 11:00:39,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:39,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:39,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:39,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:39,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 586 [2025-03-17 11:00:39,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 539 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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-17 11:00:39,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:39,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 586 [2025-03-17 11:00:39,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:39,295 INFO L124 PetriNetUnfolderBase]: 23/796 cut-off events. [2025-03-17 11:00:39,295 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2025-03-17 11:00:39,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 796 events. 23/796 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2033 event pairs, 0 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 644. Up to 24 conditions per place. [2025-03-17 11:00:39,300 INFO L140 encePairwiseOnDemand]: 584/586 looper letters, 7 selfloop transitions, 1 changer transitions 1/539 dead transitions. [2025-03-17 11:00:39,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 539 transitions, 1121 flow [2025-03-17 11:00:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1714 transitions. [2025-03-17 11:00:39,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9749715585893061 [2025-03-17 11:00:39,303 INFO L175 Difference]: Start difference. First operand has 542 places, 539 transitions, 1102 flow. Second operand 3 states and 1714 transitions. [2025-03-17 11:00:39,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 539 transitions, 1121 flow [2025-03-17 11:00:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 539 transitions, 1120 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:39,316 INFO L231 Difference]: Finished difference. Result has 542 places, 538 transitions, 1101 flow [2025-03-17 11:00:39,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1101, PETRI_PLACES=542, PETRI_TRANSITIONS=538} [2025-03-17 11:00:39,317 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -32 predicate places. [2025-03-17 11:00:39,318 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 538 transitions, 1101 flow [2025-03-17 11:00:39,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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-17 11:00:39,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:39,318 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-17 11:00:39,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:00:39,319 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-17 11:00:39,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash -354595932, now seen corresponding path program 1 times [2025-03-17 11:00:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224325716] [2025-03-17 11:00:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:39,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-17 11:00:39,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-17 11:00:39,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:39,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224325716] [2025-03-17 11:00:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224325716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:40,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:40,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:00:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820521341] [2025-03-17 11:00:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:40,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:00:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:40,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:00:40,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:00:41,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 586 [2025-03-17 11:00:41,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 538 transitions, 1101 flow. Second operand has 10 states, 10 states have (on average 524.0) internal successors, (5240), 10 states have internal predecessors, (5240), 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-17 11:00:41,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:41,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 586 [2025-03-17 11:00:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:41,808 INFO L124 PetriNetUnfolderBase]: 303/2833 cut-off events. [2025-03-17 11:00:41,809 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:00:41,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 2833 events. 303/2833 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 21633 event pairs, 47 based on Foata normal form. 0/2687 useless extension candidates. Maximal degree in co-relation 3294. Up to 323 conditions per place. [2025-03-17 11:00:41,822 INFO L140 encePairwiseOnDemand]: 552/586 looper letters, 67 selfloop transitions, 45 changer transitions 6/596 dead transitions. [2025-03-17 11:00:41,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 596 transitions, 1459 flow [2025-03-17 11:00:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:00:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:00:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5336 transitions. [2025-03-17 11:00:41,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910580204778157 [2025-03-17 11:00:41,829 INFO L175 Difference]: Start difference. First operand has 542 places, 538 transitions, 1101 flow. Second operand 10 states and 5336 transitions. [2025-03-17 11:00:41,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 596 transitions, 1459 flow [2025-03-17 11:00:41,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 596 transitions, 1458 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:41,837 INFO L231 Difference]: Finished difference. Result has 559 places, 575 transitions, 1417 flow [2025-03-17 11:00:41,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1417, PETRI_PLACES=559, PETRI_TRANSITIONS=575} [2025-03-17 11:00:41,839 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, -15 predicate places. [2025-03-17 11:00:41,839 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 575 transitions, 1417 flow [2025-03-17 11:00:41,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 524.0) internal successors, (5240), 10 states have internal predecessors, (5240), 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-17 11:00:41,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:00:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:00:41,840 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-17 11:00:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1832115677, now seen corresponding path program 1 times [2025-03-17 11:00:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:41,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995600911] [2025-03-17 11:00:41,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:41,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-17 11:00:41,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-17 11:00:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995600911] [2025-03-17 11:00:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995600911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-17 11:00:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008792286] [2025-03-17 11:00:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:00:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:48,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:00:48,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:00:51,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 586 [2025-03-17 11:00:51,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 575 transitions, 1417 flow. Second operand has 25 states, 25 states have (on average 498.92) internal successors, (12473), 25 states have internal predecessors, (12473), 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-17 11:00:51,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:51,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 586 [2025-03-17 11:00:51,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:53,715 INFO L124 PetriNetUnfolderBase]: 1152/5558 cut-off events. [2025-03-17 11:00:53,716 INFO L125 PetriNetUnfolderBase]: For 1026/1118 co-relation queries the response was YES. [2025-03-17 11:00:53,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9620 conditions, 5558 events. 1152/5558 cut-off events. For 1026/1118 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 47976 event pairs, 54 based on Foata normal form. 24/5352 useless extension candidates. Maximal degree in co-relation 9387. Up to 980 conditions per place. [2025-03-17 11:00:53,749 INFO L140 encePairwiseOnDemand]: 541/586 looper letters, 278 selfloop transitions, 99 changer transitions 0/832 dead transitions. [2025-03-17 11:00:53,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 832 transitions, 3331 flow [2025-03-17 11:00:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 11:00:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 11:00:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 12173 transitions. [2025-03-17 11:00:53,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655432309442548 [2025-03-17 11:00:53,755 INFO L175 Difference]: Start difference. First operand has 559 places, 575 transitions, 1417 flow. Second operand 24 states and 12173 transitions. [2025-03-17 11:00:53,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 832 transitions, 3331 flow [2025-03-17 11:00:53,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 832 transitions, 3331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:00:53,770 INFO L231 Difference]: Finished difference. Result has 589 places, 659 transitions, 2295 flow [2025-03-17 11:00:53,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2295, PETRI_PLACES=589, PETRI_TRANSITIONS=659} [2025-03-17 11:00:53,770 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, 15 predicate places. [2025-03-17 11:00:53,770 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 659 transitions, 2295 flow [2025-03-17 11:00:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 498.92) internal successors, (12473), 25 states have internal predecessors, (12473), 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-17 11:00:53,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:53,773 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-17 11:00:53,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:00:53,773 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-17 11:00:53,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1929726405, now seen corresponding path program 2 times [2025-03-17 11:00:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980929146] [2025-03-17 11:00:53,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:00:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:53,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 356 statements into 2 equivalence classes. [2025-03-17 11:00:53,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 353 of 356 statements. [2025-03-17 11:00:53,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:00:53,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:00:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:59,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980929146] [2025-03-17 11:00:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980929146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-17 11:00:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520681454] [2025-03-17 11:00:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:00:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:59,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:00:59,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:01:01,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 586 [2025-03-17 11:01:02,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 659 transitions, 2295 flow. Second operand has 25 states, 25 states have (on average 498.92) internal successors, (12473), 25 states have internal predecessors, (12473), 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-17 11:01:02,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:01:02,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 586 [2025-03-17 11:01:02,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:01:04,117 INFO L124 PetriNetUnfolderBase]: 1452/7318 cut-off events. [2025-03-17 11:01:04,117 INFO L125 PetriNetUnfolderBase]: For 5049/5190 co-relation queries the response was YES. [2025-03-17 11:01:04,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14868 conditions, 7318 events. 1452/7318 cut-off events. For 5049/5190 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 69051 event pairs, 99 based on Foata normal form. 96/7088 useless extension candidates. Maximal degree in co-relation 14608. Up to 696 conditions per place. [2025-03-17 11:01:04,162 INFO L140 encePairwiseOnDemand]: 541/586 looper letters, 362 selfloop transitions, 157 changer transitions 0/974 dead transitions. [2025-03-17 11:01:04,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 974 transitions, 5295 flow [2025-03-17 11:01:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:01:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-17 11:01:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 12702 transitions. [2025-03-17 11:01:04,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8670307167235495 [2025-03-17 11:01:04,168 INFO L175 Difference]: Start difference. First operand has 589 places, 659 transitions, 2295 flow. Second operand 25 states and 12702 transitions. [2025-03-17 11:01:04,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 974 transitions, 5295 flow [2025-03-17 11:01:04,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 974 transitions, 5280 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:01:04,197 INFO L231 Difference]: Finished difference. Result has 621 places, 764 transitions, 3841 flow [2025-03-17 11:01:04,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3841, PETRI_PLACES=621, PETRI_TRANSITIONS=764} [2025-03-17 11:01:04,200 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, 47 predicate places. [2025-03-17 11:01:04,200 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 764 transitions, 3841 flow [2025-03-17 11:01:04,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 498.92) internal successors, (12473), 25 states have internal predecessors, (12473), 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-17 11:01:04,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:01:04,203 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-17 11:01:04,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:01:04,204 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-17 11:01:04,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:01:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash -321513383, now seen corresponding path program 3 times [2025-03-17 11:01:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:01:04,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731420234] [2025-03-17 11:01:04,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:01:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:01:04,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 356 statements into 2 equivalence classes. [2025-03-17 11:01:04,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 353 of 356 statements. [2025-03-17 11:01:04,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:01:04,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:01:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:01:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731420234] [2025-03-17 11:01:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731420234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:01:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:01:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-17 11:01:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495347684] [2025-03-17 11:01:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:01:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:01:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:01:09,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:01:09,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:01:11,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 586 [2025-03-17 11:01:11,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 764 transitions, 3841 flow. Second operand has 25 states, 25 states have (on average 498.92) internal successors, (12473), 25 states have internal predecessors, (12473), 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-17 11:01:11,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:01:11,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 586 [2025-03-17 11:01:11,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:01:14,124 INFO L124 PetriNetUnfolderBase]: 1583/7652 cut-off events. [2025-03-17 11:01:14,124 INFO L125 PetriNetUnfolderBase]: For 14035/14519 co-relation queries the response was YES. [2025-03-17 11:01:14,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19111 conditions, 7652 events. 1583/7652 cut-off events. For 14035/14519 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 72074 event pairs, 89 based on Foata normal form. 258/7569 useless extension candidates. Maximal degree in co-relation 18824. Up to 1135 conditions per place. [2025-03-17 11:01:14,204 INFO L140 encePairwiseOnDemand]: 534/586 looper letters, 339 selfloop transitions, 187 changer transitions 0/981 dead transitions. [2025-03-17 11:01:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 981 transitions, 6658 flow [2025-03-17 11:01:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:01:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 11:01:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 11162 transitions. [2025-03-17 11:01:14,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8658082531802669 [2025-03-17 11:01:14,210 INFO L175 Difference]: Start difference. First operand has 621 places, 764 transitions, 3841 flow. Second operand 22 states and 11162 transitions. [2025-03-17 11:01:14,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 981 transitions, 6658 flow [2025-03-17 11:01:14,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 981 transitions, 6513 flow, removed 65 selfloop flow, removed 8 redundant places. [2025-03-17 11:01:14,274 INFO L231 Difference]: Finished difference. Result has 645 places, 811 transitions, 4962 flow [2025-03-17 11:01:14,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=586, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4962, PETRI_PLACES=645, PETRI_TRANSITIONS=811} [2025-03-17 11:01:14,276 INFO L279 CegarLoopForPetriNet]: 574 programPoint places, 71 predicate places. [2025-03-17 11:01:14,276 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 811 transitions, 4962 flow [2025-03-17 11:01:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 498.92) internal successors, (12473), 25 states have internal predecessors, (12473), 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-17 11:01:14,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:01:14,278 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-17 11:01:14,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:01:14,278 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-17 11:01:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:01:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1458706919, now seen corresponding path program 4 times [2025-03-17 11:01:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:01:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752532628] [2025-03-17 11:01:14,280 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:01:14,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:01:14,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 356 statements into 2 equivalence classes. [2025-03-17 11:01:14,371 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 356 of 356 statements. [2025-03-17 11:01:14,372 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:01:14,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:01:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:01:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752532628] [2025-03-17 11:01:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752532628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:01:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435937537] [2025-03-17 11:01:18,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:01:18,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:01:18,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:01:18,910 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-17 11:01:18,911 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-17 11:01:19,119 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 356 statements into 2 equivalence classes. [2025-03-17 11:01:19,501 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 356 of 356 statements. [2025-03-17 11:01:19,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:01:19,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:19,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-17 11:01:19,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:01:19,761 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:01:19,762 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-17 11:01:19,813 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:01:19,814 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-17 11:01:19,858 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:01:19,858 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 17 treesize of output 21 [2025-03-17 11:01:19,984 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 11:01:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-17 11:01:20,177 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:20,307 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:20,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:20,426 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-17 11:01:20,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-17 11:01:20,601 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:20,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:20,741 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:20,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:20,860 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:20,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:20,984 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:20,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:21,109 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:21,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:21,221 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:21,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:21,349 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:21,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:21,481 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:21,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:21,594 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:21,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:21,699 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-17 11:01:21,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 11:01:22,450 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-17 11:01:22,488 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-17 11:01:22,524 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-17 11:01:22,566 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-17 11:01:22,611 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-17 11:01:22,676 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-17 11:01:22,746 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-17 11:01:22,807 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-17 11:01:22,878 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-17 11:01:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:01:22,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:01:22,970 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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_~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)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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_~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)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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_~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_~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_~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))) is different from false [2025-03-17 11:01:22,989 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_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.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_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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|))))))) is different from false [2025-03-17 11:01:23,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ 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|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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|)))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.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_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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)) (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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|))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0))))) is different from false [2025-03-17 11:01:23,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 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 (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.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_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.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_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~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 .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0))))) is different from false [2025-03-17 11:01:39,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:39,504 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-17 11:01:39,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:39,512 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-17 11:01:39,516 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-17 11:01:39,521 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,521 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-17 11:01:39,526 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,526 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-17 11:01:39,531 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,531 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-17 11:01:39,535 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,535 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-17 11:01:39,540 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,540 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-17 11:01:39,544 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,544 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-17 11:01:39,549 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:39,549 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