./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e477555710806f589e2df4355d107ec5094f895ba0eeca2a28a6fd25b09e9340 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:27:26,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:27:26,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:27:26,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:27:26,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:27:26,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:27:26,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:27:26,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:27:26,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:27:26,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:27:26,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:27:26,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:27:26,328 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:27:26,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:27:26,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:27:26,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:27:26,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:26,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:27:26,330 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> e477555710806f589e2df4355d107ec5094f895ba0eeca2a28a6fd25b09e9340 [2025-02-08 05:27:26,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:27:26,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:27:26,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:27:26,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:27:26,518 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:27:26,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-02-08 05:27:27,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19bdfb5b2/1144ba7ebc0f4010b1dfaab042788832/FLAG781c53a07 [2025-02-08 05:27:28,257 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:27:28,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-02-08 05:27:28,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19bdfb5b2/1144ba7ebc0f4010b1dfaab042788832/FLAG781c53a07 [2025-02-08 05:27:28,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19bdfb5b2/1144ba7ebc0f4010b1dfaab042788832 [2025-02-08 05:27:28,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:27:28,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:27:28,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:28,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:27:28,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:27:28,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:28" (1/1) ... [2025-02-08 05:27:28,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:28, skipping insertion in model container [2025-02-08 05:27:28,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:28" (1/1) ... [2025-02-08 05:27:28,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:27:31,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:31,806 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:27:31,949 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-02-08 05:27:31,950 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-02-08 05:27:31,950 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-02-08 05:27:31,951 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-02-08 05:27:32,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-02-08 05:27:32,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:32,398 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:27:32,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32 WrapperNode [2025-02-08 05:27:32,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:32,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:32,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:27:32,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:27:32,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,525 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 522 [2025-02-08 05:27:32,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:32,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:27:32,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:27:32,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:27:32,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:27:32,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:27:32,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:27:32,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:27:32,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:32,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:32,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:27:32,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:27:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:27:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:27:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-02-08 05:27:32,598 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-02-08 05:27:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:27:32,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-02-08 05:27:32,599 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-02-08 05:27:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:27:32,600 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:27:32,890 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:27:32,891 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:27:33,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-02-08 05:27:33,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-3: assume { :end_inline___get_user } true;assume -2147483648 <= write_nvram_#t~ret1333#1 && write_nvram_#t~ret1333#1 <= 2147483647; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-2: havoc write_nvram_#t~ret1333#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-1: havoc write_nvram_#t~ret1333#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741: assume 0 != write_nvram_#t~ret1333#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741: assume !(0 != write_nvram_#t~ret1333#1); [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-6: write_nvram_#t~ret1333#1 := __get_user_#res#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-5: havoc __get_user_#t~nondet1282#1, __get_user_~arg0#1, __get_user_~arg1#1.base, __get_user_~arg1#1.offset; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-4: havoc __get_user_#in~arg0#1, __get_user_#in~arg1#1.base, __get_user_#in~arg1#1.offset; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1282#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6742-1: write_nvram_#res#1 := -14; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-1: havoc nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743: assume { :end_inline_nvram_write_byte } true;write_nvram_#t~pre1334#1 := 1 + write_nvram_~i~2#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-4: assume { :begin_inline_nvram_write_byte } true;nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1 := write_nvram_~c~4#1, (if write_nvram_~i~2#1 % 4294967296 % 4294967296 <= 2147483647 then write_nvram_~i~2#1 % 4294967296 % 4294967296 else write_nvram_~i~2#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-3: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-2: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-2: write_nvram_~count#1 := write_nvram_~count#1 - 1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-1: havoc write_nvram_#t~pre1336#1; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-6: write_nvram_#t~pre1335#1.base, write_nvram_#t~pre1335#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-5: write_nvram_~p~2#1.base, write_nvram_~p~2#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-4: havoc write_nvram_#t~pre1335#1.base, write_nvram_#t~pre1335#1.offset; [2025-02-08 05:27:33,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641-1: nvram_write_byte_~arg0#1 := nvram_write_byte_#in~arg0#1; [2025-02-08 05:27:33,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-3: write_nvram_#t~pre1336#1 := write_nvram_~count#1 - 1; [2025-02-08 05:27:33,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641: nvram_write_byte_~arg1#1 := nvram_write_byte_#in~arg1#1; [2025-02-08 05:27:33,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-8: write_nvram_~i~2#1 := 1 + write_nvram_~i~2#1; [2025-02-08 05:27:33,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-7: havoc write_nvram_#t~pre1334#1; [2025-02-08 05:27:33,332 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-02-08 05:27:33,332 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-02-08 05:27:33,333 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-02-08 05:27:33,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6753: assume { :end_inline_nvram_sync } true; [2025-02-08 05:27:33,395 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:27:33,395 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:27:33,444 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:27:33,444 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:27:33,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:33 BoogieIcfgContainer [2025-02-08 05:27:33,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:27:33,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:27:33,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:27:33,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:27:33,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:27:28" (1/3) ... [2025-02-08 05:27:33,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62363e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:33, skipping insertion in model container [2025-02-08 05:27:33,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32" (2/3) ... [2025-02-08 05:27:33,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62363e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:33, skipping insertion in model container [2025-02-08 05:27:33,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:33" (3/3) ... [2025-02-08 05:27:33,452 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-02-08 05:27:33,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:27:33,464 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i that has 3 procedures, 554 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-02-08 05:27:33,464 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:27:33,569 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:27:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 560 places, 560 transitions, 1134 flow [2025-02-08 05:27:33,727 INFO L124 PetriNetUnfolderBase]: 7/558 cut-off events. [2025-02-08 05:27:33,729 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:33,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 558 events. 7/558 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 340 event pairs, 0 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 490. Up to 2 conditions per place. [2025-02-08 05:27:33,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 560 places, 560 transitions, 1134 flow [2025-02-08 05:27:33,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 553 places, 553 transitions, 1115 flow [2025-02-08 05:27:33,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:33,754 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;@7577fa67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:33,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-02-08 05:27:33,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:33,771 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-02-08 05:27:33,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:33,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:33,772 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-02-08 05:27:33,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:33,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1936546943, now seen corresponding path program 1 times [2025-02-08 05:27:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256184051] [2025-02-08 05:27:33,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:33,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:27:33,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:27:33,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:33,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256184051] [2025-02-08 05:27:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256184051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:34,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884281868] [2025-02-08 05:27:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:34,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:34,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:34,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:34,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 553 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:34,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:34,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:34,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:34,326 INFO L124 PetriNetUnfolderBase]: 5/584 cut-off events. [2025-02-08 05:27:34,326 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-02-08 05:27:34,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 584 events. 5/584 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 333 event pairs, 2 based on Foata normal form. 4/538 useless extension candidates. Maximal degree in co-relation 488. Up to 13 conditions per place. [2025-02-08 05:27:34,330 INFO L140 encePairwiseOnDemand]: 550/560 looper letters, 8 selfloop transitions, 2 changer transitions 1/543 dead transitions. [2025-02-08 05:27:34,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 543 transitions, 1115 flow [2025-02-08 05:27:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1635 transitions. [2025-02-08 05:27:34,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732142857142857 [2025-02-08 05:27:34,344 INFO L175 Difference]: Start difference. First operand has 553 places, 553 transitions, 1115 flow. Second operand 3 states and 1635 transitions. [2025-02-08 05:27:34,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 543 transitions, 1115 flow [2025-02-08 05:27:34,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 543 transitions, 1110 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:34,356 INFO L231 Difference]: Finished difference. Result has 546 places, 542 transitions, 1092 flow [2025-02-08 05:27:34,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=544, 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=1092, PETRI_PLACES=546, PETRI_TRANSITIONS=542} [2025-02-08 05:27:34,360 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -7 predicate places. [2025-02-08 05:27:34,361 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 542 transitions, 1092 flow [2025-02-08 05:27:34,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:34,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:34,362 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-02-08 05:27:34,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:27:34,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 166351168, now seen corresponding path program 1 times [2025-02-08 05:27:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498627471] [2025-02-08 05:27:34,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:34,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:27:34,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:27:34,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:34,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:34,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:34,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498627471] [2025-02-08 05:27:34,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498627471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:34,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:34,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:34,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611370492] [2025-02-08 05:27:34,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:34,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:34,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:34,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 560 [2025-02-08 05:27:34,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 542 transitions, 1092 flow. Second operand has 3 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 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-02-08 05:27:34,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:34,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 560 [2025-02-08 05:27:34,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:34,653 INFO L124 PetriNetUnfolderBase]: 14/962 cut-off events. [2025-02-08 05:27:34,654 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:27:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 962 events. 14/962 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2216 event pairs, 5 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 898. Up to 20 conditions per place. [2025-02-08 05:27:34,659 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 9 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-02-08 05:27:34,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 541 transitions, 1112 flow [2025-02-08 05:27:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1626 transitions. [2025-02-08 05:27:34,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-02-08 05:27:34,662 INFO L175 Difference]: Start difference. First operand has 546 places, 542 transitions, 1092 flow. Second operand 3 states and 1626 transitions. [2025-02-08 05:27:34,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 541 transitions, 1112 flow [2025-02-08 05:27:34,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 541 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:34,670 INFO L231 Difference]: Finished difference. Result has 544 places, 541 transitions, 1090 flow [2025-02-08 05:27:34,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=544, PETRI_TRANSITIONS=541} [2025-02-08 05:27:34,671 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -9 predicate places. [2025-02-08 05:27:34,671 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 541 transitions, 1090 flow [2025-02-08 05:27:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 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-02-08 05:27:34,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:34,672 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-02-08 05:27:34,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:27:34,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -390433028, now seen corresponding path program 1 times [2025-02-08 05:27:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187994802] [2025-02-08 05:27:34,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:34,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:27:34,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:27:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187994802] [2025-02-08 05:27:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187994802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117280506] [2025-02-08 05:27:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:34,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:34,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:34,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:34,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:34,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 541 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:34,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:34,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:34,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:34,911 INFO L124 PetriNetUnfolderBase]: 5/581 cut-off events. [2025-02-08 05:27:34,911 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:34,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 581 events. 5/581 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 329 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 501. Up to 13 conditions per place. [2025-02-08 05:27:34,914 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-02-08 05:27:34,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 540 transitions, 1108 flow [2025-02-08 05:27:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:34,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:34,917 INFO L175 Difference]: Start difference. First operand has 544 places, 541 transitions, 1090 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:34,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 540 transitions, 1108 flow [2025-02-08 05:27:34,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 540 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:34,923 INFO L231 Difference]: Finished difference. Result has 543 places, 540 transitions, 1088 flow [2025-02-08 05:27:34,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1088, PETRI_PLACES=543, PETRI_TRANSITIONS=540} [2025-02-08 05:27:34,924 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -10 predicate places. [2025-02-08 05:27:34,925 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 540 transitions, 1088 flow [2025-02-08 05:27:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:34,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:34,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] [2025-02-08 05:27:34,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:27:34,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:34,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1282875079, now seen corresponding path program 1 times [2025-02-08 05:27:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:34,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665049364] [2025-02-08 05:27:34,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:34,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:27:34,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:27:34,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:34,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:34,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665049364] [2025-02-08 05:27:34,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665049364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:34,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:34,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215584322] [2025-02-08 05:27:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:34,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:34,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:34,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:35,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 540 transitions, 1088 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:35,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:35,096 INFO L124 PetriNetUnfolderBase]: 5/580 cut-off events. [2025-02-08 05:27:35,096 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:35,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 580 events. 5/580 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 326 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 493. Up to 13 conditions per place. [2025-02-08 05:27:35,098 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/539 dead transitions. [2025-02-08 05:27:35,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 539 transitions, 1106 flow [2025-02-08 05:27:35,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:35,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:35,101 INFO L175 Difference]: Start difference. First operand has 543 places, 540 transitions, 1088 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:35,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 539 transitions, 1106 flow [2025-02-08 05:27:35,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 539 transitions, 1102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:35,107 INFO L231 Difference]: Finished difference. Result has 542 places, 539 transitions, 1086 flow [2025-02-08 05:27:35,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1086, PETRI_PLACES=542, PETRI_TRANSITIONS=539} [2025-02-08 05:27:35,108 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -11 predicate places. [2025-02-08 05:27:35,109 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 539 transitions, 1086 flow [2025-02-08 05:27:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:35,110 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-02-08 05:27:35,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:27:35,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:35,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 705142150, now seen corresponding path program 1 times [2025-02-08 05:27:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308968876] [2025-02-08 05:27:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:27:35,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:27:35,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:35,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308968876] [2025-02-08 05:27:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308968876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206299518] [2025-02-08 05:27:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:35,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:35,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 539 transitions, 1086 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:35,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:35,260 INFO L124 PetriNetUnfolderBase]: 5/579 cut-off events. [2025-02-08 05:27:35,261 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:35,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 579 events. 5/579 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 323 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 485. Up to 13 conditions per place. [2025-02-08 05:27:35,263 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/538 dead transitions. [2025-02-08 05:27:35,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 538 transitions, 1104 flow [2025-02-08 05:27:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:35,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:35,266 INFO L175 Difference]: Start difference. First operand has 542 places, 539 transitions, 1086 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:35,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 538 transitions, 1104 flow [2025-02-08 05:27:35,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 538 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:35,272 INFO L231 Difference]: Finished difference. Result has 541 places, 538 transitions, 1084 flow [2025-02-08 05:27:35,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=541, PETRI_TRANSITIONS=538} [2025-02-08 05:27:35,273 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -12 predicate places. [2025-02-08 05:27:35,273 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 538 transitions, 1084 flow [2025-02-08 05:27:35,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:35,274 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-02-08 05:27:35,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:27:35,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:35,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash -739036234, now seen corresponding path program 1 times [2025-02-08 05:27:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416921991] [2025-02-08 05:27:35,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:35,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:27:35,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:27:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:35,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416921991] [2025-02-08 05:27:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416921991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960391651] [2025-02-08 05:27:35,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:35,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 560 [2025-02-08 05:27:35,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 538 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 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-02-08 05:27:35,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 560 [2025-02-08 05:27:35,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:35,415 INFO L124 PetriNetUnfolderBase]: 6/598 cut-off events. [2025-02-08 05:27:35,416 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:27:35,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 598 events. 6/598 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 374 event pairs, 3 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 500. Up to 16 conditions per place. [2025-02-08 05:27:35,418 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 9 selfloop transitions, 2 changer transitions 0/537 dead transitions. [2025-02-08 05:27:35,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 537 transitions, 1104 flow [2025-02-08 05:27:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1626 transitions. [2025-02-08 05:27:35,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-02-08 05:27:35,422 INFO L175 Difference]: Start difference. First operand has 541 places, 538 transitions, 1084 flow. Second operand 3 states and 1626 transitions. [2025-02-08 05:27:35,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 537 transitions, 1104 flow [2025-02-08 05:27:35,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 537 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:35,429 INFO L231 Difference]: Finished difference. Result has 540 places, 537 transitions, 1082 flow [2025-02-08 05:27:35,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=540, PETRI_TRANSITIONS=537} [2025-02-08 05:27:35,430 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -13 predicate places. [2025-02-08 05:27:35,430 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 537 transitions, 1082 flow [2025-02-08 05:27:35,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 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-02-08 05:27:35,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:35,431 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-02-08 05:27:35,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:27:35,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:35,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1215124342, now seen corresponding path program 1 times [2025-02-08 05:27:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:35,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798498640] [2025-02-08 05:27:35,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:35,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:27:35,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:27:35,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798498640] [2025-02-08 05:27:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798498640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:35,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899053019] [2025-02-08 05:27:35,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:35,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:35,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 537 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:35,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:35,588 INFO L124 PetriNetUnfolderBase]: 5/577 cut-off events. [2025-02-08 05:27:35,588 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:35,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 577 events. 5/577 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 316 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 469. Up to 13 conditions per place. [2025-02-08 05:27:35,590 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/536 dead transitions. [2025-02-08 05:27:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 536 transitions, 1100 flow [2025-02-08 05:27:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:35,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:35,593 INFO L175 Difference]: Start difference. First operand has 540 places, 537 transitions, 1082 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:35,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 536 transitions, 1100 flow [2025-02-08 05:27:35,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 536 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:35,598 INFO L231 Difference]: Finished difference. Result has 539 places, 536 transitions, 1080 flow [2025-02-08 05:27:35,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1080, PETRI_PLACES=539, PETRI_TRANSITIONS=536} [2025-02-08 05:27:35,600 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -14 predicate places. [2025-02-08 05:27:35,600 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 536 transitions, 1080 flow [2025-02-08 05:27:35,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:35,601 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-02-08 05:27:35,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:27:35,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -245752301, now seen corresponding path program 1 times [2025-02-08 05:27:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611417805] [2025-02-08 05:27:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:35,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:27:35,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:27:35,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:35,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:35,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611417805] [2025-02-08 05:27:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611417805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390943017] [2025-02-08 05:27:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:35,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:35,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 536 transitions, 1080 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:35,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:35,737 INFO L124 PetriNetUnfolderBase]: 5/576 cut-off events. [2025-02-08 05:27:35,738 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:35,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 576 events. 5/576 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 312 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 461. Up to 13 conditions per place. [2025-02-08 05:27:35,740 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2025-02-08 05:27:35,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 535 transitions, 1098 flow [2025-02-08 05:27:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:35,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:35,744 INFO L175 Difference]: Start difference. First operand has 539 places, 536 transitions, 1080 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:35,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 535 transitions, 1098 flow [2025-02-08 05:27:35,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 535 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:35,750 INFO L231 Difference]: Finished difference. Result has 538 places, 535 transitions, 1078 flow [2025-02-08 05:27:35,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1078, PETRI_PLACES=538, PETRI_TRANSITIONS=535} [2025-02-08 05:27:35,751 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -15 predicate places. [2025-02-08 05:27:35,751 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 535 transitions, 1078 flow [2025-02-08 05:27:35,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:35,752 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-02-08 05:27:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:27:35,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:35,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:35,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1342032311, now seen corresponding path program 1 times [2025-02-08 05:27:35,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:35,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073187792] [2025-02-08 05:27:35,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:35,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:35,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:27:35,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:27:35,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:35,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:35,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073187792] [2025-02-08 05:27:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073187792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074408071] [2025-02-08 05:27:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:35,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:35,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:35,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 535 transitions, 1078 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:35,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:35,890 INFO L124 PetriNetUnfolderBase]: 5/575 cut-off events. [2025-02-08 05:27:35,890 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:35,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 575 events. 5/575 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 310 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 453. Up to 13 conditions per place. [2025-02-08 05:27:35,892 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/534 dead transitions. [2025-02-08 05:27:35,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 534 transitions, 1096 flow [2025-02-08 05:27:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:35,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:35,895 INFO L175 Difference]: Start difference. First operand has 538 places, 535 transitions, 1078 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:35,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 534 transitions, 1096 flow [2025-02-08 05:27:35,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 534 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:35,901 INFO L231 Difference]: Finished difference. Result has 537 places, 534 transitions, 1076 flow [2025-02-08 05:27:35,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=537, PETRI_TRANSITIONS=534} [2025-02-08 05:27:35,902 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -16 predicate places. [2025-02-08 05:27:35,902 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 534 transitions, 1076 flow [2025-02-08 05:27:35,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:35,903 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-02-08 05:27:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:27:35,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1572576089, now seen corresponding path program 1 times [2025-02-08 05:27:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902774545] [2025-02-08 05:27:35,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:35,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:27:35,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:27:35,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:35,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:35,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:35,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902774545] [2025-02-08 05:27:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902774545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:35,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:35,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:35,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801259172] [2025-02-08 05:27:35,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:35,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:35,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:35,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:35,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:35,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 534 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:35,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:35,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:35,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,047 INFO L124 PetriNetUnfolderBase]: 5/574 cut-off events. [2025-02-08 05:27:36,047 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:36,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 574 events. 5/574 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 308 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 445. Up to 13 conditions per place. [2025-02-08 05:27:36,049 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-02-08 05:27:36,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 533 transitions, 1094 flow [2025-02-08 05:27:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:36,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:36,053 INFO L175 Difference]: Start difference. First operand has 537 places, 534 transitions, 1076 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:36,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 533 transitions, 1094 flow [2025-02-08 05:27:36,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 533 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,060 INFO L231 Difference]: Finished difference. Result has 536 places, 533 transitions, 1074 flow [2025-02-08 05:27:36,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=536, PETRI_TRANSITIONS=533} [2025-02-08 05:27:36,061 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -17 predicate places. [2025-02-08 05:27:36,061 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 533 transitions, 1074 flow [2025-02-08 05:27:36,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,062 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-02-08 05:27:36,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:27:36,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:36,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1434563711, now seen corresponding path program 1 times [2025-02-08 05:27:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786801332] [2025-02-08 05:27:36,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:27:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:27:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:36,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786801332] [2025-02-08 05:27:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786801332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:36,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503927005] [2025-02-08 05:27:36,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:36,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:36,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:36,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:36,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 533 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:36,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,239 INFO L124 PetriNetUnfolderBase]: 5/573 cut-off events. [2025-02-08 05:27:36,239 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:36,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 573 events. 5/573 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 306 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 437. Up to 13 conditions per place. [2025-02-08 05:27:36,241 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-02-08 05:27:36,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1092 flow [2025-02-08 05:27:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:36,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:36,246 INFO L175 Difference]: Start difference. First operand has 536 places, 533 transitions, 1074 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:36,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1092 flow [2025-02-08 05:27:36,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 532 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,254 INFO L231 Difference]: Finished difference. Result has 535 places, 532 transitions, 1072 flow [2025-02-08 05:27:36,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=535, PETRI_TRANSITIONS=532} [2025-02-08 05:27:36,255 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -18 predicate places. [2025-02-08 05:27:36,255 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 532 transitions, 1072 flow [2025-02-08 05:27:36,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,256 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-02-08 05:27:36,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:27:36,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:36,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -394345694, now seen corresponding path program 1 times [2025-02-08 05:27:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144346991] [2025-02-08 05:27:36,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:27:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:27:36,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:36,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144346991] [2025-02-08 05:27:36,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144346991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:36,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413274357] [2025-02-08 05:27:36,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:36,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:36,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 560 [2025-02-08 05:27:36,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 532 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 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-02-08 05:27:36,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 560 [2025-02-08 05:27:36,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,440 INFO L124 PetriNetUnfolderBase]: 14/943 cut-off events. [2025-02-08 05:27:36,441 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:27:36,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 943 events. 14/943 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2159 event pairs, 5 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 809. Up to 20 conditions per place. [2025-02-08 05:27:36,444 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 9 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-02-08 05:27:36,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 531 transitions, 1092 flow [2025-02-08 05:27:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1626 transitions. [2025-02-08 05:27:36,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-02-08 05:27:36,447 INFO L175 Difference]: Start difference. First operand has 535 places, 532 transitions, 1072 flow. Second operand 3 states and 1626 transitions. [2025-02-08 05:27:36,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 531 transitions, 1092 flow [2025-02-08 05:27:36,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 531 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,453 INFO L231 Difference]: Finished difference. Result has 534 places, 531 transitions, 1070 flow [2025-02-08 05:27:36,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=534, PETRI_TRANSITIONS=531} [2025-02-08 05:27:36,454 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -19 predicate places. [2025-02-08 05:27:36,454 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 531 transitions, 1070 flow [2025-02-08 05:27:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 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-02-08 05:27:36,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,455 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-02-08 05:27:36,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:27:36,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:36,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash -142184582, now seen corresponding path program 1 times [2025-02-08 05:27:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497024040] [2025-02-08 05:27:36,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:27:36,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:27:36,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497024040] [2025-02-08 05:27:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497024040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765161366] [2025-02-08 05:27:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:36,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:36,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:36,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 531 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:36,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,582 INFO L124 PetriNetUnfolderBase]: 5/571 cut-off events. [2025-02-08 05:27:36,582 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:36,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 571 events. 5/571 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 302 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 421. Up to 13 conditions per place. [2025-02-08 05:27:36,584 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-02-08 05:27:36,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 530 transitions, 1088 flow [2025-02-08 05:27:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:36,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:36,587 INFO L175 Difference]: Start difference. First operand has 534 places, 531 transitions, 1070 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:36,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 530 transitions, 1088 flow [2025-02-08 05:27:36,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 530 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,593 INFO L231 Difference]: Finished difference. Result has 533 places, 530 transitions, 1068 flow [2025-02-08 05:27:36,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=533, PETRI_TRANSITIONS=530} [2025-02-08 05:27:36,594 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -20 predicate places. [2025-02-08 05:27:36,594 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 530 transitions, 1068 flow [2025-02-08 05:27:36,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,595 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-02-08 05:27:36,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:27:36,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:36,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash -198605748, now seen corresponding path program 1 times [2025-02-08 05:27:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835760540] [2025-02-08 05:27:36,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:27:36,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:27:36,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835760540] [2025-02-08 05:27:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835760540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843316413] [2025-02-08 05:27:36,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:36,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:36,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:36,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 530 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:36,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,730 INFO L124 PetriNetUnfolderBase]: 5/570 cut-off events. [2025-02-08 05:27:36,730 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:36,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 570 events. 5/570 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 299 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 413. Up to 13 conditions per place. [2025-02-08 05:27:36,732 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-02-08 05:27:36,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 529 transitions, 1086 flow [2025-02-08 05:27:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:36,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:36,734 INFO L175 Difference]: Start difference. First operand has 533 places, 530 transitions, 1068 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:36,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 529 transitions, 1086 flow [2025-02-08 05:27:36,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 529 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,740 INFO L231 Difference]: Finished difference. Result has 532 places, 529 transitions, 1066 flow [2025-02-08 05:27:36,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=532, PETRI_TRANSITIONS=529} [2025-02-08 05:27:36,741 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -21 predicate places. [2025-02-08 05:27:36,741 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 529 transitions, 1066 flow [2025-02-08 05:27:36,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,742 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-02-08 05:27:36,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:27:36,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1306580148, now seen corresponding path program 1 times [2025-02-08 05:27:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781419761] [2025-02-08 05:27:36,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:27:36,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:27:36,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781419761] [2025-02-08 05:27:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781419761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845957240] [2025-02-08 05:27:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:36,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:36,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:36,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 529 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:36,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:36,866 INFO L124 PetriNetUnfolderBase]: 5/569 cut-off events. [2025-02-08 05:27:36,866 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:36,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 569 events. 5/569 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 297 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 405. Up to 13 conditions per place. [2025-02-08 05:27:36,868 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-02-08 05:27:36,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 528 transitions, 1084 flow [2025-02-08 05:27:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:36,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:36,871 INFO L175 Difference]: Start difference. First operand has 532 places, 529 transitions, 1066 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:36,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 528 transitions, 1084 flow [2025-02-08 05:27:36,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 528 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:36,877 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1064 flow [2025-02-08 05:27:36,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2025-02-08 05:27:36,878 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -22 predicate places. [2025-02-08 05:27:36,878 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1064 flow [2025-02-08 05:27:36,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:36,879 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-02-08 05:27:36,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:27:36,879 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1021636156, now seen corresponding path program 1 times [2025-02-08 05:27:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354783317] [2025-02-08 05:27:36,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:27:36,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:27:36,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:36,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:36,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:36,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354783317] [2025-02-08 05:27:36,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354783317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:36,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:36,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710392141] [2025-02-08 05:27:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:36,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:36,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:36,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:36,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:36,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:36,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:36,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:36,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:37,007 INFO L124 PetriNetUnfolderBase]: 5/568 cut-off events. [2025-02-08 05:27:37,007 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:37,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 568 events. 5/568 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 293 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 397. Up to 13 conditions per place. [2025-02-08 05:27:37,009 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 8 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-02-08 05:27:37,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 527 transitions, 1082 flow [2025-02-08 05:27:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2025-02-08 05:27:37,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969047619047619 [2025-02-08 05:27:37,012 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1064 flow. Second operand 3 states and 1628 transitions. [2025-02-08 05:27:37,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 527 transitions, 1082 flow [2025-02-08 05:27:37,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 527 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:37,018 INFO L231 Difference]: Finished difference. Result has 530 places, 527 transitions, 1062 flow [2025-02-08 05:27:37,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=530, PETRI_TRANSITIONS=527} [2025-02-08 05:27:37,019 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -23 predicate places. [2025-02-08 05:27:37,019 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 527 transitions, 1062 flow [2025-02-08 05:27:37,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-08 05:27:37,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:37,020 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-02-08 05:27:37,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:27:37,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:37,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1012127606, now seen corresponding path program 1 times [2025-02-08 05:27:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518428459] [2025-02-08 05:27:37,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:37,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:27:37,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:27:37,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518428459] [2025-02-08 05:27:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518428459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942709990] [2025-02-08 05:27:37,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:37,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:37,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:37,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:37,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 560 [2025-02-08 05:27:37,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 527 transitions, 1062 flow. Second operand has 3 states, 3 states have (on average 538.3333333333334) internal successors, (1615), 3 states have internal predecessors, (1615), 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-02-08 05:27:37,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:37,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 560 [2025-02-08 05:27:37,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:37,220 INFO L124 PetriNetUnfolderBase]: 8/632 cut-off events. [2025-02-08 05:27:37,220 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:37,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 632 events. 8/632 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 629 event pairs, 5 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 464. Up to 21 conditions per place. [2025-02-08 05:27:37,223 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2025-02-08 05:27:37,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 526 transitions, 1084 flow [2025-02-08 05:27:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1624 transitions. [2025-02-08 05:27:37,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666666666666667 [2025-02-08 05:27:37,226 INFO L175 Difference]: Start difference. First operand has 530 places, 527 transitions, 1062 flow. Second operand 3 states and 1624 transitions. [2025-02-08 05:27:37,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 526 transitions, 1084 flow [2025-02-08 05:27:37,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 526 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:37,232 INFO L231 Difference]: Finished difference. Result has 529 places, 526 transitions, 1060 flow [2025-02-08 05:27:37,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=529, PETRI_TRANSITIONS=526} [2025-02-08 05:27:37,233 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -24 predicate places. [2025-02-08 05:27:37,233 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 526 transitions, 1060 flow [2025-02-08 05:27:37,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 538.3333333333334) internal successors, (1615), 3 states have internal predecessors, (1615), 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-02-08 05:27:37,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:37,235 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-02-08 05:27:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:27:37,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:37,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1248276383, now seen corresponding path program 1 times [2025-02-08 05:27:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500260697] [2025-02-08 05:27:37,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:37,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 05:27:37,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 05:27:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:37,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:37,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500260697] [2025-02-08 05:27:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500260697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:37,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984533652] [2025-02-08 05:27:37,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:37,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:37,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:37,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:37,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 560 [2025-02-08 05:27:37,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 526 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 540.0) internal successors, (1620), 3 states have internal predecessors, (1620), 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-02-08 05:27:37,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:37,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 560 [2025-02-08 05:27:37,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:37,425 INFO L124 PetriNetUnfolderBase]: 17/977 cut-off events. [2025-02-08 05:27:37,425 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:37,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 977 events. 17/977 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2458 event pairs, 8 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 808. Up to 25 conditions per place. [2025-02-08 05:27:37,429 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 9 selfloop transitions, 1 changer transitions 0/524 dead transitions. [2025-02-08 05:27:37,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 524 transitions, 1076 flow [2025-02-08 05:27:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2025-02-08 05:27:37,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696428571428571 [2025-02-08 05:27:37,433 INFO L175 Difference]: Start difference. First operand has 529 places, 526 transitions, 1060 flow. Second operand 3 states and 1629 transitions. [2025-02-08 05:27:37,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 524 transitions, 1076 flow [2025-02-08 05:27:37,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 524 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:37,439 INFO L231 Difference]: Finished difference. Result has 527 places, 524 transitions, 1054 flow [2025-02-08 05:27:37,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=527, PETRI_TRANSITIONS=524} [2025-02-08 05:27:37,440 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -26 predicate places. [2025-02-08 05:27:37,440 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 524 transitions, 1054 flow [2025-02-08 05:27:37,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.0) internal successors, (1620), 3 states have internal predecessors, (1620), 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-02-08 05:27:37,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:37,441 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-02-08 05:27:37,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:27:37,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash 842008985, now seen corresponding path program 1 times [2025-02-08 05:27:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:37,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695657216] [2025-02-08 05:27:37,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:37,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:27:37,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:27:37,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695657216] [2025-02-08 05:27:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695657216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643426715] [2025-02-08 05:27:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:39,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:39,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 560 [2025-02-08 05:27:39,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 524 transitions, 1054 flow. Second operand has 10 states, 10 states have (on average 499.3) internal successors, (4993), 10 states have internal predecessors, (4993), 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-02-08 05:27:39,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 560 [2025-02-08 05:27:39,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,706 INFO L124 PetriNetUnfolderBase]: 104/961 cut-off events. [2025-02-08 05:27:39,706 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:27:39,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 961 events. 104/961 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3982 event pairs, 98 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1070. Up to 239 conditions per place. [2025-02-08 05:27:39,711 INFO L140 encePairwiseOnDemand]: 550/560 looper letters, 42 selfloop transitions, 9 changer transitions 0/523 dead transitions. [2025-02-08 05:27:39,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 523 transitions, 1154 flow [2025-02-08 05:27:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5032 transitions. [2025-02-08 05:27:39,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8985714285714286 [2025-02-08 05:27:39,719 INFO L175 Difference]: Start difference. First operand has 527 places, 524 transitions, 1054 flow. Second operand 10 states and 5032 transitions. [2025-02-08 05:27:39,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 523 transitions, 1154 flow [2025-02-08 05:27:39,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 523 transitions, 1153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:39,726 INFO L231 Difference]: Finished difference. Result has 534 places, 523 transitions, 1069 flow [2025-02-08 05:27:39,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1069, PETRI_PLACES=534, PETRI_TRANSITIONS=523} [2025-02-08 05:27:39,727 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -19 predicate places. [2025-02-08 05:27:39,727 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 523 transitions, 1069 flow [2025-02-08 05:27:39,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 499.3) internal successors, (4993), 10 states have internal predecessors, (4993), 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-02-08 05:27:39,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,730 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-02-08 05:27:39,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:27:39,730 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:39,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash -468473692, now seen corresponding path program 1 times [2025-02-08 05:27:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192033704] [2025-02-08 05:27:39,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:27:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:27:39,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192033704] [2025-02-08 05:27:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192033704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874638044] [2025-02-08 05:27:39,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 560 [2025-02-08 05:27:39,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 523 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-02-08 05:27:39,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 560 [2025-02-08 05:27:39,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,961 INFO L124 PetriNetUnfolderBase]: 22/1190 cut-off events. [2025-02-08 05:27:39,961 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:27:39,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 1190 events. 22/1190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3986 event pairs, 9 based on Foata normal form. 0/1103 useless extension candidates. Maximal degree in co-relation 1033. Up to 31 conditions per place. [2025-02-08 05:27:39,966 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 12 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-02-08 05:27:39,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 522 transitions, 1095 flow [2025-02-08 05:27:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2025-02-08 05:27:39,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642857142857143 [2025-02-08 05:27:39,969 INFO L175 Difference]: Start difference. First operand has 534 places, 523 transitions, 1069 flow. Second operand 3 states and 1620 transitions. [2025-02-08 05:27:39,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 522 transitions, 1095 flow [2025-02-08 05:27:39,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 522 transitions, 1077 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:27:39,975 INFO L231 Difference]: Finished difference. Result has 526 places, 522 transitions, 1053 flow [2025-02-08 05:27:39,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=526, PETRI_TRANSITIONS=522} [2025-02-08 05:27:39,976 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -27 predicate places. [2025-02-08 05:27:39,976 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 522 transitions, 1053 flow [2025-02-08 05:27:39,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-02-08 05:27:39,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,977 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-02-08 05:27:39,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:27:39,978 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:39,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash -330292562, now seen corresponding path program 1 times [2025-02-08 05:27:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818487501] [2025-02-08 05:27:39,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:27:40,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:27:40,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818487501] [2025-02-08 05:27:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818487501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763219082] [2025-02-08 05:27:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 560 [2025-02-08 05:27:40,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 522 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 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-02-08 05:27:40,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 560 [2025-02-08 05:27:40,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,196 INFO L124 PetriNetUnfolderBase]: 27/955 cut-off events. [2025-02-08 05:27:40,196 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:27:40,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 955 events. 27/955 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2402 event pairs, 20 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 816. Up to 53 conditions per place. [2025-02-08 05:27:40,199 INFO L140 encePairwiseOnDemand]: 555/560 looper letters, 13 selfloop transitions, 1 changer transitions 0/518 dead transitions. [2025-02-08 05:27:40,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 518 transitions, 1073 flow [2025-02-08 05:27:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1617 transitions. [2025-02-08 05:27:40,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625 [2025-02-08 05:27:40,202 INFO L175 Difference]: Start difference. First operand has 526 places, 522 transitions, 1053 flow. Second operand 3 states and 1617 transitions. [2025-02-08 05:27:40,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 518 transitions, 1073 flow [2025-02-08 05:27:40,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 518 transitions, 1069 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,208 INFO L231 Difference]: Finished difference. Result has 522 places, 518 transitions, 1043 flow [2025-02-08 05:27:40,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=522, PETRI_TRANSITIONS=518} [2025-02-08 05:27:40,209 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -31 predicate places. [2025-02-08 05:27:40,209 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 518 transitions, 1043 flow [2025-02-08 05:27:40,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 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-02-08 05:27:40,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,210 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-02-08 05:27:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:27:40,210 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1021624886, now seen corresponding path program 1 times [2025-02-08 05:27:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472147460] [2025-02-08 05:27:40,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-08 05:27:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 05:27:40,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:40,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472147460] [2025-02-08 05:27:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472147460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193735445] [2025-02-08 05:27:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 560 [2025-02-08 05:27:40,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 518 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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-02-08 05:27:40,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 560 [2025-02-08 05:27:40,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,347 INFO L124 PetriNetUnfolderBase]: 5/558 cut-off events. [2025-02-08 05:27:40,347 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:40,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 558 events. 5/558 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 274 event pairs, 2 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 371. Up to 11 conditions per place. [2025-02-08 05:27:40,349 INFO L140 encePairwiseOnDemand]: 558/560 looper letters, 6 selfloop transitions, 1 changer transitions 0/517 dead transitions. [2025-02-08 05:27:40,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 517 transitions, 1055 flow [2025-02-08 05:27:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1637 transitions. [2025-02-08 05:27:40,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744047619047619 [2025-02-08 05:27:40,352 INFO L175 Difference]: Start difference. First operand has 522 places, 518 transitions, 1043 flow. Second operand 3 states and 1637 transitions. [2025-02-08 05:27:40,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 517 transitions, 1055 flow [2025-02-08 05:27:40,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 517 transitions, 1054 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:40,358 INFO L231 Difference]: Finished difference. Result has 522 places, 517 transitions, 1042 flow [2025-02-08 05:27:40,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=522, PETRI_TRANSITIONS=517} [2025-02-08 05:27:40,359 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -31 predicate places. [2025-02-08 05:27:40,359 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 517 transitions, 1042 flow [2025-02-08 05:27:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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-02-08 05:27:40,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,360 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-02-08 05:27:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:27:40,360 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:40,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1663915975, now seen corresponding path program 1 times [2025-02-08 05:27:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835463482] [2025-02-08 05:27:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-08 05:27:40,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 05:27:40,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835463482] [2025-02-08 05:27:40,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835463482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108384927] [2025-02-08 05:27:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 560 [2025-02-08 05:27:40,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 517 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-02-08 05:27:40,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 560 [2025-02-08 05:27:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,527 INFO L124 PetriNetUnfolderBase]: 11/683 cut-off events. [2025-02-08 05:27:40,527 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:40,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 683 events. 11/683 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1031 event pairs, 8 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 521. Up to 30 conditions per place. [2025-02-08 05:27:40,532 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 13 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2025-02-08 05:27:40,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 516 transitions, 1070 flow [2025-02-08 05:27:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1621 transitions. [2025-02-08 05:27:40,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9648809523809524 [2025-02-08 05:27:40,537 INFO L175 Difference]: Start difference. First operand has 522 places, 517 transitions, 1042 flow. Second operand 3 states and 1621 transitions. [2025-02-08 05:27:40,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 516 transitions, 1070 flow [2025-02-08 05:27:40,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 516 transitions, 1069 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:40,543 INFO L231 Difference]: Finished difference. Result has 522 places, 516 transitions, 1043 flow [2025-02-08 05:27:40,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=522, PETRI_TRANSITIONS=516} [2025-02-08 05:27:40,544 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -31 predicate places. [2025-02-08 05:27:40,544 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 516 transitions, 1043 flow [2025-02-08 05:27:40,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-02-08 05:27:40,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,544 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-02-08 05:27:40,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:27:40,545 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:40,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash 669760139, now seen corresponding path program 1 times [2025-02-08 05:27:40,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339877076] [2025-02-08 05:27:40,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 05:27:40,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 05:27:40,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:40,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339877076] [2025-02-08 05:27:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339877076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476069901] [2025-02-08 05:27:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 560 [2025-02-08 05:27:40,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 516 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 536.0) internal successors, (1608), 3 states have internal predecessors, (1608), 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-02-08 05:27:40,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 560 [2025-02-08 05:27:40,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,738 INFO L124 PetriNetUnfolderBase]: 23/970 cut-off events. [2025-02-08 05:27:40,738 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:40,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 970 events. 23/970 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2671 event pairs, 14 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 835. Up to 43 conditions per place. [2025-02-08 05:27:40,742 INFO L140 encePairwiseOnDemand]: 554/560 looper letters, 15 selfloop transitions, 3 changer transitions 0/518 dead transitions. [2025-02-08 05:27:40,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 518 transitions, 1086 flow [2025-02-08 05:27:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1626 transitions. [2025-02-08 05:27:40,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-02-08 05:27:40,745 INFO L175 Difference]: Start difference. First operand has 522 places, 516 transitions, 1043 flow. Second operand 3 states and 1626 transitions. [2025-02-08 05:27:40,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 518 transitions, 1086 flow [2025-02-08 05:27:40,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 518 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,754 INFO L231 Difference]: Finished difference. Result has 520 places, 514 transitions, 1046 flow [2025-02-08 05:27:40,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=520, PETRI_TRANSITIONS=514} [2025-02-08 05:27:40,755 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -33 predicate places. [2025-02-08 05:27:40,755 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 514 transitions, 1046 flow [2025-02-08 05:27:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 536.0) internal successors, (1608), 3 states have internal predecessors, (1608), 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-02-08 05:27:40,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,756 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-02-08 05:27:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:27:40,756 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1489750997, now seen corresponding path program 1 times [2025-02-08 05:27:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777815084] [2025-02-08 05:27:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-08 05:27:40,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-08 05:27:40,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777815084] [2025-02-08 05:27:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777815084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47295310] [2025-02-08 05:27:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 560 [2025-02-08 05:27:40,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 514 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 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-02-08 05:27:40,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 560 [2025-02-08 05:27:40,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,949 INFO L124 PetriNetUnfolderBase]: 14/820 cut-off events. [2025-02-08 05:27:40,950 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-02-08 05:27:40,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 820 events. 14/820 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1702 event pairs, 8 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 684. Up to 38 conditions per place. [2025-02-08 05:27:40,952 INFO L140 encePairwiseOnDemand]: 557/560 looper letters, 14 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2025-02-08 05:27:40,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 514 transitions, 1078 flow [2025-02-08 05:27:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1624 transitions. [2025-02-08 05:27:40,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666666666666667 [2025-02-08 05:27:40,955 INFO L175 Difference]: Start difference. First operand has 520 places, 514 transitions, 1046 flow. Second operand 3 states and 1624 transitions. [2025-02-08 05:27:40,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 514 transitions, 1078 flow [2025-02-08 05:27:40,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 514 transitions, 1075 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:40,961 INFO L231 Difference]: Finished difference. Result has 521 places, 514 transitions, 1051 flow [2025-02-08 05:27:40,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=521, PETRI_TRANSITIONS=514} [2025-02-08 05:27:40,962 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -32 predicate places. [2025-02-08 05:27:40,962 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 514 transitions, 1051 flow [2025-02-08 05:27:40,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 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-02-08 05:27:40,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,963 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] [2025-02-08 05:27:40,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:27:40,963 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:40,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash -800601579, now seen corresponding path program 1 times [2025-02-08 05:27:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600000001] [2025-02-08 05:27:40,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 05:27:40,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 05:27:40,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600000001] [2025-02-08 05:27:41,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600000001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088913076] [2025-02-08 05:27:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 560 [2025-02-08 05:27:41,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 514 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-08 05:27:41,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 560 [2025-02-08 05:27:41,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,191 INFO L124 PetriNetUnfolderBase]: 26/1336 cut-off events. [2025-02-08 05:27:41,192 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:27:41,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 1336 events. 26/1336 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5112 event pairs, 8 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1205. Up to 33 conditions per place. [2025-02-08 05:27:41,200 INFO L140 encePairwiseOnDemand]: 558/560 looper letters, 10 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2025-02-08 05:27:41,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 516 transitions, 1079 flow [2025-02-08 05:27:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1638 transitions. [2025-02-08 05:27:41,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2025-02-08 05:27:41,203 INFO L175 Difference]: Start difference. First operand has 521 places, 514 transitions, 1051 flow. Second operand 3 states and 1638 transitions. [2025-02-08 05:27:41,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 516 transitions, 1079 flow [2025-02-08 05:27:41,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 516 transitions, 1077 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:41,209 INFO L231 Difference]: Finished difference. Result has 521 places, 513 transitions, 1049 flow [2025-02-08 05:27:41,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=521, PETRI_TRANSITIONS=513} [2025-02-08 05:27:41,210 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -32 predicate places. [2025-02-08 05:27:41,211 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 513 transitions, 1049 flow [2025-02-08 05:27:41,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-08 05:27:41,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,211 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] [2025-02-08 05:27:41,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:27:41,212 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -578932938, now seen corresponding path program 1 times [2025-02-08 05:27:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433135231] [2025-02-08 05:27:41,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-08 05:27:41,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 05:27:41,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433135231] [2025-02-08 05:27:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433135231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891085668] [2025-02-08 05:27:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 560 [2025-02-08 05:27:41,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 513 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-08 05:27:41,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 560 [2025-02-08 05:27:41,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,432 INFO L124 PetriNetUnfolderBase]: 26/1316 cut-off events. [2025-02-08 05:27:41,433 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:41,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1316 events. 26/1316 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4982 event pairs, 8 based on Foata normal form. 0/1255 useless extension candidates. Maximal degree in co-relation 1186. Up to 33 conditions per place. [2025-02-08 05:27:41,439 INFO L140 encePairwiseOnDemand]: 558/560 looper letters, 10 selfloop transitions, 1 changer transitions 0/515 dead transitions. [2025-02-08 05:27:41,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 515 transitions, 1077 flow [2025-02-08 05:27:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1638 transitions. [2025-02-08 05:27:41,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2025-02-08 05:27:41,442 INFO L175 Difference]: Start difference. First operand has 521 places, 513 transitions, 1049 flow. Second operand 3 states and 1638 transitions. [2025-02-08 05:27:41,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 515 transitions, 1077 flow [2025-02-08 05:27:41,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 515 transitions, 1076 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:41,448 INFO L231 Difference]: Finished difference. Result has 521 places, 512 transitions, 1048 flow [2025-02-08 05:27:41,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=521, PETRI_TRANSITIONS=512} [2025-02-08 05:27:41,449 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -32 predicate places. [2025-02-08 05:27:41,449 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 512 transitions, 1048 flow [2025-02-08 05:27:41,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-08 05:27:41,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,450 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] [2025-02-08 05:27:41,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:27:41,450 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -165690240, now seen corresponding path program 1 times [2025-02-08 05:27:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829986305] [2025-02-08 05:27:41,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-08 05:27:41,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-08 05:27:41,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829986305] [2025-02-08 05:27:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829986305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863867101] [2025-02-08 05:27:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 560 [2025-02-08 05:27:41,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 512 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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-02-08 05:27:41,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 560 [2025-02-08 05:27:41,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,655 INFO L124 PetriNetUnfolderBase]: 7/703 cut-off events. [2025-02-08 05:27:41,655 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:27:41,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 703 events. 7/703 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 942 event pairs, 3 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 541. Up to 16 conditions per place. [2025-02-08 05:27:41,658 INFO L140 encePairwiseOnDemand]: 558/560 looper letters, 6 selfloop transitions, 1 changer transitions 38/512 dead transitions. [2025-02-08 05:27:41,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 512 transitions, 1067 flow [2025-02-08 05:27:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1636 transitions. [2025-02-08 05:27:41,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738095238095238 [2025-02-08 05:27:41,661 INFO L175 Difference]: Start difference. First operand has 521 places, 512 transitions, 1048 flow. Second operand 3 states and 1636 transitions. [2025-02-08 05:27:41,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 512 transitions, 1067 flow [2025-02-08 05:27:41,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:41,669 INFO L231 Difference]: Finished difference. Result has 521 places, 474 transitions, 972 flow [2025-02-08 05:27:41,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=521, PETRI_TRANSITIONS=474} [2025-02-08 05:27:41,673 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -32 predicate places. [2025-02-08 05:27:41,673 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 474 transitions, 972 flow [2025-02-08 05:27:41,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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-02-08 05:27:41,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,674 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] [2025-02-08 05:27:41,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:27:41,674 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1943642264, now seen corresponding path program 1 times [2025-02-08 05:27:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694988670] [2025-02-08 05:27:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-08 05:27:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-08 05:27:41,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694988670] [2025-02-08 05:27:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694988670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230612051] [2025-02-08 05:27:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:43,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:43,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:43,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:43,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 496 out of 560 [2025-02-08 05:27:43,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 474 transitions, 972 flow. Second operand has 10 states, 10 states have (on average 498.0) internal successors, (4980), 10 states have internal predecessors, (4980), 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-02-08 05:27:43,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:43,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 496 of 560 [2025-02-08 05:27:43,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:44,041 INFO L124 PetriNetUnfolderBase]: 194/2401 cut-off events. [2025-02-08 05:27:44,042 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:27:44,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2401 events. 194/2401 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 17774 event pairs, 39 based on Foata normal form. 4/2293 useless extension candidates. Maximal degree in co-relation 2813. Up to 290 conditions per place. [2025-02-08 05:27:44,049 INFO L140 encePairwiseOnDemand]: 528/560 looper letters, 65 selfloop transitions, 43 changer transitions 0/530 dead transitions. [2025-02-08 05:27:44,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 530 transitions, 1316 flow [2025-02-08 05:27:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5071 transitions. [2025-02-08 05:27:44,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055357142857143 [2025-02-08 05:27:44,058 INFO L175 Difference]: Start difference. First operand has 521 places, 474 transitions, 972 flow. Second operand 10 states and 5071 transitions. [2025-02-08 05:27:44,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 530 transitions, 1316 flow [2025-02-08 05:27:44,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 530 transitions, 1315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:44,067 INFO L231 Difference]: Finished difference. Result has 502 places, 515 transitions, 1285 flow [2025-02-08 05:27:44,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1285, PETRI_PLACES=502, PETRI_TRANSITIONS=515} [2025-02-08 05:27:44,069 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -51 predicate places. [2025-02-08 05:27:44,069 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 515 transitions, 1285 flow [2025-02-08 05:27:44,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 498.0) internal successors, (4980), 10 states have internal predecessors, (4980), 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-02-08 05:27:44,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:44,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:44,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:27:44,070 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -968046417, now seen corresponding path program 1 times [2025-02-08 05:27:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781161899] [2025-02-08 05:27:44,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:44,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-08 05:27:44,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-08 05:27:44,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:44,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:27:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781161899] [2025-02-08 05:27:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781161899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-02-08 05:27:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896405649] [2025-02-08 05:27:48,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 05:27:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:48,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 05:27:48,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 05:27:52,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 560 [2025-02-08 05:27:52,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 515 transitions, 1285 flow. Second operand has 35 states, 35 states have (on average 453.22857142857146) internal successors, (15863), 35 states have internal predecessors, (15863), 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-02-08 05:27:52,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:52,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 560 [2025-02-08 05:27:52,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:56,184 INFO L124 PetriNetUnfolderBase]: 663/3992 cut-off events. [2025-02-08 05:27:56,184 INFO L125 PetriNetUnfolderBase]: For 617/681 co-relation queries the response was YES. [2025-02-08 05:27:56,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 3992 events. 663/3992 cut-off events. For 617/681 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 32963 event pairs, 43 based on Foata normal form. 72/3927 useless extension candidates. Maximal degree in co-relation 6562. Up to 542 conditions per place. [2025-02-08 05:27:56,203 INFO L140 encePairwiseOnDemand]: 489/560 looper letters, 180 selfloop transitions, 95 changer transitions 0/654 dead transitions. [2025-02-08 05:27:56,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 654 transitions, 2363 flow [2025-02-08 05:27:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 05:27:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-08 05:27:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 14675 transitions. [2025-02-08 05:27:56,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189174107142857 [2025-02-08 05:27:56,212 INFO L175 Difference]: Start difference. First operand has 502 places, 515 transitions, 1285 flow. Second operand 32 states and 14675 transitions. [2025-02-08 05:27:56,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 654 transitions, 2363 flow [2025-02-08 05:27:56,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 654 transitions, 2363 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:56,223 INFO L231 Difference]: Finished difference. Result has 544 places, 543 transitions, 1792 flow [2025-02-08 05:27:56,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1792, PETRI_PLACES=544, PETRI_TRANSITIONS=543} [2025-02-08 05:27:56,224 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -9 predicate places. [2025-02-08 05:27:56,225 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 543 transitions, 1792 flow [2025-02-08 05:27:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 453.22857142857146) internal successors, (15863), 35 states have internal predecessors, (15863), 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-02-08 05:27:56,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:56,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:56,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:27:56,228 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 524742949, now seen corresponding path program 2 times [2025-02-08 05:27:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176795642] [2025-02-08 05:27:56,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:27:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:56,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 378 statements into 2 equivalence classes. [2025-02-08 05:27:56,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 376 of 378 statements. [2025-02-08 05:27:56,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:27:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:28:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176795642] [2025-02-08 05:28:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176795642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:00,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:00,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-02-08 05:28:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159989897] [2025-02-08 05:28:00,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:00,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 05:28:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:00,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 05:28:00,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 05:28:03,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 560 [2025-02-08 05:28:03,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 543 transitions, 1792 flow. Second operand has 35 states, 35 states have (on average 453.22857142857146) internal successors, (15863), 35 states have internal predecessors, (15863), 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-02-08 05:28:03,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:03,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 560 [2025-02-08 05:28:03,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:06,914 INFO L124 PetriNetUnfolderBase]: 1186/5649 cut-off events. [2025-02-08 05:28:06,915 INFO L125 PetriNetUnfolderBase]: For 4705/4981 co-relation queries the response was YES. [2025-02-08 05:28:06,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12882 conditions, 5649 events. 1186/5649 cut-off events. For 4705/4981 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 48696 event pairs, 48 based on Foata normal form. 79/5548 useless extension candidates. Maximal degree in co-relation 12584. Up to 1121 conditions per place. [2025-02-08 05:28:06,954 INFO L140 encePairwiseOnDemand]: 497/560 looper letters, 358 selfloop transitions, 128 changer transitions 0/865 dead transitions. [2025-02-08 05:28:06,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 865 transitions, 4898 flow [2025-02-08 05:28:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 05:28:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-02-08 05:28:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16080 transitions. [2025-02-08 05:28:06,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8204081632653061 [2025-02-08 05:28:06,964 INFO L175 Difference]: Start difference. First operand has 544 places, 543 transitions, 1792 flow. Second operand 35 states and 16080 transitions. [2025-02-08 05:28:06,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 865 transitions, 4898 flow [2025-02-08 05:28:06,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 865 transitions, 4827 flow, removed 0 selfloop flow, removed 20 redundant places. [2025-02-08 05:28:06,993 INFO L231 Difference]: Finished difference. Result has 573 places, 630 transitions, 2912 flow [2025-02-08 05:28:06,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2912, PETRI_PLACES=573, PETRI_TRANSITIONS=630} [2025-02-08 05:28:06,994 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, 20 predicate places. [2025-02-08 05:28:06,994 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 630 transitions, 2912 flow [2025-02-08 05:28:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 453.22857142857146) internal successors, (15863), 35 states have internal predecessors, (15863), 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-02-08 05:28:06,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:06,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:06,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:28:06,999 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2086165295, now seen corresponding path program 3 times [2025-02-08 05:28:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103305027] [2025-02-08 05:28:07,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:28:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:07,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 378 statements into 2 equivalence classes. [2025-02-08 05:28:07,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 376 of 378 statements. [2025-02-08 05:28:07,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:28:07,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:28:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103305027] [2025-02-08 05:28:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103305027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:10,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-02-08 05:28:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294381862] [2025-02-08 05:28:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:10,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 05:28:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:10,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 05:28:10,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 05:28:15,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 560 [2025-02-08 05:28:15,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 630 transitions, 2912 flow. Second operand has 35 states, 35 states have (on average 453.22857142857146) internal successors, (15863), 35 states have internal predecessors, (15863), 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-02-08 05:28:15,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:15,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 560 [2025-02-08 05:28:15,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:18,736 INFO L124 PetriNetUnfolderBase]: 1373/7417 cut-off events. [2025-02-08 05:28:18,736 INFO L125 PetriNetUnfolderBase]: For 12590/12798 co-relation queries the response was YES. [2025-02-08 05:28:18,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18829 conditions, 7417 events. 1373/7417 cut-off events. For 12590/12798 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 71421 event pairs, 153 based on Foata normal form. 137/7269 useless extension candidates. Maximal degree in co-relation 18516. Up to 801 conditions per place. [2025-02-08 05:28:18,795 INFO L140 encePairwiseOnDemand]: 497/560 looper letters, 385 selfloop transitions, 174 changer transitions 0/938 dead transitions. [2025-02-08 05:28:18,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 938 transitions, 6552 flow [2025-02-08 05:28:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 05:28:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-02-08 05:28:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16068 transitions. [2025-02-08 05:28:18,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8197959183673469 [2025-02-08 05:28:18,803 INFO L175 Difference]: Start difference. First operand has 573 places, 630 transitions, 2912 flow. Second operand 35 states and 16068 transitions. [2025-02-08 05:28:18,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 938 transitions, 6552 flow [2025-02-08 05:28:18,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 938 transitions, 6491 flow, removed 13 selfloop flow, removed 18 redundant places. [2025-02-08 05:28:18,860 INFO L231 Difference]: Finished difference. Result has 605 places, 716 transitions, 4509 flow [2025-02-08 05:28:18,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4509, PETRI_PLACES=605, PETRI_TRANSITIONS=716} [2025-02-08 05:28:18,862 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, 52 predicate places. [2025-02-08 05:28:18,863 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 716 transitions, 4509 flow [2025-02-08 05:28:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 453.22857142857146) internal successors, (15863), 35 states have internal predecessors, (15863), 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-02-08 05:28:18,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:18,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:28:18,865 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1022703813, now seen corresponding path program 4 times [2025-02-08 05:28:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:18,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276554538] [2025-02-08 05:28:18,867 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:28:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:18,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 378 statements into 2 equivalence classes. [2025-02-08 05:28:18,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 378 of 378 statements. [2025-02-08 05:28:18,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:28:18,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:28:23,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276554538] [2025-02-08 05:28:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276554538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:23,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:23,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-02-08 05:28:23,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163818711] [2025-02-08 05:28:23,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:23,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 05:28:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:23,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 05:28:23,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-02-08 05:28:26,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 560 [2025-02-08 05:28:26,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 716 transitions, 4509 flow. Second operand has 27 states, 27 states have (on average 467.037037037037) internal successors, (12610), 27 states have internal predecessors, (12610), 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-02-08 05:28:26,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:26,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 560 [2025-02-08 05:28:26,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:30,701 INFO L124 PetriNetUnfolderBase]: 2132/9225 cut-off events. [2025-02-08 05:28:30,701 INFO L125 PetriNetUnfolderBase]: For 35470/36107 co-relation queries the response was YES. [2025-02-08 05:28:30,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31338 conditions, 9225 events. 2132/9225 cut-off events. For 35470/36107 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 87407 event pairs, 88 based on Foata normal form. 76/9004 useless extension candidates. Maximal degree in co-relation 30994. Up to 2069 conditions per place. [2025-02-08 05:28:30,789 INFO L140 encePairwiseOnDemand]: 496/560 looper letters, 530 selfloop transitions, 316 changer transitions 0/1239 dead transitions. [2025-02-08 05:28:30,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 1239 transitions, 11570 flow [2025-02-08 05:28:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-08 05:28:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-08 05:28:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 17585 transitions. [2025-02-08 05:28:30,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486969111969112 [2025-02-08 05:28:30,797 INFO L175 Difference]: Start difference. First operand has 605 places, 716 transitions, 4509 flow. Second operand 37 states and 17585 transitions. [2025-02-08 05:28:30,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 1239 transitions, 11570 flow [2025-02-08 05:28:30,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 1239 transitions, 11331 flow, removed 102 selfloop flow, removed 18 redundant places. [2025-02-08 05:28:30,953 INFO L231 Difference]: Finished difference. Result has 646 places, 959 transitions, 8652 flow [2025-02-08 05:28:30,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=4348, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=8652, PETRI_PLACES=646, PETRI_TRANSITIONS=959} [2025-02-08 05:28:30,954 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, 93 predicate places. [2025-02-08 05:28:30,955 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 959 transitions, 8652 flow [2025-02-08 05:28:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 467.037037037037) internal successors, (12610), 27 states have internal predecessors, (12610), 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-02-08 05:28:30,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:30,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:28:30,957 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1586707571, now seen corresponding path program 5 times [2025-02-08 05:28:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:30,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743145284] [2025-02-08 05:28:30,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:28:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:30,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 3 equivalence classes. [2025-02-08 05:28:31,042 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 378 of 378 statements. [2025-02-08 05:28:31,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 05:28:31,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:28:37,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743145284] [2025-02-08 05:28:37,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743145284] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:28:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15968864] [2025-02-08 05:28:37,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:28:37,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:28:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:28:37,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:28:37,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:28:37,488 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 3 equivalence classes. [2025-02-08 05:28:37,647 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 378 of 378 statements. [2025-02-08 05:28:37,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 05:28:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:37,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-08 05:28:37,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:28:37,870 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:28:37,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:28:37,909 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 05:28:37,909 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-02-08 05:28:38,037 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-08 05:28:38,038 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 24 treesize of output 28 [2025-02-08 05:28:38,117 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-08 05:28:38,118 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 24 treesize of output 28 [2025-02-08 05:28:38,197 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-08 05:28:38,197 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 24 treesize of output 28 [2025-02-08 05:28:38,274 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-08 05:28:38,275 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-02-08 05:28:38,466 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-02-08 05:28:38,466 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 27 treesize of output 45 [2025-02-08 05:28:38,687 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:38,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:38,849 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:38,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:39,017 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:39,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:39,206 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:39,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:39,382 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:39,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:39,564 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:39,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:39,743 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:39,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:39,906 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-08 05:28:39,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-08 05:28:40,135 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-08 05:28:40,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-08 05:28:40,291 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-02-08 05:28:40,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-02-08 05:28:40,803 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-02-08 05:28:40,833 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 21 treesize of output 20 [2025-02-08 05:28:40,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:28:40,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-08 05:28:40,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:28:40,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-08 05:28:40,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:28:40,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-08 05:28:41,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:28:41,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-08 05:28:41,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:28:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-08 05:28:41,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:28:41,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-02-08 05:28:41,287 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 79 treesize of output 60 [2025-02-08 05:28:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:28:41,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:28:41,383 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0))) is different from false [2025-02-08 05:28:41,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0))))) is different from false [2025-02-08 05:28:41,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse2 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0))))) is different from false [2025-02-08 05:28:41,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse3 (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse2 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse3))) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1499) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0))))) is different from false