./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_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_read_nvram_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 f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:18:36,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:18:36,709 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:36,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:18:36,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:18:36,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:18:36,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:18:36,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:18:36,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:18:36,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:18:36,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:18:36,733 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:18:36,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:18:36,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:18:36,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:18:36,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:18:36,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:18:36,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:18:36,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:18:36,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:18:36,735 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 -> f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 [2025-01-09 21:18:36,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:18:36,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:18:36,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:18:36,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:18:36,947 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:18:36,949 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_read_nvram_write_nvram.i [2025-01-09 21:18:38,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10388b28/3b381bbd75314022ae6df3e03a192cfc/FLAG340c718d0 [2025-01-09 21:18:38,621 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:18:38,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-01-09 21:18:38,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10388b28/3b381bbd75314022ae6df3e03a192cfc/FLAG340c718d0 [2025-01-09 21:18:39,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10388b28/3b381bbd75314022ae6df3e03a192cfc [2025-01-09 21:18:39,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:18:39,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:18:39,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:18:39,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:18:39,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:18:39,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:18:39" (1/1) ... [2025-01-09 21:18:39,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b92e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:39, skipping insertion in model container [2025-01-09 21:18:39,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:18:39" (1/1) ... [2025-01-09 21:18:39,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:18:42,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:18:42,209 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:18:42,319 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:42,321 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:42,321 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:42,321 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:42,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-01-09 21:18:42,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:18:42,828 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:18:42,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:42 WrapperNode [2025-01-09 21:18:42,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:18:42,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:18:42,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:18:42,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:18:42,842 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:42" (1/1) ... [2025-01-09 21:18:42,911 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:42" (1/1) ... [2025-01-09 21:18:42,945 INFO L138 Inliner]: procedures = 1354, calls = 1480, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 610 [2025-01-09 21:18:42,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:18:42,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:18:42,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:18:42,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:18:42,956 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:42" (1/1) ... [2025-01-09 21:18:42,956 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:42" (1/1) ... [2025-01-09 21:18:42,962 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:42" (1/1) ... [2025-01-09 21:18:42,962 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:42" (1/1) ... [2025-01-09 21:18:42,995 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:42" (1/1) ... [2025-01-09 21:18:43,000 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:42" (1/1) ... [2025-01-09 21:18:43,002 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:42" (1/1) ... [2025-01-09 21:18:43,016 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:42" (1/1) ... [2025-01-09 21:18:43,018 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:42" (1/1) ... [2025-01-09 21:18:43,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:18:43,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:18:43,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:18:43,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:18:43,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:42" (1/1) ... [2025-01-09 21:18:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:18:43,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:18:43,068 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:43,088 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:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:18:43,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-01-09 21:18:43,104 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:18:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:18:43,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:18:43,105 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-01-09 21:18:43,105 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-01-09 21:18:43,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:18:43,106 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:43,408 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:18:43,410 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:18:43,867 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:18:43,867 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:18:43,941 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:18:43,942 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:18:43,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:18:43 BoogieIcfgContainer [2025-01-09 21:18:43,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:18:43,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:18:43,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:18:43,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:18:43,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:18:39" (1/3) ... [2025-01-09 21:18:43,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f02647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:18:43, skipping insertion in model container [2025-01-09 21:18:43,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:18:42" (2/3) ... [2025-01-09 21:18:43,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f02647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:18:43, skipping insertion in model container [2025-01-09 21:18:43,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:18:43" (3/3) ... [2025-01-09 21:18:43,949 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-01-09 21:18:43,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:18:43,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 590 locations, 1 initial locations, 2 loop locations, and 45 error locations. [2025-01-09 21:18:43,960 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:18:44,057 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:18:44,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 596 places, 608 transitions, 1230 flow [2025-01-09 21:18:44,258 INFO L124 PetriNetUnfolderBase]: 19/606 cut-off events. [2025-01-09 21:18:44,259 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:18:44,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 606 events. 19/606 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 808 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 472. Up to 4 conditions per place. [2025-01-09 21:18:44,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 596 places, 608 transitions, 1230 flow [2025-01-09 21:18:44,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 590 places, 602 transitions, 1213 flow [2025-01-09 21:18:44,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:18:44,330 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;@47871901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:18:44,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-01-09 21:18:44,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:18:44,345 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2025-01-09 21:18:44,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:18:44,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:44,346 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:44,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:44,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1078560022, now seen corresponding path program 1 times [2025-01-09 21:18:44,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956022415] [2025-01-09 21:18:44,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:44,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:18:44,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:18:44,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:44,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:44,717 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:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956022415] [2025-01-09 21:18:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956022415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:44,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800112675] [2025-01-09 21:18:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:44,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:44,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:44,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:44,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 602 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:44,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:44,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:45,046 INFO L124 PetriNetUnfolderBase]: 60/1145 cut-off events. [2025-01-09 21:18:45,047 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-01-09 21:18:45,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 1145 events. 60/1145 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4323 event pairs, 24 based on Foata normal form. 35/1074 useless extension candidates. Maximal degree in co-relation 779. Up to 68 conditions per place. [2025-01-09 21:18:45,059 INFO L140 encePairwiseOnDemand]: 590/608 looper letters, 14 selfloop transitions, 2 changer transitions 1/582 dead transitions. [2025-01-09 21:18:45,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 582 transitions, 1205 flow [2025-01-09 21:18:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1748 transitions. [2025-01-09 21:18:45,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-01-09 21:18:45,074 INFO L175 Difference]: Start difference. First operand has 590 places, 602 transitions, 1213 flow. Second operand 3 states and 1748 transitions. [2025-01-09 21:18:45,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 582 transitions, 1205 flow [2025-01-09 21:18:45,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 582 transitions, 1200 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:18:45,087 INFO L231 Difference]: Finished difference. Result has 576 places, 581 transitions, 1170 flow [2025-01-09 21:18:45,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=576, PETRI_TRANSITIONS=581} [2025-01-09 21:18:45,092 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -14 predicate places. [2025-01-09 21:18:45,092 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 581 transitions, 1170 flow [2025-01-09 21:18:45,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:45,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:45,093 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:45,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:18:45,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:45,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1945187066, now seen corresponding path program 1 times [2025-01-09 21:18:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264564031] [2025-01-09 21:18:45,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:45,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:45,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:18:45,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:18:45,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:18:45,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:45,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264564031] [2025-01-09 21:18:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264564031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:45,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:45,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:45,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640197254] [2025-01-09 21:18:45,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:45,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:45,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 571 out of 608 [2025-01-09 21:18:45,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 581 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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:45,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:45,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 571 of 608 [2025-01-09 21:18:45,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:45,491 INFO L124 PetriNetUnfolderBase]: 61/1184 cut-off events. [2025-01-09 21:18:45,491 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:18:45,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 61/1184 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4456 event pairs, 29 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 1182. Up to 74 conditions per place. [2025-01-09 21:18:45,498 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 15 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2025-01-09 21:18:45,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2025-01-09 21:18:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1731 transitions. [2025-01-09 21:18:45,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490131578947368 [2025-01-09 21:18:45,501 INFO L175 Difference]: Start difference. First operand has 576 places, 581 transitions, 1170 flow. Second operand 3 states and 1731 transitions. [2025-01-09 21:18:45,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2025-01-09 21:18:45,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:45,511 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1168 flow [2025-01-09 21:18:45,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2025-01-09 21:18:45,513 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -16 predicate places. [2025-01-09 21:18:45,513 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1168 flow [2025-01-09 21:18:45,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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:45,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:45,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:18:45,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:18:45,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 421582886, now seen corresponding path program 1 times [2025-01-09 21:18:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:45,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944813950] [2025-01-09 21:18:45,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:45,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:18:45,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:18:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:45,632 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:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944813950] [2025-01-09 21:18:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944813950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931477869] [2025-01-09 21:18:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:45,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:45,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:45,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:45,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:45,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:45,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:45,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:45,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:45,816 INFO L124 PetriNetUnfolderBase]: 60/1142 cut-off events. [2025-01-09 21:18:45,816 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:45,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 1142 events. 60/1142 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4319 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1125. Up to 68 conditions per place. [2025-01-09 21:18:45,824 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2025-01-09 21:18:45,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1198 flow [2025-01-09 21:18:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:45,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:45,828 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1168 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:45,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1198 flow [2025-01-09 21:18:45,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:45,834 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1166 flow [2025-01-09 21:18:45,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2025-01-09 21:18:45,836 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -17 predicate places. [2025-01-09 21:18:45,836 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1166 flow [2025-01-09 21:18:45,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:45,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:45,837 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:45,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:18:45,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -103561423, now seen corresponding path program 1 times [2025-01-09 21:18:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555900822] [2025-01-09 21:18:45,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:45,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:18:45,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:18:45,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:45,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:45,903 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:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555900822] [2025-01-09 21:18:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555900822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:45,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:45,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467079504] [2025-01-09 21:18:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:45,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:45,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:45,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:45,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 571 out of 608 [2025-01-09 21:18:45,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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:45,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:45,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 571 of 608 [2025-01-09 21:18:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:46,060 INFO L124 PetriNetUnfolderBase]: 67/1205 cut-off events. [2025-01-09 21:18:46,060 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-01-09 21:18:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1205 events. 67/1205 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4923 event pairs, 29 based on Foata normal form. 0/1095 useless extension candidates. Maximal degree in co-relation 1193. Up to 80 conditions per place. [2025-01-09 21:18:46,065 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 15 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2025-01-09 21:18:46,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 578 transitions, 1198 flow [2025-01-09 21:18:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1731 transitions. [2025-01-09 21:18:46,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490131578947368 [2025-01-09 21:18:46,068 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1166 flow. Second operand 3 states and 1731 transitions. [2025-01-09 21:18:46,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 578 transitions, 1198 flow [2025-01-09 21:18:46,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:46,073 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1164 flow [2025-01-09 21:18:46,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1164, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2025-01-09 21:18:46,075 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -18 predicate places. [2025-01-09 21:18:46,075 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1164 flow [2025-01-09 21:18:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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:46,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:46,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:18:46,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:18:46,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:46,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1691309556, now seen corresponding path program 1 times [2025-01-09 21:18:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2274112] [2025-01-09 21:18:46,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:18:46,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:18:46,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:46,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:46,167 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:46,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:46,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2274112] [2025-01-09 21:18:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2274112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:46,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099968450] [2025-01-09 21:18:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:46,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:46,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:46,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1164 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:46,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:46,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:46,350 INFO L124 PetriNetUnfolderBase]: 60/1140 cut-off events. [2025-01-09 21:18:46,351 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:46,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 1140 events. 60/1140 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4303 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1109. Up to 68 conditions per place. [2025-01-09 21:18:46,355 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-01-09 21:18:46,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1194 flow [2025-01-09 21:18:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:46,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:46,359 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1164 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:46,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1194 flow [2025-01-09 21:18:46,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:46,366 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1162 flow [2025-01-09 21:18:46,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2025-01-09 21:18:46,367 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -19 predicate places. [2025-01-09 21:18:46,367 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1162 flow [2025-01-09 21:18:46,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:46,368 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:46,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:18:46,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:46,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1640479722, now seen corresponding path program 1 times [2025-01-09 21:18:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850627672] [2025-01-09 21:18:46,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:46,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:18:46,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:18:46,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:46,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:46,434 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:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850627672] [2025-01-09 21:18:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850627672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415781988] [2025-01-09 21:18:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:46,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:46,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:46,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:46,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:46,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:46,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:46,609 INFO L124 PetriNetUnfolderBase]: 60/1139 cut-off events. [2025-01-09 21:18:46,609 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:46,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 1139 events. 60/1139 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4298 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1101. Up to 68 conditions per place. [2025-01-09 21:18:46,615 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2025-01-09 21:18:46,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 576 transitions, 1192 flow [2025-01-09 21:18:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:46,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:46,619 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1162 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:46,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 576 transitions, 1192 flow [2025-01-09 21:18:46,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 576 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:46,626 INFO L231 Difference]: Finished difference. Result has 570 places, 576 transitions, 1160 flow [2025-01-09 21:18:46,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1160, PETRI_PLACES=570, PETRI_TRANSITIONS=576} [2025-01-09 21:18:46,627 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -20 predicate places. [2025-01-09 21:18:46,627 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 576 transitions, 1160 flow [2025-01-09 21:18:46,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:46,628 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:46,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:18:46,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1120249655, now seen corresponding path program 1 times [2025-01-09 21:18:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741363164] [2025-01-09 21:18:46,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:46,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:18:46,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:18:46,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:46,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:46,695 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:46,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741363164] [2025-01-09 21:18:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741363164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:46,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449666822] [2025-01-09 21:18:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:46,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:46,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:46,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:46,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:46,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 576 transitions, 1160 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:46,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:46,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:46,842 INFO L124 PetriNetUnfolderBase]: 60/1138 cut-off events. [2025-01-09 21:18:46,842 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:46,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1138 events. 60/1138 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4297 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1093. Up to 68 conditions per place. [2025-01-09 21:18:46,846 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-01-09 21:18:46,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 575 transitions, 1190 flow [2025-01-09 21:18:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:46,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:46,850 INFO L175 Difference]: Start difference. First operand has 570 places, 576 transitions, 1160 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:46,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 575 transitions, 1190 flow [2025-01-09 21:18:46,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 575 transitions, 1186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:46,856 INFO L231 Difference]: Finished difference. Result has 569 places, 575 transitions, 1158 flow [2025-01-09 21:18:46,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=569, PETRI_TRANSITIONS=575} [2025-01-09 21:18:46,857 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -21 predicate places. [2025-01-09 21:18:46,857 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 575 transitions, 1158 flow [2025-01-09 21:18:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:46,858 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:46,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:18:46,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:46,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1339215459, now seen corresponding path program 1 times [2025-01-09 21:18:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665090722] [2025-01-09 21:18:46,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:46,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 21:18:46,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 21:18:46,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:46,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:46,928 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:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665090722] [2025-01-09 21:18:46,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665090722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:46,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:46,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671346643] [2025-01-09 21:18:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:46,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:46,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:46,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:46,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:46,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 575 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:46,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:46,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:46,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:47,124 INFO L124 PetriNetUnfolderBase]: 60/1137 cut-off events. [2025-01-09 21:18:47,125 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:47,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1137 events. 60/1137 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4308 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1085. Up to 68 conditions per place. [2025-01-09 21:18:47,130 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2025-01-09 21:18:47,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1188 flow [2025-01-09 21:18:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:47,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:47,133 INFO L175 Difference]: Start difference. First operand has 569 places, 575 transitions, 1158 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:47,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1188 flow [2025-01-09 21:18:47,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:47,139 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2025-01-09 21:18:47,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2025-01-09 21:18:47,142 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -22 predicate places. [2025-01-09 21:18:47,142 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2025-01-09 21:18:47,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:47,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:18:47,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:18:47,143 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:47,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1950572187, now seen corresponding path program 1 times [2025-01-09 21:18:47,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:47,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685096248] [2025-01-09 21:18:47,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:47,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:47,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:18:47,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:18:47,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:47,225 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:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:47,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685096248] [2025-01-09 21:18:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685096248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144185755] [2025-01-09 21:18:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:47,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:47,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:47,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:47,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:47,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:47,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:47,381 INFO L124 PetriNetUnfolderBase]: 60/1136 cut-off events. [2025-01-09 21:18:47,381 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:47,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 1136 events. 60/1136 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4311 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1077. Up to 68 conditions per place. [2025-01-09 21:18:47,387 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-01-09 21:18:47,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 573 transitions, 1186 flow [2025-01-09 21:18:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:47,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:47,391 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:47,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 573 transitions, 1186 flow [2025-01-09 21:18:47,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 573 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:47,397 INFO L231 Difference]: Finished difference. Result has 567 places, 573 transitions, 1154 flow [2025-01-09 21:18:47,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=567, PETRI_TRANSITIONS=573} [2025-01-09 21:18:47,400 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -23 predicate places. [2025-01-09 21:18:47,400 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 573 transitions, 1154 flow [2025-01-09 21:18:47,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:47,401 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:47,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:18:47,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:47,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:47,402 INFO L85 PathProgramCache]: Analyzing trace with hash -440781972, now seen corresponding path program 1 times [2025-01-09 21:18:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789350162] [2025-01-09 21:18:47,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:47,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:18:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:18:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:47,466 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:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789350162] [2025-01-09 21:18:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789350162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:47,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347104828] [2025-01-09 21:18:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:47,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:47,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:47,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:47,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 573 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:47,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:47,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:47,621 INFO L124 PetriNetUnfolderBase]: 60/1135 cut-off events. [2025-01-09 21:18:47,622 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:47,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1135 events. 60/1135 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4334 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1069. Up to 68 conditions per place. [2025-01-09 21:18:47,627 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-01-09 21:18:47,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 572 transitions, 1184 flow [2025-01-09 21:18:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:47,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:47,630 INFO L175 Difference]: Start difference. First operand has 567 places, 573 transitions, 1154 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:47,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 572 transitions, 1184 flow [2025-01-09 21:18:47,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 572 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:47,636 INFO L231 Difference]: Finished difference. Result has 566 places, 572 transitions, 1152 flow [2025-01-09 21:18:47,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=566, PETRI_TRANSITIONS=572} [2025-01-09 21:18:47,638 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -24 predicate places. [2025-01-09 21:18:47,639 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 572 transitions, 1152 flow [2025-01-09 21:18:47,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:47,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] [2025-01-09 21:18:47,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:18:47,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:47,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash -414528097, now seen corresponding path program 1 times [2025-01-09 21:18:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354242588] [2025-01-09 21:18:47,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:47,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:18:47,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:18:47,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:47,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:47,712 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:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354242588] [2025-01-09 21:18:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354242588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390240424] [2025-01-09 21:18:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:47,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:47,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:47,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 572 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:47,874 INFO L124 PetriNetUnfolderBase]: 60/1134 cut-off events. [2025-01-09 21:18:47,874 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:47,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 1134 events. 60/1134 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4333 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1061. Up to 68 conditions per place. [2025-01-09 21:18:47,879 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-01-09 21:18:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 571 transitions, 1182 flow [2025-01-09 21:18:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:47,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:47,882 INFO L175 Difference]: Start difference. First operand has 566 places, 572 transitions, 1152 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:47,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 571 transitions, 1182 flow [2025-01-09 21:18:47,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 571 transitions, 1178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:47,889 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1150 flow [2025-01-09 21:18:47,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=565, PETRI_TRANSITIONS=571} [2025-01-09 21:18:47,891 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -25 predicate places. [2025-01-09 21:18:47,891 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1150 flow [2025-01-09 21:18:47,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:47,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:47,892 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:47,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:18:47,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:47,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1283857166, now seen corresponding path program 1 times [2025-01-09 21:18:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120354885] [2025-01-09 21:18:47,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:18:47,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:18:47,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:47,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:47,965 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:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:47,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120354885] [2025-01-09 21:18:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120354885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:47,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418266819] [2025-01-09 21:18:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:47,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:47,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:47,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:48,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 608 [2025-01-09 21:18:48,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 571 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 571.3333333333334) internal successors, (1714), 3 states have internal predecessors, (1714), 0 states have call successors, (0), 0 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:48,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:48,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 608 [2025-01-09 21:18:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:48,145 INFO L124 PetriNetUnfolderBase]: 72/1282 cut-off events. [2025-01-09 21:18:48,146 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:18:48,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1282 events. 72/1282 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5288 event pairs, 35 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1223. Up to 87 conditions per place. [2025-01-09 21:18:48,152 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 16 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-01-09 21:18:48,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1184 flow [2025-01-09 21:18:48,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1729 transitions. [2025-01-09 21:18:48,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479166666666666 [2025-01-09 21:18:48,155 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1150 flow. Second operand 3 states and 1729 transitions. [2025-01-09 21:18:48,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1184 flow [2025-01-09 21:18:48,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:48,161 INFO L231 Difference]: Finished difference. Result has 564 places, 570 transitions, 1148 flow [2025-01-09 21:18:48,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=564, PETRI_TRANSITIONS=570} [2025-01-09 21:18:48,163 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -26 predicate places. [2025-01-09 21:18:48,163 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 570 transitions, 1148 flow [2025-01-09 21:18:48,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 571.3333333333334) internal successors, (1714), 3 states have internal predecessors, (1714), 0 states have call successors, (0), 0 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:48,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:48,164 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:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:18:48,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:48,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2110528967, now seen corresponding path program 1 times [2025-01-09 21:18:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771616995] [2025-01-09 21:18:48,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:48,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:18:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:18:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:48,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:48,264 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:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771616995] [2025-01-09 21:18:48,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771616995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:48,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:48,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388138825] [2025-01-09 21:18:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:48,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:48,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:48,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:48,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:48,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 570 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:48,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:48,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:48,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:48,384 INFO L124 PetriNetUnfolderBase]: 60/1132 cut-off events. [2025-01-09 21:18:48,384 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:48,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 1132 events. 60/1132 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4327 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1045. Up to 68 conditions per place. [2025-01-09 21:18:48,389 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2025-01-09 21:18:48,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 569 transitions, 1178 flow [2025-01-09 21:18:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:48,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:48,393 INFO L175 Difference]: Start difference. First operand has 564 places, 570 transitions, 1148 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:48,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 569 transitions, 1178 flow [2025-01-09 21:18:48,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 569 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:48,398 INFO L231 Difference]: Finished difference. Result has 563 places, 569 transitions, 1146 flow [2025-01-09 21:18:48,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=563, PETRI_TRANSITIONS=569} [2025-01-09 21:18:48,399 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -27 predicate places. [2025-01-09 21:18:48,399 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 569 transitions, 1146 flow [2025-01-09 21:18:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:48,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:48,400 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:48,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:18:48,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:48,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1690630126, now seen corresponding path program 1 times [2025-01-09 21:18:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:48,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982114303] [2025-01-09 21:18:48,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:48,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:18:48,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:18:48,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:48,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:48,458 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:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982114303] [2025-01-09 21:18:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982114303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:48,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:48,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:48,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068581089] [2025-01-09 21:18:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:48,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:48,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:48,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:48,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:48,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 569 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:48,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:48,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:48,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:48,638 INFO L124 PetriNetUnfolderBase]: 60/1131 cut-off events. [2025-01-09 21:18:48,638 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:48,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1131 events. 60/1131 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4326 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1037. Up to 68 conditions per place. [2025-01-09 21:18:48,645 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-01-09 21:18:48,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 568 transitions, 1176 flow [2025-01-09 21:18:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:48,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:48,649 INFO L175 Difference]: Start difference. First operand has 563 places, 569 transitions, 1146 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:48,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 568 transitions, 1176 flow [2025-01-09 21:18:48,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 568 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:48,656 INFO L231 Difference]: Finished difference. Result has 562 places, 568 transitions, 1144 flow [2025-01-09 21:18:48,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=562, PETRI_TRANSITIONS=568} [2025-01-09 21:18:48,658 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -28 predicate places. [2025-01-09 21:18:48,658 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 568 transitions, 1144 flow [2025-01-09 21:18:48,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:48,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:48,659 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:48,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:18:48,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:48,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1399424162, now seen corresponding path program 1 times [2025-01-09 21:18:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439281471] [2025-01-09 21:18:48,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:48,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:18:48,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:18:48,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:48,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:48,733 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:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439281471] [2025-01-09 21:18:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439281471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:48,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193125252] [2025-01-09 21:18:48,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:48,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:48,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:48,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:48,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:48,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:48,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:48,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:48,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:48,903 INFO L124 PetriNetUnfolderBase]: 60/1130 cut-off events. [2025-01-09 21:18:48,903 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:48,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 1130 events. 60/1130 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4326 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1029. Up to 68 conditions per place. [2025-01-09 21:18:48,911 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-01-09 21:18:48,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 567 transitions, 1174 flow [2025-01-09 21:18:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:48,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:48,916 INFO L175 Difference]: Start difference. First operand has 562 places, 568 transitions, 1144 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:48,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 567 transitions, 1174 flow [2025-01-09 21:18:48,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 567 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:48,923 INFO L231 Difference]: Finished difference. Result has 561 places, 567 transitions, 1142 flow [2025-01-09 21:18:48,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=559, 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=561, PETRI_TRANSITIONS=567} [2025-01-09 21:18:48,925 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -29 predicate places. [2025-01-09 21:18:48,925 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 567 transitions, 1142 flow [2025-01-09 21:18:48,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:48,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:48,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:18:48,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:48,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1260944114, now seen corresponding path program 1 times [2025-01-09 21:18:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382023389] [2025-01-09 21:18:48,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:48,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:18:48,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:18:48,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:48,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:49,057 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:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382023389] [2025-01-09 21:18:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382023389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432645640] [2025-01-09 21:18:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:49,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:49,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:49,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:49,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:49,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:49,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:49,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:49,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:49,217 INFO L124 PetriNetUnfolderBase]: 60/1129 cut-off events. [2025-01-09 21:18:49,217 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:49,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1129 events. 60/1129 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4315 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1021. Up to 68 conditions per place. [2025-01-09 21:18:49,220 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-01-09 21:18:49,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 566 transitions, 1172 flow [2025-01-09 21:18:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-01-09 21:18:49,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-01-09 21:18:49,225 INFO L175 Difference]: Start difference. First operand has 561 places, 567 transitions, 1142 flow. Second operand 3 states and 1733 transitions. [2025-01-09 21:18:49,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 566 transitions, 1172 flow [2025-01-09 21:18:49,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 566 transitions, 1168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:49,230 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1140 flow [2025-01-09 21:18:49,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, 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=560, PETRI_TRANSITIONS=566} [2025-01-09 21:18:49,230 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -30 predicate places. [2025-01-09 21:18:49,231 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1140 flow [2025-01-09 21:18:49,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:49,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:49,231 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:49,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:18:49,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 308403293, now seen corresponding path program 1 times [2025-01-09 21:18:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708555271] [2025-01-09 21:18:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:49,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:18:49,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:18:49,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:49,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:49,292 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:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708555271] [2025-01-09 21:18:49,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708555271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:49,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:49,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667636071] [2025-01-09 21:18:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:49,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:49,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:49,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:49,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-01-09 21:18:49,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:49,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:49,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-01-09 21:18:49,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:49,438 INFO L124 PetriNetUnfolderBase]: 78/1311 cut-off events. [2025-01-09 21:18:49,438 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-01-09 21:18:49,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1311 events. 78/1311 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5852 event pairs, 35 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 1224. Up to 94 conditions per place. [2025-01-09 21:18:49,442 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 17 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-01-09 21:18:49,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 565 transitions, 1176 flow [2025-01-09 21:18:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2025-01-09 21:18:49,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468201754385965 [2025-01-09 21:18:49,445 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1140 flow. Second operand 3 states and 1727 transitions. [2025-01-09 21:18:49,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 565 transitions, 1176 flow [2025-01-09 21:18:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 565 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:49,450 INFO L231 Difference]: Finished difference. Result has 559 places, 565 transitions, 1138 flow [2025-01-09 21:18:49,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=557, 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=559, PETRI_TRANSITIONS=565} [2025-01-09 21:18:49,451 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -31 predicate places. [2025-01-09 21:18:49,451 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 565 transitions, 1138 flow [2025-01-09 21:18:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:49,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:49,452 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:49,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:18:49,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash 499708811, now seen corresponding path program 1 times [2025-01-09 21:18:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481073192] [2025-01-09 21:18:49,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 21:18:49,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 21:18:49,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:49,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:49,512 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:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481073192] [2025-01-09 21:18:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481073192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219321785] [2025-01-09 21:18:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:49,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:49,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:49,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:49,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-01-09 21:18:49,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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:49,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:49,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-01-09 21:18:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:49,682 INFO L124 PetriNetUnfolderBase]: 105/1572 cut-off events. [2025-01-09 21:18:49,683 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:18:49,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1572 events. 105/1572 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7799 event pairs, 48 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 1504. Up to 118 conditions per place. [2025-01-09 21:18:49,686 INFO L140 encePairwiseOnDemand]: 604/608 looper letters, 17 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2025-01-09 21:18:49,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 562 transitions, 1168 flow [2025-01-09 21:18:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1728 transitions. [2025-01-09 21:18:49,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-01-09 21:18:49,689 INFO L175 Difference]: Start difference. First operand has 559 places, 565 transitions, 1138 flow. Second operand 3 states and 1728 transitions. [2025-01-09 21:18:49,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 562 transitions, 1168 flow [2025-01-09 21:18:49,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:49,694 INFO L231 Difference]: Finished difference. Result has 556 places, 562 transitions, 1130 flow [2025-01-09 21:18:49,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=556, PETRI_TRANSITIONS=562} [2025-01-09 21:18:49,694 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -34 predicate places. [2025-01-09 21:18:49,694 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 562 transitions, 1130 flow [2025-01-09 21:18:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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:49,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:49,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:18:49,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:49,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1754065633, now seen corresponding path program 1 times [2025-01-09 21:18:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864031500] [2025-01-09 21:18:49,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:49,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:18:49,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:18:49,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:49,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:51,998 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:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864031500] [2025-01-09 21:18:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864031500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:18:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478073729] [2025-01-09 21:18:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:51,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:18:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:18:52,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:18:52,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 608 [2025-01-09 21:18:52,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 562 transitions, 1130 flow. Second operand has 10 states, 10 states have (on average 564.3) internal successors, (5643), 10 states have internal predecessors, (5643), 0 states have call successors, (0), 0 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:52,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:52,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 608 [2025-01-09 21:18:52,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:52,261 INFO L124 PetriNetUnfolderBase]: 60/1121 cut-off events. [2025-01-09 21:18:52,261 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:52,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1121 events. 60/1121 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4300 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1005. Up to 70 conditions per place. [2025-01-09 21:18:52,265 INFO L140 encePairwiseOnDemand]: 598/608 looper letters, 16 selfloop transitions, 9 changer transitions 0/561 dead transitions. [2025-01-09 21:18:52,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 561 transitions, 1178 flow [2025-01-09 21:18:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:18:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:18:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5656 transitions. [2025-01-09 21:18:52,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302631578947368 [2025-01-09 21:18:52,274 INFO L175 Difference]: Start difference. First operand has 556 places, 562 transitions, 1130 flow. Second operand 10 states and 5656 transitions. [2025-01-09 21:18:52,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 561 transitions, 1178 flow [2025-01-09 21:18:52,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 561 transitions, 1177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:52,280 INFO L231 Difference]: Finished difference. Result has 563 places, 561 transitions, 1145 flow [2025-01-09 21:18:52,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1145, PETRI_PLACES=563, PETRI_TRANSITIONS=561} [2025-01-09 21:18:52,281 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -27 predicate places. [2025-01-09 21:18:52,281 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 561 transitions, 1145 flow [2025-01-09 21:18:52,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 564.3) internal successors, (5643), 10 states have internal predecessors, (5643), 0 states have call successors, (0), 0 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:52,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:52,286 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:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:18:52,286 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:52,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash -675044715, now seen corresponding path program 1 times [2025-01-09 21:18:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306486159] [2025-01-09 21:18:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:52,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 21:18:52,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 21:18:52,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:52,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:52,395 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:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:52,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306486159] [2025-01-09 21:18:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306486159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048755391] [2025-01-09 21:18:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:52,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:52,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:52,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:52,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-01-09 21:18:52,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 561 transitions, 1145 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:52,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:52,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-01-09 21:18:52,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:52,831 INFO L124 PetriNetUnfolderBase]: 78/1304 cut-off events. [2025-01-09 21:18:52,832 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-01-09 21:18:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1304 events. 78/1304 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5816 event pairs, 35 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1218. Up to 94 conditions per place. [2025-01-09 21:18:52,846 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 17 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-01-09 21:18:52,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 560 transitions, 1181 flow [2025-01-09 21:18:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2025-01-09 21:18:52,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468201754385965 [2025-01-09 21:18:52,850 INFO L175 Difference]: Start difference. First operand has 563 places, 561 transitions, 1145 flow. Second operand 3 states and 1727 transitions. [2025-01-09 21:18:52,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 560 transitions, 1181 flow [2025-01-09 21:18:52,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 560 transitions, 1163 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-09 21:18:52,856 INFO L231 Difference]: Finished difference. Result has 555 places, 560 transitions, 1129 flow [2025-01-09 21:18:52,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, 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=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=560} [2025-01-09 21:18:52,857 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -35 predicate places. [2025-01-09 21:18:52,857 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 560 transitions, 1129 flow [2025-01-09 21:18:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:52,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:52,858 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:52,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:18:52,858 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:52,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:52,859 INFO L85 PathProgramCache]: Analyzing trace with hash 865797123, now seen corresponding path program 1 times [2025-01-09 21:18:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:52,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181452760] [2025-01-09 21:18:52,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:52,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:18:52,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:18:52,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:52,950 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:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181452760] [2025-01-09 21:18:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181452760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:52,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:52,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911332808] [2025-01-09 21:18:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:52,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:52,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:52,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:52,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-01-09 21:18:52,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 560 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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:52,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:52,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-01-09 21:18:52,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:53,162 INFO L124 PetriNetUnfolderBase]: 105/1580 cut-off events. [2025-01-09 21:18:53,163 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:18:53,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 1580 events. 105/1580 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7982 event pairs, 48 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 1514. Up to 118 conditions per place. [2025-01-09 21:18:53,167 INFO L140 encePairwiseOnDemand]: 604/608 looper letters, 17 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2025-01-09 21:18:53,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 557 transitions, 1159 flow [2025-01-09 21:18:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1728 transitions. [2025-01-09 21:18:53,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-01-09 21:18:53,170 INFO L175 Difference]: Start difference. First operand has 555 places, 560 transitions, 1129 flow. Second operand 3 states and 1728 transitions. [2025-01-09 21:18:53,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 557 transitions, 1159 flow [2025-01-09 21:18:53,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:53,175 INFO L231 Difference]: Finished difference. Result has 552 places, 557 transitions, 1121 flow [2025-01-09 21:18:53,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=552, PETRI_TRANSITIONS=557} [2025-01-09 21:18:53,176 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -38 predicate places. [2025-01-09 21:18:53,176 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 557 transitions, 1121 flow [2025-01-09 21:18:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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:53,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:53,176 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:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:18:53,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -174084867, now seen corresponding path program 1 times [2025-01-09 21:18:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553137987] [2025-01-09 21:18:53,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:53,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 21:18:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 21:18:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553137987] [2025-01-09 21:18:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553137987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396123748] [2025-01-09 21:18:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:53,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:53,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:53,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:53,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 608 [2025-01-09 21:18:53,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 557 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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:53,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:53,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 608 [2025-01-09 21:18:53,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:53,448 INFO L124 PetriNetUnfolderBase]: 60/1113 cut-off events. [2025-01-09 21:18:53,449 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:18:53,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1113 events. 60/1113 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4237 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 989. Up to 66 conditions per place. [2025-01-09 21:18:53,454 INFO L140 encePairwiseOnDemand]: 606/608 looper letters, 12 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2025-01-09 21:18:53,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 556 transitions, 1145 flow [2025-01-09 21:18:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1742 transitions. [2025-01-09 21:18:53,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550438596491229 [2025-01-09 21:18:53,458 INFO L175 Difference]: Start difference. First operand has 552 places, 557 transitions, 1121 flow. Second operand 3 states and 1742 transitions. [2025-01-09 21:18:53,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 556 transitions, 1145 flow [2025-01-09 21:18:53,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 556 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:53,465 INFO L231 Difference]: Finished difference. Result has 552 places, 556 transitions, 1120 flow [2025-01-09 21:18:53,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=552, PETRI_TRANSITIONS=556} [2025-01-09 21:18:53,466 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -38 predicate places. [2025-01-09 21:18:53,466 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 556 transitions, 1120 flow [2025-01-09 21:18:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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:53,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:53,468 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:53,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:18:53,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:53,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1782367722, now seen corresponding path program 1 times [2025-01-09 21:18:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:53,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147957543] [2025-01-09 21:18:53,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 21:18:53,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 21:18:53,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147957543] [2025-01-09 21:18:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147957543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833280713] [2025-01-09 21:18:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:53,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:53,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:53,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 608 [2025-01-09 21:18:53,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 556 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:53,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:53,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 608 [2025-01-09 21:18:53,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:53,727 INFO L124 PetriNetUnfolderBase]: 105/1353 cut-off events. [2025-01-09 21:18:53,727 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-01-09 21:18:53,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 1353 events. 105/1353 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6625 event pairs, 48 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 1299. Up to 130 conditions per place. [2025-01-09 21:18:53,733 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 21 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-01-09 21:18:53,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 555 transitions, 1164 flow [2025-01-09 21:18:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions. [2025-01-09 21:18:53,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944078947368421 [2025-01-09 21:18:53,736 INFO L175 Difference]: Start difference. First operand has 552 places, 556 transitions, 1120 flow. Second operand 3 states and 1722 transitions. [2025-01-09 21:18:53,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 555 transitions, 1164 flow [2025-01-09 21:18:53,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:53,741 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1121 flow [2025-01-09 21:18:53,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1117, 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=1121, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-01-09 21:18:53,742 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -38 predicate places. [2025-01-09 21:18:53,742 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1121 flow [2025-01-09 21:18:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:18:53,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:53,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:18:53,743 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:53,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash 826489260, now seen corresponding path program 1 times [2025-01-09 21:18:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492022992] [2025-01-09 21:18:53,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:53,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 21:18:53,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 21:18:53,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:53,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492022992] [2025-01-09 21:18:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492022992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:53,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385675811] [2025-01-09 21:18:53,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:53,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:53,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:53,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:53,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 608 [2025-01-09 21:18:53,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1121 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:53,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:53,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 608 [2025-01-09 21:18:53,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:54,019 INFO L124 PetriNetUnfolderBase]: 152/1679 cut-off events. [2025-01-09 21:18:54,020 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-01-09 21:18:54,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 1679 events. 152/1679 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9076 event pairs, 53 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 1718. Up to 194 conditions per place. [2025-01-09 21:18:54,025 INFO L140 encePairwiseOnDemand]: 599/608 looper letters, 26 selfloop transitions, 4 changer transitions 0/557 dead transitions. [2025-01-09 21:18:54,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 557 transitions, 1189 flow [2025-01-09 21:18:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2025-01-09 21:18:54,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435307017543859 [2025-01-09 21:18:54,028 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1121 flow. Second operand 3 states and 1721 transitions. [2025-01-09 21:18:54,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 557 transitions, 1189 flow [2025-01-09 21:18:54,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 557 transitions, 1185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:18:54,037 INFO L231 Difference]: Finished difference. Result has 548 places, 552 transitions, 1127 flow [2025-01-09 21:18:54,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=548, PETRI_TRANSITIONS=552} [2025-01-09 21:18:54,038 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -42 predicate places. [2025-01-09 21:18:54,038 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 552 transitions, 1127 flow [2025-01-09 21:18:54,039 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:54,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:54,039 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:54,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:18:54,039 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1501301368, now seen corresponding path program 1 times [2025-01-09 21:18:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:54,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493594821] [2025-01-09 21:18:54,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:54,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 21:18:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 21:18:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493594821] [2025-01-09 21:18:54,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493594821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:54,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:54,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343566410] [2025-01-09 21:18:54,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:54,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:54,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:54,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:54,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 608 [2025-01-09 21:18:54,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 552 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:54,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 608 [2025-01-09 21:18:54,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:54,323 INFO L124 PetriNetUnfolderBase]: 86/1441 cut-off events. [2025-01-09 21:18:54,323 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:18:54,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 1441 events. 86/1441 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6764 event pairs, 9 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 1394. Up to 100 conditions per place. [2025-01-09 21:18:54,334 INFO L140 encePairwiseOnDemand]: 606/608 looper letters, 18 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2025-01-09 21:18:54,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 556 transitions, 1175 flow [2025-01-09 21:18:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1745 transitions. [2025-01-09 21:18:54,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9566885964912281 [2025-01-09 21:18:54,341 INFO L175 Difference]: Start difference. First operand has 548 places, 552 transitions, 1127 flow. Second operand 3 states and 1745 transitions. [2025-01-09 21:18:54,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 556 transitions, 1175 flow [2025-01-09 21:18:54,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 556 transitions, 1171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:54,355 INFO L231 Difference]: Finished difference. Result has 548 places, 551 transitions, 1123 flow [2025-01-09 21:18:54,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=548, PETRI_TRANSITIONS=551} [2025-01-09 21:18:54,357 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -42 predicate places. [2025-01-09 21:18:54,361 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 551 transitions, 1123 flow [2025-01-09 21:18:54,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:54,363 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:54,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:18:54,363 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:54,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash -555614612, now seen corresponding path program 1 times [2025-01-09 21:18:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892603045] [2025-01-09 21:18:54,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:54,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 21:18:54,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 21:18:54,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:54,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892603045] [2025-01-09 21:18:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892603045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29500055] [2025-01-09 21:18:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:54,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 608 [2025-01-09 21:18:54,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 551 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 0 states have call successors, (0), 0 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,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:54,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 608 [2025-01-09 21:18:54,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:54,699 INFO L124 PetriNetUnfolderBase]: 110/1495 cut-off events. [2025-01-09 21:18:54,699 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2025-01-09 21:18:54,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1495 events. 110/1495 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7394 event pairs, 46 based on Foata normal form. 0/1404 useless extension candidates. Maximal degree in co-relation 1483. Up to 141 conditions per place. [2025-01-09 21:18:54,706 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 23 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-01-09 21:18:54,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 551 transitions, 1173 flow [2025-01-09 21:18:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1725 transitions. [2025-01-09 21:18:54,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9457236842105263 [2025-01-09 21:18:54,709 INFO L175 Difference]: Start difference. First operand has 548 places, 551 transitions, 1123 flow. Second operand 3 states and 1725 transitions. [2025-01-09 21:18:54,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 551 transitions, 1173 flow [2025-01-09 21:18:54,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 551 transitions, 1172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:54,715 INFO L231 Difference]: Finished difference. Result has 549 places, 551 transitions, 1130 flow [2025-01-09 21:18:54,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=549, PETRI_TRANSITIONS=551} [2025-01-09 21:18:54,716 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -41 predicate places. [2025-01-09 21:18:54,716 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 551 transitions, 1130 flow [2025-01-09 21:18:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 0 states have call successors, (0), 0 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,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:54,717 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:54,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:18:54,718 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:54,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash 358450058, now seen corresponding path program 1 times [2025-01-09 21:18:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:54,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353661096] [2025-01-09 21:18:54,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:54,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:18:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:18:54,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:54,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353661096] [2025-01-09 21:18:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353661096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745371538] [2025-01-09 21:18:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:54,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:54,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:54,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:54,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-01-09 21:18:54,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 551 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:54,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-01-09 21:18:54,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:55,071 INFO L124 PetriNetUnfolderBase]: 135/2044 cut-off events. [2025-01-09 21:18:55,071 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:18:55,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 2044 events. 135/2044 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 12194 event pairs, 45 based on Foata normal form. 0/1946 useless extension candidates. Maximal degree in co-relation 2253. Up to 157 conditions per place. [2025-01-09 21:18:55,080 INFO L140 encePairwiseOnDemand]: 604/608 looper letters, 11 selfloop transitions, 1 changer transitions 112/552 dead transitions. [2025-01-09 21:18:55,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 552 transitions, 1172 flow [2025-01-09 21:18:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1737 transitions. [2025-01-09 21:18:55,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523026315789473 [2025-01-09 21:18:55,083 INFO L175 Difference]: Start difference. First operand has 549 places, 551 transitions, 1130 flow. Second operand 3 states and 1737 transitions. [2025-01-09 21:18:55,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 552 transitions, 1172 flow [2025-01-09 21:18:55,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 552 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:55,093 INFO L231 Difference]: Finished difference. Result has 549 places, 439 transitions, 905 flow [2025-01-09 21:18:55,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=549, PETRI_TRANSITIONS=439} [2025-01-09 21:18:55,094 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -41 predicate places. [2025-01-09 21:18:55,094 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 439 transitions, 905 flow [2025-01-09 21:18:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:55,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:18:55,095 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:55,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:18:55,095 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-01-09 21:18:55,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:18:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1615608651, now seen corresponding path program 1 times [2025-01-09 21:18:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:18:55,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903440250] [2025-01-09 21:18:55,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:18:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:18:55,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 21:18:55,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 21:18:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:18:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:18:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:18:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:18:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903440250] [2025-01-09 21:18:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903440250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:18:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:18:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:18:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109372194] [2025-01-09 21:18:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:18:55,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:18:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:18:55,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:18:55,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:18:55,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 608 [2025-01-09 21:18:55,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 439 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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:55,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:18:55,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 608 [2025-01-09 21:18:55,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:18:55,281 INFO L124 PetriNetUnfolderBase]: 29/597 cut-off events. [2025-01-09 21:18:55,281 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-01-09 21:18:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 597 events. 29/597 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1116 event pairs, 5 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 492. Up to 34 conditions per place. [2025-01-09 21:18:55,282 INFO L140 encePairwiseOnDemand]: 606/608 looper letters, 0 selfloop transitions, 0 changer transitions 443/443 dead transitions. [2025-01-09 21:18:55,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 944 flow [2025-01-09 21:18:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:18:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:18:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2025-01-09 21:18:55,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544956140350878 [2025-01-09 21:18:55,286 INFO L175 Difference]: Start difference. First operand has 549 places, 439 transitions, 905 flow. Second operand 3 states and 1741 transitions. [2025-01-09 21:18:55,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 944 flow [2025-01-09 21:18:55,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 443 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:18:55,289 INFO L231 Difference]: Finished difference. Result has 445 places, 0 transitions, 0 flow [2025-01-09 21:18:55,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=445, PETRI_TRANSITIONS=0} [2025-01-09 21:18:55,293 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -145 predicate places. [2025-01-09 21:18:55,293 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 0 transitions, 0 flow [2025-01-09 21:18:55,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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:55,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (66 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (65 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (64 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (63 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (62 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (61 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (60 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (59 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (58 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (57 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (56 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (55 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (54 of 67 remaining) [2025-01-09 21:18:55,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (53 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (52 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (51 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (50 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (49 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (48 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (47 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (33 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (32 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (31 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (30 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (29 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (28 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (27 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (26 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (25 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (24 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (23 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (22 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (19 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (18 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (17 of 67 remaining) [2025-01-09 21:18:55,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (16 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (15 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (14 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (13 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (12 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (11 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (10 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (9 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (8 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (7 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (6 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (5 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (4 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (3 of 67 remaining) [2025-01-09 21:18:55,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (2 of 67 remaining) [2025-01-09 21:18:55,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (1 of 67 remaining) [2025-01-09 21:18:55,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (0 of 67 remaining) [2025-01-09 21:18:55,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:18:55,302 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:18:55,307 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:18:55,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:18:55,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:18:55 BasicIcfg [2025-01-09 21:18:55,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:18:55,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:18:55,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:18:55,314 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:18:55,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:18:43" (3/4) ... [2025-01-09 21:18:55,316 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:18:55,318 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure whoop_wrapper_read_nvram [2025-01-09 21:18:55,318 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure whoop_wrapper_write_nvram [2025-01-09 21:18:55,325 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-01-09 21:18:55,325 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 21:18:55,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 21:18:55,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:18:55,327 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:18:55,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:18:55,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:18:55,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:18:55,400 INFO L158 Benchmark]: Toolchain (without parser) took 16239.98ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 101.3MB in the beginning and 126.2MB in the end (delta: -24.8MB). Peak memory consumption was 260.7MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,400 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:18:55,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3668.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 101.3MB in the beginning and 111.2MB in the end (delta: -9.8MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.23ms. Allocated memory is still 285.2MB. Free memory was 111.2MB in the beginning and 95.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,401 INFO L158 Benchmark]: Boogie Preprocessor took 79.89ms. Allocated memory is still 285.2MB. Free memory was 95.8MB in the beginning and 90.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,401 INFO L158 Benchmark]: RCFGBuilder took 915.74ms. Allocated memory is still 285.2MB. Free memory was 90.3MB in the beginning and 122.1MB in the end (delta: -31.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,401 INFO L158 Benchmark]: TraceAbstraction took 11370.34ms. Allocated memory was 285.2MB in the beginning and 427.8MB in the end (delta: 142.6MB). Free memory was 122.1MB in the beginning and 134.6MB in the end (delta: -12.5MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,402 INFO L158 Benchmark]: Witness Printer took 84.77ms. Allocated memory is still 427.8MB. Free memory was 134.6MB in the beginning and 126.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:18:55,403 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3668.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 101.3MB in the beginning and 111.2MB in the end (delta: -9.8MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.23ms. Allocated memory is still 285.2MB. Free memory was 111.2MB in the beginning and 95.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.89ms. Allocated memory is still 285.2MB. Free memory was 95.8MB in the beginning and 90.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 915.74ms. Allocated memory is still 285.2MB. Free memory was 90.3MB in the beginning and 122.1MB in the end (delta: -31.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11370.34ms. Allocated memory was 285.2MB in the beginning and 427.8MB in the end (delta: 142.6MB). Free memory was 122.1MB in the beginning and 134.6MB in the end (delta: -12.5MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. * Witness Printer took 84.77ms. Allocated memory is still 427.8MB. Free memory was 134.6MB in the beginning and 126.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 5817]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6733]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6736]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6729]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6750]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6752]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6755]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6763]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6766]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6757]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6867]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6868]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6869]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6870]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6871]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6872]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6873]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6874]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6875]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6876]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6877]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6878]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6879]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6880]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6881]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6883]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6884]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6884]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6885]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6886]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6887]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6810]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6811]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6812]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 832 locations, 67 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 139 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1213occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 5281 NumberOfCodeBlocks, 5281 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5253 ConstructedInterpolants, 0 QuantifiedInterpolants, 5614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:18:55,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE