./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 551b0097 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-?-551b009-m [2025-01-09 21:18:12,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:18:12,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:18:12,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:18:12,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:18:12,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:18:12,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:18:12,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:18:12,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:18:12,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:18:12,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:18:12,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:18:12,729 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:18:12,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:18:12,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:18:12,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:18:12,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:18:12,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:18:12,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:18:12,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:18:12,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:18:12,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:18:12,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:18:12,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:18:12,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:18:12,732 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-01-09 21:18:12,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:18:12,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:18:12,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:18:12,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:18:12,942 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:18:12,942 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-01-09 21:18:14,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5110857a/2867adffddc74b1f8d798105cd465b5d/FLAGcfa491912 [2025-01-09 21:18:14,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:18:14,424 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-01-09 21:18:14,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5110857a/2867adffddc74b1f8d798105cd465b5d/FLAGcfa491912 [2025-01-09 21:18:14,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5110857a/2867adffddc74b1f8d798105cd465b5d [2025-01-09 21:18:14,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:18:14,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:18:14,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:18:14,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:18:14,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:18:14,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:18:14" (1/1) ... [2025-01-09 21:18:14,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a183ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:14, skipping insertion in model container [2025-01-09 21:18:14,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:18:14" (1/1) ... [2025-01-09 21:18:14,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:18:17,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:18:17,907 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:18:18,042 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-01-09 21:18:18,047 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-01-09 21:18:18,047 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-01-09 21:18:18,047 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-01-09 21:18:18,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-01-09 21:18:18,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:18:18,484 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:18:18,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18 WrapperNode [2025-01-09 21:18:18,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:18:18,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:18:18,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:18:18,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:18:18,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,609 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 522 [2025-01-09 21:18:18,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:18:18,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:18:18,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:18:18,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:18:18,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:18:18,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:18:18,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:18:18,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:18:18,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (1/1) ... [2025-01-09 21:18:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:18:18,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:18:18,703 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-01-09 21:18:18,707 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-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-01-09 21:18:18,721 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:18:18,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:18:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-01-09 21:18:18,721 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-01-09 21:18:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:18:18,722 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:18:19,065 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:18:19,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:18:19,584 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:18:19,584 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:18:19,631 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:18:19,631 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:18:19,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:18:19 BoogieIcfgContainer [2025-01-09 21:18:19,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:18:19,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:18:19,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:18:19,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:18:19,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:18:14" (1/3) ... [2025-01-09 21:18:19,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50316ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:18:19, skipping insertion in model container [2025-01-09 21:18:19,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:18" (2/3) ... [2025-01-09 21:18:19,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50316ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:18:19, skipping insertion in model container [2025-01-09 21:18:19,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:18:19" (3/3) ... [2025-01-09 21:18:19,638 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-01-09 21:18:19,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:18:19,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i that has 3 procedures, 573 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-01-09 21:18:19,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:18:19,743 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:18:19,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 579 places, 585 transitions, 1184 flow [2025-01-09 21:18:19,919 INFO L124 PetriNetUnfolderBase]: 13/583 cut-off events. [2025-01-09 21:18:19,921 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:18:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 583 events. 13/583 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 562 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 514. Up to 4 conditions per place. [2025-01-09 21:18:19,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 579 places, 585 transitions, 1184 flow [2025-01-09 21:18:19,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 573 places, 579 transitions, 1167 flow [2025-01-09 21:18:19,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:18:19,954 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;@50d9dd40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:18:19,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-09 21:18:19,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:18:19,968 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2025-01-09 21:18:19,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:18:19,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:19,969 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-01-09 21:18:19,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1555583611, now seen corresponding path program 1 times [2025-01-09 21:18:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810098528] [2025-01-09 21:18:19,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:20,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:18:20,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:18:20,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:20,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810098528] [2025-01-09 21:18:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810098528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:20,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884281101] [2025-01-09 21:18:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:20,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:20,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:20,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:20,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:20,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1167 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:20,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:20,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:20,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:20,543 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2025-01-09 21:18:20,544 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-01-09 21:18:20,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 611 events. 13/611 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 775 event pairs, 2 based on Foata normal form. 4/564 useless extension candidates. Maximal degree in co-relation 513. Up to 13 conditions per place. [2025-01-09 21:18:20,551 INFO L140 encePairwiseOnDemand]: 575/585 looper letters, 8 selfloop transitions, 2 changer transitions 1/569 dead transitions. [2025-01-09 21:18:20,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 569 transitions, 1167 flow [2025-01-09 21:18:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2025-01-09 21:18:20,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-01-09 21:18:20,570 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1167 flow. Second operand 3 states and 1710 transitions. [2025-01-09 21:18:20,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 569 transitions, 1167 flow [2025-01-09 21:18:20,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 569 transitions, 1162 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:18:20,589 INFO L231 Difference]: Finished difference. Result has 566 places, 568 transitions, 1144 flow [2025-01-09 21:18:20,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=566, PETRI_TRANSITIONS=568} [2025-01-09 21:18:20,598 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -7 predicate places. [2025-01-09 21:18:20,599 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 568 transitions, 1144 flow [2025-01-09 21:18:20,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:20,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:20,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] [2025-01-09 21:18:20,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:18:20,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:20,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1658986265, now seen corresponding path program 1 times [2025-01-09 21:18:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:20,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357749936] [2025-01-09 21:18:20,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:20,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:18:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:18:20,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:20,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357749936] [2025-01-09 21:18:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357749936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779330805] [2025-01-09 21:18:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:20,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:20,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:20,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:20,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 585 [2025-01-09 21:18:20,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:20,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:20,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 585 [2025-01-09 21:18:20,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:20,885 INFO L124 PetriNetUnfolderBase]: 29/1060 cut-off events. [2025-01-09 21:18:20,885 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:18:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 1060 events. 29/1060 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2920 event pairs, 5 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 996. Up to 20 conditions per place. [2025-01-09 21:18:20,893 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 9 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-01-09 21:18:20,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1164 flow [2025-01-09 21:18:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-01-09 21:18:20,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-01-09 21:18:20,897 INFO L175 Difference]: Start difference. First operand has 566 places, 568 transitions, 1144 flow. Second operand 3 states and 1701 transitions. [2025-01-09 21:18:20,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1164 flow [2025-01-09 21:18:20,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:20,907 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2025-01-09 21:18:20,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2025-01-09 21:18:20,909 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -9 predicate places. [2025-01-09 21:18:20,909 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2025-01-09 21:18:20,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:20,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:20,910 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-01-09 21:18:20,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:18:20,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2004493150, now seen corresponding path program 1 times [2025-01-09 21:18:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:20,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917641734] [2025-01-09 21:18:20,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:20,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:18:20,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:18:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917641734] [2025-01-09 21:18:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917641734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586060221] [2025-01-09 21:18:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:21,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:21,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:21,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:21,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:21,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:21,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:21,123 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2025-01-09 21:18:21,123 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 608 events. 13/608 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 773 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 528. Up to 13 conditions per place. [2025-01-09 21:18:21,127 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-01-09 21:18:21,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1160 flow [2025-01-09 21:18:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:21,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:21,132 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:21,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1160 flow [2025-01-09 21:18:21,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:21,138 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2025-01-09 21:18:21,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=563, PETRI_TRANSITIONS=566} [2025-01-09 21:18:21,140 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -10 predicate places. [2025-01-09 21:18:21,140 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2025-01-09 21:18:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:21,141 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-01-09 21:18:21,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:18:21,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:21,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash -926812324, now seen corresponding path program 1 times [2025-01-09 21:18:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837616047] [2025-01-09 21:18:21,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:21,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:18:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:18:21,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:21,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837616047] [2025-01-09 21:18:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837616047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063154769] [2025-01-09 21:18:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:21,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:21,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:21,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:21,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:21,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:21,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:21,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:21,313 INFO L124 PetriNetUnfolderBase]: 13/607 cut-off events. [2025-01-09 21:18:21,314 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:21,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 607 events. 13/607 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 775 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 520. Up to 13 conditions per place. [2025-01-09 21:18:21,318 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-01-09 21:18:21,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1158 flow [2025-01-09 21:18:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:21,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:21,321 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:21,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1158 flow [2025-01-09 21:18:21,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:21,329 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2025-01-09 21:18:21,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=562, PETRI_TRANSITIONS=565} [2025-01-09 21:18:21,332 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -11 predicate places. [2025-01-09 21:18:21,333 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2025-01-09 21:18:21,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:21,334 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-01-09 21:18:21,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:18:21,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:21,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash -160585105, now seen corresponding path program 1 times [2025-01-09 21:18:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:21,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960390646] [2025-01-09 21:18:21,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:21,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:18:21,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:18:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:21,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:21,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960390646] [2025-01-09 21:18:21,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960390646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:21,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34925691] [2025-01-09 21:18:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:21,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:21,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:21,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:21,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:21,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:21,511 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2025-01-09 21:18:21,511 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:21,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 606 events. 13/606 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 770 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 512. Up to 13 conditions per place. [2025-01-09 21:18:21,514 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-01-09 21:18:21,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2025-01-09 21:18:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:21,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:21,517 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2025-01-09 21:18:21,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:21,524 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2025-01-09 21:18:21,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=561, PETRI_TRANSITIONS=564} [2025-01-09 21:18:21,525 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -12 predicate places. [2025-01-09 21:18:21,525 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2025-01-09 21:18:21,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:21,527 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-01-09 21:18:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:18:21,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:21,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1119884281, now seen corresponding path program 1 times [2025-01-09 21:18:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168646385] [2025-01-09 21:18:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:21,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:18:21,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:18:21,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:21,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:21,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168646385] [2025-01-09 21:18:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168646385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391157776] [2025-01-09 21:18:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:21,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:21,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:21,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:21,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 585 [2025-01-09 21:18:21,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:21,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 585 [2025-01-09 21:18:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:21,729 INFO L124 PetriNetUnfolderBase]: 14/625 cut-off events. [2025-01-09 21:18:21,729 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:18:21,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 625 events. 14/625 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 874 event pairs, 3 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 527. Up to 16 conditions per place. [2025-01-09 21:18:21,733 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 9 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-01-09 21:18:21,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1156 flow [2025-01-09 21:18:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-01-09 21:18:21,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-01-09 21:18:21,736 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1701 transitions. [2025-01-09 21:18:21,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1156 flow [2025-01-09 21:18:21,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:21,743 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2025-01-09 21:18:21,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2025-01-09 21:18:21,746 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -13 predicate places. [2025-01-09 21:18:21,747 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2025-01-09 21:18:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:21,749 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-01-09 21:18:21,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:18:21,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1146411194, now seen corresponding path program 1 times [2025-01-09 21:18:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72246417] [2025-01-09 21:18:21,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:18:21,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:18:21,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:21,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72246417] [2025-01-09 21:18:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72246417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:21,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822816724] [2025-01-09 21:18:21,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:21,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:21,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:21,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:21,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:21,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:21,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:21,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:21,875 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2025-01-09 21:18:21,875 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:21,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 604 events. 13/604 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 769 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 496. Up to 13 conditions per place. [2025-01-09 21:18:21,878 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-01-09 21:18:21,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2025-01-09 21:18:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:21,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:21,881 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:21,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2025-01-09 21:18:21,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:21,908 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2025-01-09 21:18:21,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=559, PETRI_TRANSITIONS=562} [2025-01-09 21:18:21,909 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -14 predicate places. [2025-01-09 21:18:21,909 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2025-01-09 21:18:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:21,910 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-01-09 21:18:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:18:21,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1712301697, now seen corresponding path program 1 times [2025-01-09 21:18:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227972289] [2025-01-09 21:18:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:21,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 21:18:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 21:18:21,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227972289] [2025-01-09 21:18:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227972289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:21,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369911456] [2025-01-09 21:18:21,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:21,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:21,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:21,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:21,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:21,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:21,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:21,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:21,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:22,043 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2025-01-09 21:18:22,043 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:22,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 603 events. 13/603 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 775 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 488. Up to 13 conditions per place. [2025-01-09 21:18:22,047 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-01-09 21:18:22,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2025-01-09 21:18:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:22,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:22,050 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:22,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2025-01-09 21:18:22,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:22,057 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2025-01-09 21:18:22,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=558, PETRI_TRANSITIONS=561} [2025-01-09 21:18:22,060 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -15 predicate places. [2025-01-09 21:18:22,061 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2025-01-09 21:18:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:22,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] [2025-01-09 21:18:22,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:18:22,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:22,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1295353978, now seen corresponding path program 1 times [2025-01-09 21:18:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:22,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356120211] [2025-01-09 21:18:22,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:18:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:18:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356120211] [2025-01-09 21:18:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356120211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348188283] [2025-01-09 21:18:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:22,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:22,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:22,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:22,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:22,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:22,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:22,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:22,191 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2025-01-09 21:18:22,191 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:22,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 602 events. 13/602 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 774 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 480. Up to 13 conditions per place. [2025-01-09 21:18:22,194 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-01-09 21:18:22,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2025-01-09 21:18:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:22,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:22,197 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:22,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2025-01-09 21:18:22,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:22,204 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2025-01-09 21:18:22,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=557, PETRI_TRANSITIONS=560} [2025-01-09 21:18:22,205 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -16 predicate places. [2025-01-09 21:18:22,206 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2025-01-09 21:18:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:22,207 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-01-09 21:18:22,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:18:22,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:22,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash -346739329, now seen corresponding path program 1 times [2025-01-09 21:18:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137281603] [2025-01-09 21:18:22,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:22,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:18:22,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:18:22,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:22,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137281603] [2025-01-09 21:18:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137281603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565024135] [2025-01-09 21:18:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:22,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:22,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:22,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:22,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:22,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:22,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:22,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:22,392 INFO L124 PetriNetUnfolderBase]: 13/601 cut-off events. [2025-01-09 21:18:22,393 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 601 events. 13/601 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 774 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 472. Up to 13 conditions per place. [2025-01-09 21:18:22,398 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-01-09 21:18:22,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1146 flow [2025-01-09 21:18:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:22,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:22,401 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:22,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1146 flow [2025-01-09 21:18:22,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:22,410 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2025-01-09 21:18:22,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=556, PETRI_TRANSITIONS=559} [2025-01-09 21:18:22,412 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -17 predicate places. [2025-01-09 21:18:22,412 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2025-01-09 21:18:22,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:22,414 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-01-09 21:18:22,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:18:22,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:22,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash -863099636, now seen corresponding path program 1 times [2025-01-09 21:18:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430244834] [2025-01-09 21:18:22,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:22,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:18:22,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:18:22,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:22,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430244834] [2025-01-09 21:18:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430244834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982699590] [2025-01-09 21:18:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:22,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:22,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:22,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:22,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:22,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:22,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:22,585 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2025-01-09 21:18:22,586 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:22,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 600 events. 13/600 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 769 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 464. Up to 13 conditions per place. [2025-01-09 21:18:22,589 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-01-09 21:18:22,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2025-01-09 21:18:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:22,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:22,592 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:22,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2025-01-09 21:18:22,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:22,600 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2025-01-09 21:18:22,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2025-01-09 21:18:22,601 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -18 predicate places. [2025-01-09 21:18:22,601 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2025-01-09 21:18:22,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:22,602 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-01-09 21:18:22,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:18:22,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:22,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1138400121, now seen corresponding path program 1 times [2025-01-09 21:18:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453846876] [2025-01-09 21:18:22,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:22,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:18:22,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:18:22,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:22,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453846876] [2025-01-09 21:18:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453846876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646014306] [2025-01-09 21:18:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:22,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:22,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:22,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:22,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 585 [2025-01-09 21:18:22,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:22,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 585 [2025-01-09 21:18:22,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:22,798 INFO L124 PetriNetUnfolderBase]: 29/1041 cut-off events. [2025-01-09 21:18:22,798 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:18:22,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1041 events. 29/1041 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2893 event pairs, 5 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 907. Up to 20 conditions per place. [2025-01-09 21:18:22,802 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 9 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-01-09 21:18:22,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1144 flow [2025-01-09 21:18:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-01-09 21:18:22,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-01-09 21:18:22,804 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1701 transitions. [2025-01-09 21:18:22,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1144 flow [2025-01-09 21:18:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:22,810 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2025-01-09 21:18:22,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2025-01-09 21:18:22,811 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -19 predicate places. [2025-01-09 21:18:22,811 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2025-01-09 21:18:22,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:22,813 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-01-09 21:18:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:18:22,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1931945346, now seen corresponding path program 1 times [2025-01-09 21:18:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134805965] [2025-01-09 21:18:22,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:22,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:18:22,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:18:22,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:22,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134805965] [2025-01-09 21:18:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134805965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:22,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:22,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155497862] [2025-01-09 21:18:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:22,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:22,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:22,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:22,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:22,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:22,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:22,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:22,956 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2025-01-09 21:18:22,956 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 598 events. 13/598 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 769 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 448. Up to 13 conditions per place. [2025-01-09 21:18:22,959 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-01-09 21:18:22,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2025-01-09 21:18:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:22,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:22,963 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:22,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2025-01-09 21:18:22,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:22,969 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2025-01-09 21:18:22,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2025-01-09 21:18:22,970 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -20 predicate places. [2025-01-09 21:18:22,970 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2025-01-09 21:18:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:22,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:22,972 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-01-09 21:18:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:18:22,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:22,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash 441707705, now seen corresponding path program 1 times [2025-01-09 21:18:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955648380] [2025-01-09 21:18:22,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:22,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:18:22,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:18:22,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:22,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955648380] [2025-01-09 21:18:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955648380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095369072] [2025-01-09 21:18:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:23,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:23,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:23,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:23,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:23,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:23,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:23,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:23,118 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2025-01-09 21:18:23,118 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:23,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 597 events. 13/597 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 768 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 440. Up to 13 conditions per place. [2025-01-09 21:18:23,122 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-01-09 21:18:23,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2025-01-09 21:18:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:23,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:23,124 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:23,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2025-01-09 21:18:23,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:23,130 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2025-01-09 21:18:23,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-01-09 21:18:23,132 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -21 predicate places. [2025-01-09 21:18:23,132 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2025-01-09 21:18:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:23,134 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-01-09 21:18:23,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:18:23,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:23,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:23,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1571789276, now seen corresponding path program 1 times [2025-01-09 21:18:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:23,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436378730] [2025-01-09 21:18:23,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:18:23,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:18:23,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:23,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:23,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436378730] [2025-01-09 21:18:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436378730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404915589] [2025-01-09 21:18:23,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:23,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:23,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:23,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:23,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:23,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:23,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:23,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:23,287 INFO L124 PetriNetUnfolderBase]: 13/596 cut-off events. [2025-01-09 21:18:23,287 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:23,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 596 events. 13/596 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 771 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 432. Up to 13 conditions per place. [2025-01-09 21:18:23,292 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2025-01-09 21:18:23,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1136 flow [2025-01-09 21:18:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:23,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:23,295 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:23,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1136 flow [2025-01-09 21:18:23,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:23,301 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2025-01-09 21:18:23,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2025-01-09 21:18:23,303 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -22 predicate places. [2025-01-09 21:18:23,303 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2025-01-09 21:18:23,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:23,304 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-01-09 21:18:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:18:23,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1619079222, now seen corresponding path program 1 times [2025-01-09 21:18:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935786212] [2025-01-09 21:18:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:23,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:18:23,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:18:23,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:23,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935786212] [2025-01-09 21:18:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935786212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740887261] [2025-01-09 21:18:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:23,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:23,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:23,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:23,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:23,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:23,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:23,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:23,462 INFO L124 PetriNetUnfolderBase]: 13/595 cut-off events. [2025-01-09 21:18:23,462 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:23,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 595 events. 13/595 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 767 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 424. Up to 13 conditions per place. [2025-01-09 21:18:23,465 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 8 selfloop transitions, 2 changer transitions 0/553 dead transitions. [2025-01-09 21:18:23,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 553 transitions, 1134 flow [2025-01-09 21:18:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-01-09 21:18:23,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2025-01-09 21:18:23,468 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1703 transitions. [2025-01-09 21:18:23,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 553 transitions, 1134 flow [2025-01-09 21:18:23,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 553 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:23,474 INFO L231 Difference]: Finished difference. Result has 550 places, 553 transitions, 1114 flow [2025-01-09 21:18:23,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=550, PETRI_TRANSITIONS=553} [2025-01-09 21:18:23,475 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -23 predicate places. [2025-01-09 21:18:23,476 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 553 transitions, 1114 flow [2025-01-09 21:18:23,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:23,477 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-01-09 21:18:23,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:18:23,477 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:23,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash -350541307, now seen corresponding path program 1 times [2025-01-09 21:18:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:23,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121426167] [2025-01-09 21:18:23,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:18:23,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:18:23,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:23,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121426167] [2025-01-09 21:18:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121426167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:23,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596637401] [2025-01-09 21:18:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:23,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:23,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:23,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 585 [2025-01-09 21:18:23,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 553 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:23,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 585 [2025-01-09 21:18:23,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:23,625 INFO L124 PetriNetUnfolderBase]: 18/660 cut-off events. [2025-01-09 21:18:23,625 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:23,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 660 events. 18/660 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1118 event pairs, 5 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 492. Up to 21 conditions per place. [2025-01-09 21:18:23,628 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 10 selfloop transitions, 2 changer transitions 0/552 dead transitions. [2025-01-09 21:18:23,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1136 flow [2025-01-09 21:18:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1699 transitions. [2025-01-09 21:18:23,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680911680911681 [2025-01-09 21:18:23,631 INFO L175 Difference]: Start difference. First operand has 550 places, 553 transitions, 1114 flow. Second operand 3 states and 1699 transitions. [2025-01-09 21:18:23,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1136 flow [2025-01-09 21:18:23,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:23,637 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1112 flow [2025-01-09 21:18:23,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=549, PETRI_TRANSITIONS=552} [2025-01-09 21:18:23,638 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -24 predicate places. [2025-01-09 21:18:23,638 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1112 flow [2025-01-09 21:18:23,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:23,640 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-01-09 21:18:23,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:18:23,640 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 938247778, now seen corresponding path program 1 times [2025-01-09 21:18:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062315960] [2025-01-09 21:18:23,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:23,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 21:18:23,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 21:18:23,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:23,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062315960] [2025-01-09 21:18:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062315960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989446033] [2025-01-09 21:18:23,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:23,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:23,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:23,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 585 [2025-01-09 21:18:23,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 552 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:23,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 585 [2025-01-09 21:18:23,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:23,829 INFO L124 PetriNetUnfolderBase]: 34/1076 cut-off events. [2025-01-09 21:18:23,830 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:18:23,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 1076 events. 34/1076 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3200 event pairs, 8 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 907. Up to 25 conditions per place. [2025-01-09 21:18:23,835 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 9 selfloop transitions, 1 changer transitions 0/550 dead transitions. [2025-01-09 21:18:23,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 550 transitions, 1128 flow [2025-01-09 21:18:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-01-09 21:18:23,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9709401709401709 [2025-01-09 21:18:23,838 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1112 flow. Second operand 3 states and 1704 transitions. [2025-01-09 21:18:23,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 550 transitions, 1128 flow [2025-01-09 21:18:23,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 550 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:23,844 INFO L231 Difference]: Finished difference. Result has 547 places, 550 transitions, 1106 flow [2025-01-09 21:18:23,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=547, PETRI_TRANSITIONS=550} [2025-01-09 21:18:23,845 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -26 predicate places. [2025-01-09 21:18:23,845 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 550 transitions, 1106 flow [2025-01-09 21:18:23,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:23,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:23,846 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-01-09 21:18:23,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:18:23,846 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:23,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1114842682, now seen corresponding path program 1 times [2025-01-09 21:18:23,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268205656] [2025-01-09 21:18:23,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:23,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:23,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:18:23,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:18:23,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:23,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:25,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:25,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268205656] [2025-01-09 21:18:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268205656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:25,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:18:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664270858] [2025-01-09 21:18:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:25,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:18:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:25,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:18:25,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:18:26,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 585 [2025-01-09 21:18:26,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 550 transitions, 1106 flow. Second operand has 10 states, 10 states have (on average 524.3) internal successors, (5243), 10 states have internal predecessors, (5243), 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-01-09 21:18:26,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:26,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 585 [2025-01-09 21:18:26,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:26,373 INFO L124 PetriNetUnfolderBase]: 126/1101 cut-off events. [2025-01-09 21:18:26,374 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:18:26,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 1101 events. 126/1101 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5097 event pairs, 98 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1213. Up to 242 conditions per place. [2025-01-09 21:18:26,381 INFO L140 encePairwiseOnDemand]: 575/585 looper letters, 42 selfloop transitions, 9 changer transitions 0/549 dead transitions. [2025-01-09 21:18:26,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 549 transitions, 1206 flow [2025-01-09 21:18:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:18:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:18:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5282 transitions. [2025-01-09 21:18:26,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029059829059829 [2025-01-09 21:18:26,390 INFO L175 Difference]: Start difference. First operand has 547 places, 550 transitions, 1106 flow. Second operand 10 states and 5282 transitions. [2025-01-09 21:18:26,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 549 transitions, 1206 flow [2025-01-09 21:18:26,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 549 transitions, 1205 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:26,396 INFO L231 Difference]: Finished difference. Result has 554 places, 549 transitions, 1121 flow [2025-01-09 21:18:26,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1121, PETRI_PLACES=554, PETRI_TRANSITIONS=549} [2025-01-09 21:18:26,397 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -19 predicate places. [2025-01-09 21:18:26,397 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 549 transitions, 1121 flow [2025-01-09 21:18:26,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 524.3) internal successors, (5243), 10 states have internal predecessors, (5243), 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-01-09 21:18:26,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:26,399 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-01-09 21:18:26,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:18:26,399 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1989851024, now seen corresponding path program 1 times [2025-01-09 21:18:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951938834] [2025-01-09 21:18:26,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:26,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 21:18:26,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 21:18:26,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:26,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951938834] [2025-01-09 21:18:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951938834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279234423] [2025-01-09 21:18:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:26,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:26,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:26,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 585 [2025-01-09 21:18:26,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 549 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 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-01-09 21:18:26,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:26,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 585 [2025-01-09 21:18:26,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:26,576 INFO L124 PetriNetUnfolderBase]: 22/676 cut-off events. [2025-01-09 21:18:26,576 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:18:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 676 events. 22/676 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1257 event pairs, 9 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 519. Up to 31 conditions per place. [2025-01-09 21:18:26,580 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 12 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2025-01-09 21:18:26,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 548 transitions, 1147 flow [2025-01-09 21:18:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1695 transitions. [2025-01-09 21:18:26,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9658119658119658 [2025-01-09 21:18:26,583 INFO L175 Difference]: Start difference. First operand has 554 places, 549 transitions, 1121 flow. Second operand 3 states and 1695 transitions. [2025-01-09 21:18:26,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 548 transitions, 1147 flow [2025-01-09 21:18:26,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 548 transitions, 1129 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-09 21:18:26,589 INFO L231 Difference]: Finished difference. Result has 546 places, 548 transitions, 1105 flow [2025-01-09 21:18:26,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=546, PETRI_TRANSITIONS=548} [2025-01-09 21:18:26,589 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -27 predicate places. [2025-01-09 21:18:26,590 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 548 transitions, 1105 flow [2025-01-09 21:18:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 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-01-09 21:18:26,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:26,591 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-01-09 21:18:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:18:26,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1241287133, now seen corresponding path program 1 times [2025-01-09 21:18:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354050976] [2025-01-09 21:18:26,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:26,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:18:26,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:18:26,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:26,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354050976] [2025-01-09 21:18:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354050976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354350190] [2025-01-09 21:18:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:26,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:26,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:26,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:26,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 585 [2025-01-09 21:18:26,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 548 transitions, 1105 flow. Second operand has 3 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 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-01-09 21:18:26,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:26,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 585 [2025-01-09 21:18:26,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:26,790 INFO L124 PetriNetUnfolderBase]: 45/1038 cut-off events. [2025-01-09 21:18:26,790 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:18:26,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1038 events. 45/1038 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3546 event pairs, 20 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 899. Up to 53 conditions per place. [2025-01-09 21:18:26,794 INFO L140 encePairwiseOnDemand]: 580/585 looper letters, 13 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2025-01-09 21:18:26,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 544 transitions, 1125 flow [2025-01-09 21:18:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1692 transitions. [2025-01-09 21:18:26,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641025641025641 [2025-01-09 21:18:26,796 INFO L175 Difference]: Start difference. First operand has 546 places, 548 transitions, 1105 flow. Second operand 3 states and 1692 transitions. [2025-01-09 21:18:26,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 544 transitions, 1125 flow [2025-01-09 21:18:26,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 544 transitions, 1121 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:26,802 INFO L231 Difference]: Finished difference. Result has 542 places, 544 transitions, 1095 flow [2025-01-09 21:18:26,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1095, PETRI_PLACES=542, PETRI_TRANSITIONS=544} [2025-01-09 21:18:26,803 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -31 predicate places. [2025-01-09 21:18:26,803 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 544 transitions, 1095 flow [2025-01-09 21:18:26,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 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-01-09 21:18:26,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:26,803 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-01-09 21:18:26,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:18:26,804 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:26,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1772601421, now seen corresponding path program 1 times [2025-01-09 21:18:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:26,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184771976] [2025-01-09 21:18:26,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:26,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 21:18:26,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 21:18:26,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:26,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184771976] [2025-01-09 21:18:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184771976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:26,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070637840] [2025-01-09 21:18:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:26,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:26,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:26,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:26,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 585 [2025-01-09 21:18:26,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 544 transitions, 1095 flow. Second operand has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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-01-09 21:18:26,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:26,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 585 [2025-01-09 21:18:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:26,952 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2025-01-09 21:18:26,952 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 585 events. 13/585 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 743 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 398. Up to 11 conditions per place. [2025-01-09 21:18:26,955 INFO L140 encePairwiseOnDemand]: 583/585 looper letters, 6 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2025-01-09 21:18:26,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 543 transitions, 1107 flow [2025-01-09 21:18:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2025-01-09 21:18:26,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9754985754985755 [2025-01-09 21:18:26,958 INFO L175 Difference]: Start difference. First operand has 542 places, 544 transitions, 1095 flow. Second operand 3 states and 1712 transitions. [2025-01-09 21:18:26,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 543 transitions, 1107 flow [2025-01-09 21:18:26,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 543 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:26,964 INFO L231 Difference]: Finished difference. Result has 542 places, 543 transitions, 1094 flow [2025-01-09 21:18:26,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1094, PETRI_PLACES=542, PETRI_TRANSITIONS=543} [2025-01-09 21:18:26,965 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -31 predicate places. [2025-01-09 21:18:26,965 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 543 transitions, 1094 flow [2025-01-09 21:18:26,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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-01-09 21:18:26,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:26,965 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-01-09 21:18:26,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:18:26,965 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:26,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1496790140, now seen corresponding path program 1 times [2025-01-09 21:18:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864670654] [2025-01-09 21:18:26,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:26,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 21:18:27,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 21:18:27,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:27,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:27,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864670654] [2025-01-09 21:18:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864670654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872513570] [2025-01-09 21:18:27,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:27,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 585 [2025-01-09 21:18:27,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 543 transitions, 1094 flow. Second operand has 3 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 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-01-09 21:18:27,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:27,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 585 [2025-01-09 21:18:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:27,236 INFO L124 PetriNetUnfolderBase]: 23/712 cut-off events. [2025-01-09 21:18:27,236 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:18:27,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 712 events. 23/712 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1566 event pairs, 8 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 550. Up to 30 conditions per place. [2025-01-09 21:18:27,240 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 13 selfloop transitions, 2 changer transitions 0/542 dead transitions. [2025-01-09 21:18:27,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 542 transitions, 1122 flow [2025-01-09 21:18:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1696 transitions. [2025-01-09 21:18:27,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663817663817664 [2025-01-09 21:18:27,242 INFO L175 Difference]: Start difference. First operand has 542 places, 543 transitions, 1094 flow. Second operand 3 states and 1696 transitions. [2025-01-09 21:18:27,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 542 transitions, 1122 flow [2025-01-09 21:18:27,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 542 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:27,248 INFO L231 Difference]: Finished difference. Result has 542 places, 542 transitions, 1095 flow [2025-01-09 21:18:27,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1095, PETRI_PLACES=542, PETRI_TRANSITIONS=542} [2025-01-09 21:18:27,249 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -31 predicate places. [2025-01-09 21:18:27,249 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 542 transitions, 1095 flow [2025-01-09 21:18:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 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-01-09 21:18:27,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:27,250 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-01-09 21:18:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:18:27,250 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash 952226851, now seen corresponding path program 1 times [2025-01-09 21:18:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49002181] [2025-01-09 21:18:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 21:18:27,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 21:18:27,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:27,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49002181] [2025-01-09 21:18:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49002181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831169499] [2025-01-09 21:18:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:27,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:27,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:27,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:27,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 585 [2025-01-09 21:18:27,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 542 transitions, 1095 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:27,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:27,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 585 [2025-01-09 21:18:27,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:27,473 INFO L124 PetriNetUnfolderBase]: 44/1062 cut-off events. [2025-01-09 21:18:27,474 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:18:27,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1062 events. 44/1062 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3428 event pairs, 2 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 963. Up to 43 conditions per place. [2025-01-09 21:18:27,479 INFO L140 encePairwiseOnDemand]: 579/585 looper letters, 16 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-01-09 21:18:27,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 545 transitions, 1143 flow [2025-01-09 21:18:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2025-01-09 21:18:27,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698005698005698 [2025-01-09 21:18:27,482 INFO L175 Difference]: Start difference. First operand has 542 places, 542 transitions, 1095 flow. Second operand 3 states and 1702 transitions. [2025-01-09 21:18:27,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 545 transitions, 1143 flow [2025-01-09 21:18:27,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:27,491 INFO L231 Difference]: Finished difference. Result has 540 places, 540 transitions, 1098 flow [2025-01-09 21:18:27,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=540, PETRI_TRANSITIONS=540} [2025-01-09 21:18:27,492 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -33 predicate places. [2025-01-09 21:18:27,492 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 540 transitions, 1098 flow [2025-01-09 21:18:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:27,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:27,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:18:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:18:27,492 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -20181062, now seen corresponding path program 1 times [2025-01-09 21:18:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953018804] [2025-01-09 21:18:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:27,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 21:18:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 21:18:27,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:27,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:27,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953018804] [2025-01-09 21:18:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953018804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:27,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920778870] [2025-01-09 21:18:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:27,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:27,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:27,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:27,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 585 [2025-01-09 21:18:27,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 540 transitions, 1098 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-01-09 21:18:27,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:27,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 585 [2025-01-09 21:18:27,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:27,723 INFO L124 PetriNetUnfolderBase]: 45/1355 cut-off events. [2025-01-09 21:18:27,724 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:18:27,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1355 events. 45/1355 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5400 event pairs, 0 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 1230. Up to 38 conditions per place. [2025-01-09 21:18:27,730 INFO L140 encePairwiseOnDemand]: 583/585 looper letters, 10 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2025-01-09 21:18:27,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 542 transitions, 1126 flow [2025-01-09 21:18:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1713 transitions. [2025-01-09 21:18:27,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976068376068376 [2025-01-09 21:18:27,732 INFO L175 Difference]: Start difference. First operand has 540 places, 540 transitions, 1098 flow. Second operand 3 states and 1713 transitions. [2025-01-09 21:18:27,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 542 transitions, 1126 flow [2025-01-09 21:18:27,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 542 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:27,739 INFO L231 Difference]: Finished difference. Result has 540 places, 539 transitions, 1095 flow [2025-01-09 21:18:27,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1095, PETRI_PLACES=540, PETRI_TRANSITIONS=539} [2025-01-09 21:18:27,740 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -33 predicate places. [2025-01-09 21:18:27,740 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 539 transitions, 1095 flow [2025-01-09 21:18:27,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-01-09 21:18:27,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:27,740 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-01-09 21:18:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:18:27,741 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:27,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1456787841, now seen corresponding path program 1 times [2025-01-09 21:18:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:27,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470795572] [2025-01-09 21:18:27,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:27,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 21:18:27,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 21:18:27,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:27,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470795572] [2025-01-09 21:18:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470795572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678251974] [2025-01-09 21:18:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:27,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:27,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:27,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 585 [2025-01-09 21:18:27,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 539 transitions, 1095 flow. Second operand has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:27,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:27,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 585 [2025-01-09 21:18:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:28,024 INFO L124 PetriNetUnfolderBase]: 30/863 cut-off events. [2025-01-09 21:18:28,025 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-01-09 21:18:28,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 863 events. 30/863 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2462 event pairs, 10 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 730. Up to 44 conditions per place. [2025-01-09 21:18:28,030 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 14 selfloop transitions, 2 changer transitions 0/539 dead transitions. [2025-01-09 21:18:28,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 539 transitions, 1127 flow [2025-01-09 21:18:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1699 transitions. [2025-01-09 21:18:28,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680911680911681 [2025-01-09 21:18:28,033 INFO L175 Difference]: Start difference. First operand has 540 places, 539 transitions, 1095 flow. Second operand 3 states and 1699 transitions. [2025-01-09 21:18:28,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 539 transitions, 1127 flow [2025-01-09 21:18:28,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 539 transitions, 1126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:28,039 INFO L231 Difference]: Finished difference. Result has 541 places, 539 transitions, 1102 flow [2025-01-09 21:18:28,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=541, PETRI_TRANSITIONS=539} [2025-01-09 21:18:28,040 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -32 predicate places. [2025-01-09 21:18:28,041 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 539 transitions, 1102 flow [2025-01-09 21:18:28,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:28,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:28,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:18:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:18:28,042 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:28,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2080878652, now seen corresponding path program 1 times [2025-01-09 21:18:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51750197] [2025-01-09 21:18:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:28,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:18:28,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:18:28,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:28,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51750197] [2025-01-09 21:18:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51750197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381710360] [2025-01-09 21:18:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:28,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:28,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:28,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:28,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 585 [2025-01-09 21:18:28,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 539 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-01-09 21:18:28,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:28,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 585 [2025-01-09 21:18:28,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:28,279 INFO L124 PetriNetUnfolderBase]: 49/1453 cut-off events. [2025-01-09 21:18:28,280 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:18:28,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1453 events. 49/1453 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6261 event pairs, 10 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 1525. Up to 38 conditions per place. [2025-01-09 21:18:28,289 INFO L140 encePairwiseOnDemand]: 583/585 looper letters, 10 selfloop transitions, 1 changer transitions 0/541 dead transitions. [2025-01-09 21:18:28,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 541 transitions, 1130 flow [2025-01-09 21:18:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1713 transitions. [2025-01-09 21:18:28,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976068376068376 [2025-01-09 21:18:28,292 INFO L175 Difference]: Start difference. First operand has 541 places, 539 transitions, 1102 flow. Second operand 3 states and 1713 transitions. [2025-01-09 21:18:28,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 541 transitions, 1130 flow [2025-01-09 21:18:28,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 541 transitions, 1128 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:28,298 INFO L231 Difference]: Finished difference. Result has 541 places, 538 transitions, 1100 flow [2025-01-09 21:18:28,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=541, PETRI_TRANSITIONS=538} [2025-01-09 21:18:28,300 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -32 predicate places. [2025-01-09 21:18:28,300 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 538 transitions, 1100 flow [2025-01-09 21:18:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-01-09 21:18:28,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:28,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:18:28,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:18:28,301 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash -884734694, now seen corresponding path program 1 times [2025-01-09 21:18:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654607969] [2025-01-09 21:18:28,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:28,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 21:18:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 21:18:28,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654607969] [2025-01-09 21:18:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654607969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:28,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991578319] [2025-01-09 21:18:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:28,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:28,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:28,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:28,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 585 [2025-01-09 21:18:28,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 538 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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-01-09 21:18:28,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:28,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 585 [2025-01-09 21:18:28,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:28,475 INFO L124 PetriNetUnfolderBase]: 23/802 cut-off events. [2025-01-09 21:18:28,475 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2025-01-09 21:18:28,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 802 events. 23/802 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2023 event pairs, 6 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 650. Up to 24 conditions per place. [2025-01-09 21:18:28,479 INFO L140 encePairwiseOnDemand]: 583/585 looper letters, 7 selfloop transitions, 1 changer transitions 1/538 dead transitions. [2025-01-09 21:18:28,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 538 transitions, 1119 flow [2025-01-09 21:18:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1711 transitions. [2025-01-09 21:18:28,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9749287749287749 [2025-01-09 21:18:28,482 INFO L175 Difference]: Start difference. First operand has 541 places, 538 transitions, 1100 flow. Second operand 3 states and 1711 transitions. [2025-01-09 21:18:28,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 538 transitions, 1119 flow [2025-01-09 21:18:28,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 538 transitions, 1118 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:28,487 INFO L231 Difference]: Finished difference. Result has 541 places, 537 transitions, 1099 flow [2025-01-09 21:18:28,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=541, PETRI_TRANSITIONS=537} [2025-01-09 21:18:28,488 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -32 predicate places. [2025-01-09 21:18:28,488 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 537 transitions, 1099 flow [2025-01-09 21:18:28,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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-01-09 21:18:28,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:28,489 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] [2025-01-09 21:18:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:18:28,489 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash -473604838, now seen corresponding path program 1 times [2025-01-09 21:18:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736990630] [2025-01-09 21:18:28,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:28,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 21:18:28,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 21:18:28,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:28,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736990630] [2025-01-09 21:18:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736990630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:30,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:30,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:18:30,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128756877] [2025-01-09 21:18:30,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:30,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:18:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:30,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:18:30,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:18:30,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 521 out of 585 [2025-01-09 21:18:30,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 537 transitions, 1099 flow. Second operand has 10 states, 10 states have (on average 523.0) internal successors, (5230), 10 states have internal predecessors, (5230), 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-01-09 21:18:30,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:30,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 521 of 585 [2025-01-09 21:18:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:31,261 INFO L124 PetriNetUnfolderBase]: 303/2845 cut-off events. [2025-01-09 21:18:31,261 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:18:31,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2845 events. 303/2845 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 21910 event pairs, 47 based on Foata normal form. 0/2697 useless extension candidates. Maximal degree in co-relation 3306. Up to 323 conditions per place. [2025-01-09 21:18:31,270 INFO L140 encePairwiseOnDemand]: 551/585 looper letters, 67 selfloop transitions, 45 changer transitions 6/595 dead transitions. [2025-01-09 21:18:31,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 595 transitions, 1457 flow [2025-01-09 21:18:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:18:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:18:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5326 transitions. [2025-01-09 21:18:31,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9104273504273505 [2025-01-09 21:18:31,276 INFO L175 Difference]: Start difference. First operand has 541 places, 537 transitions, 1099 flow. Second operand 10 states and 5326 transitions. [2025-01-09 21:18:31,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 595 transitions, 1457 flow [2025-01-09 21:18:31,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 595 transitions, 1456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:31,283 INFO L231 Difference]: Finished difference. Result has 558 places, 574 transitions, 1415 flow [2025-01-09 21:18:31,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1415, PETRI_PLACES=558, PETRI_TRANSITIONS=574} [2025-01-09 21:18:31,284 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, -15 predicate places. [2025-01-09 21:18:31,284 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 574 transitions, 1415 flow [2025-01-09 21:18:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 523.0) internal successors, (5230), 10 states have internal predecessors, (5230), 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-01-09 21:18:31,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:31,285 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] [2025-01-09 21:18:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:18:31,285 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:31,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash -502729785, now seen corresponding path program 1 times [2025-01-09 21:18:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215154924] [2025-01-09 21:18:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:31,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 21:18:31,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 21:18:31,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:31,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:36,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215154924] [2025-01-09 21:18:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215154924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:36,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:36,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-01-09 21:18:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355237005] [2025-01-09 21:18:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:36,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 21:18:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:36,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 21:18:36,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 21:18:40,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 585 [2025-01-09 21:18:40,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 574 transitions, 1415 flow. Second operand has 35 states, 35 states have (on average 478.22857142857146) internal successors, (16738), 35 states have internal predecessors, (16738), 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-01-09 21:18:40,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:40,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 585 [2025-01-09 21:18:40,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:43,978 INFO L124 PetriNetUnfolderBase]: 840/4677 cut-off events. [2025-01-09 21:18:43,978 INFO L125 PetriNetUnfolderBase]: For 699/767 co-relation queries the response was YES. [2025-01-09 21:18:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7691 conditions, 4677 events. 840/4677 cut-off events. For 699/767 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 39567 event pairs, 29 based on Foata normal form. 74/4559 useless extension candidates. Maximal degree in co-relation 7438. Up to 548 conditions per place. [2025-01-09 21:18:44,002 INFO L140 encePairwiseOnDemand]: 512/585 looper letters, 186 selfloop transitions, 103 changer transitions 0/723 dead transitions. [2025-01-09 21:18:44,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 723 transitions, 2571 flow [2025-01-09 21:18:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 21:18:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-09 21:18:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 15483 transitions. [2025-01-09 21:18:44,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8270833333333333 [2025-01-09 21:18:44,010 INFO L175 Difference]: Start difference. First operand has 558 places, 574 transitions, 1415 flow. Second operand 32 states and 15483 transitions. [2025-01-09 21:18:44,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 723 transitions, 2571 flow [2025-01-09 21:18:44,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 723 transitions, 2571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:18:44,021 INFO L231 Difference]: Finished difference. Result has 594 places, 608 transitions, 1979 flow [2025-01-09 21:18:44,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1979, PETRI_PLACES=594, PETRI_TRANSITIONS=608} [2025-01-09 21:18:44,022 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, 21 predicate places. [2025-01-09 21:18:44,022 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 608 transitions, 1979 flow [2025-01-09 21:18:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 478.22857142857146) internal successors, (16738), 35 states have internal predecessors, (16738), 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-01-09 21:18:44,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:44,025 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] [2025-01-09 21:18:44,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:18:44,026 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1532962231, now seen corresponding path program 2 times [2025-01-09 21:18:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369185154] [2025-01-09 21:18:44,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:18:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:44,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 360 statements into 2 equivalence classes. [2025-01-09 21:18:44,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 357 of 360 statements. [2025-01-09 21:18:44,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:18:44,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:48,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:48,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369185154] [2025-01-09 21:18:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369185154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:48,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-01-09 21:18:48,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977447938] [2025-01-09 21:18:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:48,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 21:18:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:48,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 21:18:48,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 21:18:51,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 585 [2025-01-09 21:18:51,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 608 transitions, 1979 flow. Second operand has 35 states, 35 states have (on average 478.22857142857146) internal successors, (16738), 35 states have internal predecessors, (16738), 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-01-09 21:18:51,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:51,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 585 [2025-01-09 21:18:51,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:54,536 INFO L124 PetriNetUnfolderBase]: 1125/6023 cut-off events. [2025-01-09 21:18:54,536 INFO L125 PetriNetUnfolderBase]: For 4783/5567 co-relation queries the response was YES. [2025-01-09 21:18:54,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11886 conditions, 6023 events. 1125/6023 cut-off events. For 4783/5567 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 53751 event pairs, 84 based on Foata normal form. 162/5913 useless extension candidates. Maximal degree in co-relation 11588. Up to 608 conditions per place. [2025-01-09 21:18:54,577 INFO L140 encePairwiseOnDemand]: 520/585 looper letters, 346 selfloop transitions, 139 changer transitions 12/931 dead transitions. [2025-01-09 21:18:54,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 931 transitions, 5131 flow [2025-01-09 21:18:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 21:18:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-01-09 21:18:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16957 transitions. [2025-01-09 21:18:54,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8281807081807082 [2025-01-09 21:18:54,585 INFO L175 Difference]: Start difference. First operand has 594 places, 608 transitions, 1979 flow. Second operand 35 states and 16957 transitions. [2025-01-09 21:18:54,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 931 transitions, 5131 flow [2025-01-09 21:18:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 931 transitions, 5039 flow, removed 0 selfloop flow, removed 20 redundant places. [2025-01-09 21:18:54,612 INFO L231 Difference]: Finished difference. Result has 624 places, 695 transitions, 3180 flow [2025-01-09 21:18:54,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3180, PETRI_PLACES=624, PETRI_TRANSITIONS=695} [2025-01-09 21:18:54,613 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, 51 predicate places. [2025-01-09 21:18:54,613 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 695 transitions, 3180 flow [2025-01-09 21:18:54,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 478.22857142857146) internal successors, (16738), 35 states have internal predecessors, (16738), 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-01-09 21:18:54,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:54,617 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] [2025-01-09 21:18:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:18:54,617 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:18:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 395623099, now seen corresponding path program 3 times [2025-01-09 21:18:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276676787] [2025-01-09 21:18:54,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:18:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:54,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 2 equivalence classes. [2025-01-09 21:18:54,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 357 of 360 statements. [2025-01-09 21:18:54,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:18:54,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:18:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276676787] [2025-01-09 21:18:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276676787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-01-09 21:18:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61621879] [2025-01-09 21:18:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:58,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 21:18:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:58,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 21:18:58,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 21:19:01,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 585 [2025-01-09 21:19:01,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 695 transitions, 3180 flow. Second operand has 35 states, 35 states have (on average 478.22857142857146) internal successors, (16738), 35 states have internal predecessors, (16738), 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-01-09 21:19:01,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:19:01,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 585 [2025-01-09 21:19:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:19:05,113 INFO L124 PetriNetUnfolderBase]: 1273/6899 cut-off events. [2025-01-09 21:19:05,113 INFO L125 PetriNetUnfolderBase]: For 10691/11065 co-relation queries the response was YES. [2025-01-09 21:19:05,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16113 conditions, 6899 events. 1273/6899 cut-off events. For 10691/11065 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 64981 event pairs, 52 based on Foata normal form. 268/6847 useless extension candidates. Maximal degree in co-relation 15784. Up to 799 conditions per place. [2025-01-09 21:19:05,168 INFO L140 encePairwiseOnDemand]: 512/585 looper letters, 290 selfloop transitions, 172 changer transitions 0/896 dead transitions. [2025-01-09 21:19:05,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 896 transitions, 5712 flow [2025-01-09 21:19:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 21:19:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-09 21:19:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 15965 transitions. [2025-01-09 21:19:05,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.826987826987827 [2025-01-09 21:19:05,175 INFO L175 Difference]: Start difference. First operand has 624 places, 695 transitions, 3180 flow. Second operand 33 states and 15965 transitions. [2025-01-09 21:19:05,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 896 transitions, 5712 flow [2025-01-09 21:19:05,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 896 transitions, 5627 flow, removed 25 selfloop flow, removed 18 redundant places. [2025-01-09 21:19:05,234 INFO L231 Difference]: Finished difference. Result has 649 places, 743 transitions, 4364 flow [2025-01-09 21:19:05,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=585, PETRI_DIFFERENCE_MINUEND_FLOW=3125, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4364, PETRI_PLACES=649, PETRI_TRANSITIONS=743} [2025-01-09 21:19:05,235 INFO L279 CegarLoopForPetriNet]: 573 programPoint places, 76 predicate places. [2025-01-09 21:19:05,235 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 743 transitions, 4364 flow [2025-01-09 21:19:05,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 478.22857142857146) internal successors, (16738), 35 states have internal predecessors, (16738), 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-01-09 21:19:05,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:19:05,237 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] [2025-01-09 21:19:05,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:19:05,238 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:19:05,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:19:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1070027747, now seen corresponding path program 4 times [2025-01-09 21:19:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:19:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992579108] [2025-01-09 21:19:05,239 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:19:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:19:05,262 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 360 statements into 2 equivalence classes. [2025-01-09 21:19:05,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 21:19:05,315 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:19:05,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:19:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:19:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:19:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992579108] [2025-01-09 21:19:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992579108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:19:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892196429] [2025-01-09 21:19:10,255 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:19:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:19:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:19:10,258 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-01-09 21:19:10,259 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-01-09 21:19:10,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 360 statements into 2 equivalence classes. [2025-01-09 21:19:10,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 21:19:10,716 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:19:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:19:10,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-01-09 21:19:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:19:10,942 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:10,942 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-01-09 21:19:10,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:10,987 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-01-09 21:19:11,026 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,026 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-01-09 21:19:11,065 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,066 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-01-09 21:19:11,107 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,108 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-01-09 21:19:11,148 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,148 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-01-09 21:19:11,189 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,190 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-01-09 21:19:11,225 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,225 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-01-09 21:19:11,265 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,266 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-01-09 21:19:11,303 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,303 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-01-09 21:19:11,341 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,342 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-01-09 21:19:11,383 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,384 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-01-09 21:19:11,420 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,420 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-01-09 21:19:11,453 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,453 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-01-09 21:19:11,486 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,486 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-01-09 21:19:11,528 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:19:11,529 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-01-09 21:19:11,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:19:11,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:19:12,272 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-01-09 21:19:12,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 21:19:12,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 21:19:12,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-01-09 21:19:12,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-01-09 21:19:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2025-01-09 21:19:12,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2025-01-09 21:19:12,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2025-01-09 21:19:12,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2025-01-09 21:19:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:19:12,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:19:16,946 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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0))))) is different from false [2025-01-09 21:19:16,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.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 (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0))))) is different from false [2025-01-09 21:19:16,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse2 (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.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 (store (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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_1415 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1415) |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-01-09 21:19:34,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:19:34,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 91 [2025-01-09 21:19:34,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:19:34,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 52 [2025-01-09 21:19:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 21:19:34,202 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-01-09 21:19:34,210 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-01-09 21:19:34,216 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-01-09 21:19:34,225 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-01-09 21:19:34,233 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-01-09 21:19:34,238 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-01-09 21:19:34,243 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-01-09 21:19:34,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 1