./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.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 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:27:29,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:27:29,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:27:29,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:27:29,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:27:29,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:27:29,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:27:29,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:27:29,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:27:29,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:27:29,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:27:29,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:27:29,798 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:27:29,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:27:29,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:27:29,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:29,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:27:29,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:27:29,800 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 -> 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 [2025-02-08 05:27:30,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:27:30,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:27:30,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:27:30,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:27:30,040 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:27:30,040 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_nvram_unlocked_ioctl.i [2025-02-08 05:27:31,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae2f4268/09ece5a0b6124c4ab67cd7f9bac1f8d9/FLAGd42b91378 [2025-02-08 05:27:31,780 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:27:31,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-02-08 05:27:31,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae2f4268/09ece5a0b6124c4ab67cd7f9bac1f8d9/FLAGd42b91378 [2025-02-08 05:27:31,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae2f4268/09ece5a0b6124c4ab67cd7f9bac1f8d9 [2025-02-08 05:27:31,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:27:31,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:27:31,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:31,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:27:31,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:27:31,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:31" (1/1) ... [2025-02-08 05:27:31,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac26d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:31, skipping insertion in model container [2025-02-08 05:27:31,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:31" (1/1) ... [2025-02-08 05:27:31,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:27:37,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:37,808 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:27:37,952 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:27:37,953 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:27:37,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:27:37,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:27:38,093 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-02-08 05:27:38,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:38,455 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:27:38,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38 WrapperNode [2025-02-08 05:27:38,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:38,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:38,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:27:38,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:27:38,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,644 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2025-02-08 05:27:38,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:38,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:27:38,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:27:38,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:27:38,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,682 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:27:38,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:27:38,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:27:38,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:27:38,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (1/1) ... [2025-02-08 05:27:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:38,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:27:38,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:27:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:27:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:27:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-02-08 05:27:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-02-08 05:27:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:27:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:27:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:27:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:27:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-02-08 05:27:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-02-08 05:27:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:27:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:27:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:27:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:27:38,755 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:27:39,148 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:27:39,150 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-6: havoc __put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-5: assume { :end_inline___put_user } true;assume -2147483648 <= read_nvram_#t~ret1322#1 && read_nvram_#t~ret1322#1 <= 2147483647; [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-4: havoc read_nvram_#t~ret1321#1; [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-3: havoc read_nvram_#t~ret1321#1; [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-10: havoc __put_user_#res#1; [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-9: havoc __put_user_#t~nondet1284#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 05:27:39,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-8: read_nvram_#t~ret1322#1 := __put_user_#res#1; [2025-02-08 05:27:39,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-7: havoc __put_user_#t~nondet1284#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 05:27:39,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-14: read_nvram_#t~ret1321#1 := nvram_read_byte_#res#1; [2025-02-08 05:27:39,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-13: havoc nvram_read_byte_#t~nondet1302#1, nvram_read_byte_~arg0#1; [2025-02-08 05:27:39,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-02-08 05:27:39,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-12: havoc nvram_read_byte_#in~arg0#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-11: assume { :end_inline_nvram_read_byte } true;assume { :begin_inline___put_user } true;__put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset := (if read_nvram_#t~ret1321#1 % 256 % 4294967296 <= 2147483647 then read_nvram_#t~ret1321#1 % 256 % 4294967296 else read_nvram_#t~ret1321#1 % 256 % 4294967296 - 4294967296), read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-5: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-4: assume -2147483648 <= __put_user_#t~nondet1284#1 && __put_user_#t~nondet1284#1 <= 2147483647; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-3: __put_user_#res#1 := __put_user_#t~nondet1284#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-2: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6725-1: read_nvram_#res#1 := -14; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-1: havoc read_nvram_#t~pre1325#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-5: read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-4: havoc read_nvram_#t~pre1324#1.base, read_nvram_#t~pre1324#1.offset; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-3: read_nvram_#t~pre1325#1 := read_nvram_~count#1 - 1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-2: read_nvram_~count#1 := read_nvram_~count#1 - 1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-9: read_nvram_#t~pre1323#1 := 1 + read_nvram_~i~1#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-8: read_nvram_~i~1#1 := 1 + read_nvram_~i~1#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-7: havoc read_nvram_#t~pre1323#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-6: read_nvram_#t~pre1324#1.base, read_nvram_#t~pre1324#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542: __put_user_~arg1#1.base, __put_user_~arg1#1.offset := __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542-1: __put_user_~arg0#1 := __put_user_#in~arg0#1; [2025-02-08 05:27:39,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-2: assume 0 != read_nvram_#t~ret1322#1; [2025-02-08 05:27:39,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-2: assume !(0 != read_nvram_#t~ret1322#1); [2025-02-08 05:27:39,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-1: havoc read_nvram_#t~ret1322#1; [2025-02-08 05:27:39,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724: havoc read_nvram_#t~ret1322#1; [2025-02-08 05:27:39,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-02-08 05:27:39,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-02-08 05:27:39,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-02-08 05:27:39,888 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6753: assume { :end_inline_nvram_sync } true; [2025-02-08 05:27:39,889 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:27:39,889 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:27:39,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:27:39,960 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:27:39,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:39 BoogieIcfgContainer [2025-02-08 05:27:39,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:27:39,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:27:39,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:27:39,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:27:39,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:27:31" (1/3) ... [2025-02-08 05:27:39,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7525ff00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:39, skipping insertion in model container [2025-02-08 05:27:39,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:38" (2/3) ... [2025-02-08 05:27:39,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7525ff00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:39, skipping insertion in model container [2025-02-08 05:27:39,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:39" (3/3) ... [2025-02-08 05:27:39,969 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-02-08 05:27:39,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:27:39,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i that has 3 procedures, 548 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-02-08 05:27:39,985 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:27:40,179 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:27:40,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 554 places, 554 transitions, 1122 flow [2025-02-08 05:27:40,395 INFO L124 PetriNetUnfolderBase]: 7/552 cut-off events. [2025-02-08 05:27:40,397 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:40,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 552 events. 7/552 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 341 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 484. Up to 2 conditions per place. [2025-02-08 05:27:40,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 554 places, 554 transitions, 1122 flow [2025-02-08 05:27:40,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 547 places, 547 transitions, 1103 flow [2025-02-08 05:27:40,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:40,425 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;@1506825e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:40,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-02-08 05:27:40,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:40,444 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-02-08 05:27:40,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:40,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:40,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash 830522812, now seen corresponding path program 1 times [2025-02-08 05:27:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18870444] [2025-02-08 05:27:40,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:27:40,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:27:40,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18870444] [2025-02-08 05:27:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18870444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418686820] [2025-02-08 05:27:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:40,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 547 transitions, 1103 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:40,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,017 INFO L124 PetriNetUnfolderBase]: 5/578 cut-off events. [2025-02-08 05:27:41,018 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-08 05:27:41,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 578 events. 5/578 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 333 event pairs, 2 based on Foata normal form. 4/532 useless extension candidates. Maximal degree in co-relation 482. Up to 13 conditions per place. [2025-02-08 05:27:41,022 INFO L140 encePairwiseOnDemand]: 544/554 looper letters, 8 selfloop transitions, 2 changer transitions 1/537 dead transitions. [2025-02-08 05:27:41,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 537 transitions, 1103 flow [2025-02-08 05:27:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1617 transitions. [2025-02-08 05:27:41,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9729241877256317 [2025-02-08 05:27:41,036 INFO L175 Difference]: Start difference. First operand has 547 places, 547 transitions, 1103 flow. Second operand 3 states and 1617 transitions. [2025-02-08 05:27:41,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 537 transitions, 1103 flow [2025-02-08 05:27:41,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 537 transitions, 1098 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:41,060 INFO L231 Difference]: Finished difference. Result has 540 places, 536 transitions, 1080 flow [2025-02-08 05:27:41,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1080, PETRI_PLACES=540, PETRI_TRANSITIONS=536} [2025-02-08 05:27:41,065 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -7 predicate places. [2025-02-08 05:27:41,065 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 536 transitions, 1080 flow [2025-02-08 05:27:41,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:27:41,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1398672242, now seen corresponding path program 1 times [2025-02-08 05:27:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377988908] [2025-02-08 05:27:41,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:27:41,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:27:41,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377988908] [2025-02-08 05:27:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377988908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772699430] [2025-02-08 05:27:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:41,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 536 transitions, 1080 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:41,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,361 INFO L124 PetriNetUnfolderBase]: 5/576 cut-off events. [2025-02-08 05:27:41,361 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:41,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 576 events. 5/576 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 329 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 503. Up to 13 conditions per place. [2025-02-08 05:27:41,365 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2025-02-08 05:27:41,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 535 transitions, 1098 flow [2025-02-08 05:27:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:41,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:41,369 INFO L175 Difference]: Start difference. First operand has 540 places, 536 transitions, 1080 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 535 transitions, 1098 flow [2025-02-08 05:27:41,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 535 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:41,376 INFO L231 Difference]: Finished difference. Result has 538 places, 535 transitions, 1078 flow [2025-02-08 05:27:41,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1078, PETRI_PLACES=538, PETRI_TRANSITIONS=535} [2025-02-08 05:27:41,378 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -9 predicate places. [2025-02-08 05:27:41,378 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 535 transitions, 1078 flow [2025-02-08 05:27:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:27:41,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2122328186, now seen corresponding path program 1 times [2025-02-08 05:27:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756579877] [2025-02-08 05:27:41,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:27:41,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:27:41,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756579877] [2025-02-08 05:27:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756579877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957408884] [2025-02-08 05:27:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:41,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 535 transitions, 1078 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:41,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,640 INFO L124 PetriNetUnfolderBase]: 5/575 cut-off events. [2025-02-08 05:27:41,641 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:41,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 575 events. 5/575 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 326 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 495. Up to 13 conditions per place. [2025-02-08 05:27:41,644 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/534 dead transitions. [2025-02-08 05:27:41,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 534 transitions, 1096 flow [2025-02-08 05:27:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:41,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:41,647 INFO L175 Difference]: Start difference. First operand has 538 places, 535 transitions, 1078 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:41,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 534 transitions, 1096 flow [2025-02-08 05:27:41,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 534 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:41,654 INFO L231 Difference]: Finished difference. Result has 537 places, 534 transitions, 1076 flow [2025-02-08 05:27:41,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=537, PETRI_TRANSITIONS=534} [2025-02-08 05:27:41,655 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -10 predicate places. [2025-02-08 05:27:41,655 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 534 transitions, 1076 flow [2025-02-08 05:27:41,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:27:41,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1582933723, now seen corresponding path program 1 times [2025-02-08 05:27:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649841909] [2025-02-08 05:27:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:27:41,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:27:41,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649841909] [2025-02-08 05:27:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649841909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462885705] [2025-02-08 05:27:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 554 [2025-02-08 05:27:41,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 534 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 554 [2025-02-08 05:27:41,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,859 INFO L124 PetriNetUnfolderBase]: 14/936 cut-off events. [2025-02-08 05:27:41,859 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:27:41,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 936 events. 14/936 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2122 event pairs, 5 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 858. Up to 20 conditions per place. [2025-02-08 05:27:41,865 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 9 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-02-08 05:27:41,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 533 transitions, 1096 flow [2025-02-08 05:27:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1608 transitions. [2025-02-08 05:27:41,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675090252707581 [2025-02-08 05:27:41,868 INFO L175 Difference]: Start difference. First operand has 537 places, 534 transitions, 1076 flow. Second operand 3 states and 1608 transitions. [2025-02-08 05:27:41,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 533 transitions, 1096 flow [2025-02-08 05:27:41,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 533 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:41,919 INFO L231 Difference]: Finished difference. Result has 536 places, 533 transitions, 1074 flow [2025-02-08 05:27:41,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=536, PETRI_TRANSITIONS=533} [2025-02-08 05:27:41,920 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -11 predicate places. [2025-02-08 05:27:41,920 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 533 transitions, 1074 flow [2025-02-08 05:27:41,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:27:41,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1737481520, now seen corresponding path program 1 times [2025-02-08 05:27:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768512294] [2025-02-08 05:27:41,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:27:41,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:27:41,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768512294] [2025-02-08 05:27:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768512294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511660238] [2025-02-08 05:27:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:42,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:42,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 533 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:42,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:42,087 INFO L124 PetriNetUnfolderBase]: 5/573 cut-off events. [2025-02-08 05:27:42,087 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:42,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 573 events. 5/573 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 321 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 479. Up to 13 conditions per place. [2025-02-08 05:27:42,089 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-02-08 05:27:42,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1092 flow [2025-02-08 05:27:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:42,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:42,093 INFO L175 Difference]: Start difference. First operand has 536 places, 533 transitions, 1074 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:42,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1092 flow [2025-02-08 05:27:42,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 532 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:42,100 INFO L231 Difference]: Finished difference. Result has 535 places, 532 transitions, 1072 flow [2025-02-08 05:27:42,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=535, PETRI_TRANSITIONS=532} [2025-02-08 05:27:42,102 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -12 predicate places. [2025-02-08 05:27:42,102 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 532 transitions, 1072 flow [2025-02-08 05:27:42,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:42,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:42,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:27:42,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:42,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash -68980382, now seen corresponding path program 1 times [2025-02-08 05:27:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:42,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474193930] [2025-02-08 05:27:42,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:42,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:27:42,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:27:42,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:42,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:42,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474193930] [2025-02-08 05:27:42,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474193930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:42,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:42,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536240342] [2025-02-08 05:27:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:42,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:42,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:42,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:42,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 554 [2025-02-08 05:27:42,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 532 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 554 [2025-02-08 05:27:42,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:42,254 INFO L124 PetriNetUnfolderBase]: 6/592 cut-off events. [2025-02-08 05:27:42,254 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:27:42,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 592 events. 6/592 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 372 event pairs, 3 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 494. Up to 16 conditions per place. [2025-02-08 05:27:42,257 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 9 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-02-08 05:27:42,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 531 transitions, 1092 flow [2025-02-08 05:27:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1608 transitions. [2025-02-08 05:27:42,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675090252707581 [2025-02-08 05:27:42,261 INFO L175 Difference]: Start difference. First operand has 535 places, 532 transitions, 1072 flow. Second operand 3 states and 1608 transitions. [2025-02-08 05:27:42,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 531 transitions, 1092 flow [2025-02-08 05:27:42,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 531 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:42,267 INFO L231 Difference]: Finished difference. Result has 534 places, 531 transitions, 1070 flow [2025-02-08 05:27:42,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=534, PETRI_TRANSITIONS=531} [2025-02-08 05:27:42,270 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -13 predicate places. [2025-02-08 05:27:42,271 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 531 transitions, 1070 flow [2025-02-08 05:27:42,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:42,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:42,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:27:42,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1983973617, now seen corresponding path program 1 times [2025-02-08 05:27:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153590341] [2025-02-08 05:27:42,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:42,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:27:42,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:27:42,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:42,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:42,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153590341] [2025-02-08 05:27:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153590341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085075080] [2025-02-08 05:27:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:42,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:42,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:42,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:42,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 531 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:42,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:42,535 INFO L124 PetriNetUnfolderBase]: 5/571 cut-off events. [2025-02-08 05:27:42,535 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:42,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 571 events. 5/571 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 316 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 463. Up to 13 conditions per place. [2025-02-08 05:27:42,542 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-02-08 05:27:42,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 530 transitions, 1088 flow [2025-02-08 05:27:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:42,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:42,549 INFO L175 Difference]: Start difference. First operand has 534 places, 531 transitions, 1070 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:42,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 530 transitions, 1088 flow [2025-02-08 05:27:42,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 530 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:42,559 INFO L231 Difference]: Finished difference. Result has 533 places, 530 transitions, 1068 flow [2025-02-08 05:27:42,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=533, PETRI_TRANSITIONS=530} [2025-02-08 05:27:42,567 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -14 predicate places. [2025-02-08 05:27:42,568 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 530 transitions, 1068 flow [2025-02-08 05:27:42,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:42,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:42,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:27:42,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:42,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -863933061, now seen corresponding path program 1 times [2025-02-08 05:27:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739108571] [2025-02-08 05:27:42,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:42,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:27:42,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:27:42,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:42,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739108571] [2025-02-08 05:27:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739108571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:42,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:42,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823606947] [2025-02-08 05:27:42,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:42,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:42,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:42,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:42,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:42,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 530 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:42,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:42,727 INFO L124 PetriNetUnfolderBase]: 5/570 cut-off events. [2025-02-08 05:27:42,727 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:42,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 570 events. 5/570 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 308 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 455. Up to 13 conditions per place. [2025-02-08 05:27:42,730 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-02-08 05:27:42,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 529 transitions, 1086 flow [2025-02-08 05:27:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:42,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:42,733 INFO L175 Difference]: Start difference. First operand has 533 places, 530 transitions, 1068 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:42,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 529 transitions, 1086 flow [2025-02-08 05:27:42,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 529 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:42,740 INFO L231 Difference]: Finished difference. Result has 532 places, 529 transitions, 1066 flow [2025-02-08 05:27:42,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=532, PETRI_TRANSITIONS=529} [2025-02-08 05:27:42,742 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -15 predicate places. [2025-02-08 05:27:42,742 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 529 transitions, 1066 flow [2025-02-08 05:27:42,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:42,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:42,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:27:42,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:42,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash -994025366, now seen corresponding path program 1 times [2025-02-08 05:27:42,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:42,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779515555] [2025-02-08 05:27:42,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:42,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:27:42,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:27:42,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:42,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:42,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779515555] [2025-02-08 05:27:42,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779515555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:42,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:42,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357166088] [2025-02-08 05:27:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:42,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:42,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:42,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:42,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 529 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:42,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:42,886 INFO L124 PetriNetUnfolderBase]: 5/569 cut-off events. [2025-02-08 05:27:42,887 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:42,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 569 events. 5/569 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 304 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 447. Up to 13 conditions per place. [2025-02-08 05:27:42,889 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-02-08 05:27:42,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 528 transitions, 1084 flow [2025-02-08 05:27:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:42,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:42,892 INFO L175 Difference]: Start difference. First operand has 532 places, 529 transitions, 1066 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:42,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 528 transitions, 1084 flow [2025-02-08 05:27:42,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 528 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:42,898 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1064 flow [2025-02-08 05:27:42,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2025-02-08 05:27:42,899 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -16 predicate places. [2025-02-08 05:27:42,899 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1064 flow [2025-02-08 05:27:42,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:42,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:42,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:27:42,900 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash -323150815, now seen corresponding path program 1 times [2025-02-08 05:27:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392747627] [2025-02-08 05:27:42,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:42,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:27:42,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:27:42,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:42,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392747627] [2025-02-08 05:27:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392747627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373268180] [2025-02-08 05:27:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:42,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:42,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:42,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:42,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:42,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:42,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:42,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:42,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:43,047 INFO L124 PetriNetUnfolderBase]: 5/568 cut-off events. [2025-02-08 05:27:43,048 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:43,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 568 events. 5/568 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 301 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 439. Up to 13 conditions per place. [2025-02-08 05:27:43,050 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-02-08 05:27:43,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 527 transitions, 1082 flow [2025-02-08 05:27:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:43,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:43,052 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1064 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:43,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 527 transitions, 1082 flow [2025-02-08 05:27:43,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 527 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:43,058 INFO L231 Difference]: Finished difference. Result has 530 places, 527 transitions, 1062 flow [2025-02-08 05:27:43,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=530, PETRI_TRANSITIONS=527} [2025-02-08 05:27:43,059 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -17 predicate places. [2025-02-08 05:27:43,059 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 527 transitions, 1062 flow [2025-02-08 05:27:43,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:43,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:43,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:27:43,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -618918573, now seen corresponding path program 1 times [2025-02-08 05:27:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978027510] [2025-02-08 05:27:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:43,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:27:43,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:27:43,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:43,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978027510] [2025-02-08 05:27:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978027510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:43,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769579648] [2025-02-08 05:27:43,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:43,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:43,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:43,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:43,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:43,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 527 transitions, 1062 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:43,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:43,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:43,197 INFO L124 PetriNetUnfolderBase]: 5/567 cut-off events. [2025-02-08 05:27:43,197 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:43,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 567 events. 5/567 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 300 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 431. Up to 13 conditions per place. [2025-02-08 05:27:43,199 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2025-02-08 05:27:43,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 526 transitions, 1080 flow [2025-02-08 05:27:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:43,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:43,202 INFO L175 Difference]: Start difference. First operand has 530 places, 527 transitions, 1062 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:43,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 526 transitions, 1080 flow [2025-02-08 05:27:43,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 526 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:43,208 INFO L231 Difference]: Finished difference. Result has 529 places, 526 transitions, 1060 flow [2025-02-08 05:27:43,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=529, PETRI_TRANSITIONS=526} [2025-02-08 05:27:43,209 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -18 predicate places. [2025-02-08 05:27:43,209 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 526 transitions, 1060 flow [2025-02-08 05:27:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:43,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:43,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:27:43,210 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 806656061, now seen corresponding path program 1 times [2025-02-08 05:27:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836001638] [2025-02-08 05:27:43,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:43,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:27:43,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:27:43,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836001638] [2025-02-08 05:27:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836001638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95390889] [2025-02-08 05:27:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:43,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:43,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:43,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 554 [2025-02-08 05:27:43,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 526 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:43,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 554 [2025-02-08 05:27:43,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:43,422 INFO L124 PetriNetUnfolderBase]: 14/919 cut-off events. [2025-02-08 05:27:43,422 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:27:43,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 919 events. 14/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2058 event pairs, 5 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 785. Up to 20 conditions per place. [2025-02-08 05:27:43,426 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 9 selfloop transitions, 2 changer transitions 0/525 dead transitions. [2025-02-08 05:27:43,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 525 transitions, 1080 flow [2025-02-08 05:27:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1608 transitions. [2025-02-08 05:27:43,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675090252707581 [2025-02-08 05:27:43,429 INFO L175 Difference]: Start difference. First operand has 529 places, 526 transitions, 1060 flow. Second operand 3 states and 1608 transitions. [2025-02-08 05:27:43,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 525 transitions, 1080 flow [2025-02-08 05:27:43,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 525 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:43,436 INFO L231 Difference]: Finished difference. Result has 528 places, 525 transitions, 1058 flow [2025-02-08 05:27:43,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=528, PETRI_TRANSITIONS=525} [2025-02-08 05:27:43,437 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -19 predicate places. [2025-02-08 05:27:43,437 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 525 transitions, 1058 flow [2025-02-08 05:27:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:43,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:27:43,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 939661336, now seen corresponding path program 1 times [2025-02-08 05:27:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877238737] [2025-02-08 05:27:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:27:43,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:27:43,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:43,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877238737] [2025-02-08 05:27:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877238737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395780003] [2025-02-08 05:27:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:43,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:43,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:43,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:43,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:43,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 525 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:43,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:43,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:43,618 INFO L124 PetriNetUnfolderBase]: 5/565 cut-off events. [2025-02-08 05:27:43,618 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:43,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 565 events. 5/565 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 296 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 415. Up to 13 conditions per place. [2025-02-08 05:27:43,621 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-02-08 05:27:43,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 524 transitions, 1076 flow [2025-02-08 05:27:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:43,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:43,624 INFO L175 Difference]: Start difference. First operand has 528 places, 525 transitions, 1058 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:43,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 524 transitions, 1076 flow [2025-02-08 05:27:43,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 524 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:43,631 INFO L231 Difference]: Finished difference. Result has 527 places, 524 transitions, 1056 flow [2025-02-08 05:27:43,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=527, PETRI_TRANSITIONS=524} [2025-02-08 05:27:43,632 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -20 predicate places. [2025-02-08 05:27:43,632 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 524 transitions, 1056 flow [2025-02-08 05:27:43,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:43,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:27:43,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 465468203, now seen corresponding path program 1 times [2025-02-08 05:27:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963577607] [2025-02-08 05:27:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:27:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:27:43,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:43,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963577607] [2025-02-08 05:27:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963577607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:43,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487242620] [2025-02-08 05:27:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:43,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:43,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:43,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:43,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 524 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:43,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:43,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:43,776 INFO L124 PetriNetUnfolderBase]: 5/564 cut-off events. [2025-02-08 05:27:43,776 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:43,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 564 events. 5/564 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 293 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 407. Up to 13 conditions per place. [2025-02-08 05:27:43,778 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-02-08 05:27:43,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 523 transitions, 1074 flow [2025-02-08 05:27:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:43,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:43,781 INFO L175 Difference]: Start difference. First operand has 527 places, 524 transitions, 1056 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:43,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 523 transitions, 1074 flow [2025-02-08 05:27:43,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 523 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:43,786 INFO L231 Difference]: Finished difference. Result has 526 places, 523 transitions, 1054 flow [2025-02-08 05:27:43,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=526, PETRI_TRANSITIONS=523} [2025-02-08 05:27:43,787 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -21 predicate places. [2025-02-08 05:27:43,787 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 523 transitions, 1054 flow [2025-02-08 05:27:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:43,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:43,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:27:43,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash -495179102, now seen corresponding path program 1 times [2025-02-08 05:27:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260094] [2025-02-08 05:27:43,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:43,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:27:43,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:27:43,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:43,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260094] [2025-02-08 05:27:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651222408] [2025-02-08 05:27:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:43,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:43,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:43,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:43,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 523 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:43,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:43,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:43,929 INFO L124 PetriNetUnfolderBase]: 5/563 cut-off events. [2025-02-08 05:27:43,930 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:43,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 563 events. 5/563 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 296 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 399. Up to 13 conditions per place. [2025-02-08 05:27:43,931 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-02-08 05:27:43,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 522 transitions, 1072 flow [2025-02-08 05:27:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:43,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:43,934 INFO L175 Difference]: Start difference. First operand has 526 places, 523 transitions, 1054 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:43,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 522 transitions, 1072 flow [2025-02-08 05:27:43,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 522 transitions, 1068 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:43,939 INFO L231 Difference]: Finished difference. Result has 525 places, 522 transitions, 1052 flow [2025-02-08 05:27:43,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=525, PETRI_TRANSITIONS=522} [2025-02-08 05:27:43,940 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -22 predicate places. [2025-02-08 05:27:43,940 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 522 transitions, 1052 flow [2025-02-08 05:27:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:43,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:43,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:43,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:27:43,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1782583478, now seen corresponding path program 1 times [2025-02-08 05:27:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866742656] [2025-02-08 05:27:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:27:43,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:27:43,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:43,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866742656] [2025-02-08 05:27:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866742656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058666409] [2025-02-08 05:27:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:44,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:44,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:44,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 522 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:44,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:44,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:44,074 INFO L124 PetriNetUnfolderBase]: 5/562 cut-off events. [2025-02-08 05:27:44,074 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:44,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 562 events. 5/562 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 295 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 391. Up to 13 conditions per place. [2025-02-08 05:27:44,076 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 8 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-02-08 05:27:44,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 521 transitions, 1070 flow [2025-02-08 05:27:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:27:44,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687123947051745 [2025-02-08 05:27:44,079 INFO L175 Difference]: Start difference. First operand has 525 places, 522 transitions, 1052 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:27:44,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 521 transitions, 1070 flow [2025-02-08 05:27:44,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 521 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:44,084 INFO L231 Difference]: Finished difference. Result has 524 places, 521 transitions, 1050 flow [2025-02-08 05:27:44,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=524, PETRI_TRANSITIONS=521} [2025-02-08 05:27:44,085 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -23 predicate places. [2025-02-08 05:27:44,085 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 521 transitions, 1050 flow [2025-02-08 05:27:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:44,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:44,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:27:44,086 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:44,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1795254438, now seen corresponding path program 1 times [2025-02-08 05:27:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721792924] [2025-02-08 05:27:44,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:44,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:27:44,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:27:44,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:44,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:44,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:44,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721792924] [2025-02-08 05:27:44,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721792924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:44,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:44,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379696168] [2025-02-08 05:27:44,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:44,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:44,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:44,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:44,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 554 [2025-02-08 05:27:44,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 521 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:44,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 554 [2025-02-08 05:27:44,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:44,239 INFO L124 PetriNetUnfolderBase]: 8/626 cut-off events. [2025-02-08 05:27:44,239 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:44,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 626 events. 8/626 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 638 event pairs, 5 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 458. Up to 21 conditions per place. [2025-02-08 05:27:44,242 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 10 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-02-08 05:27:44,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 520 transitions, 1072 flow [2025-02-08 05:27:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2025-02-08 05:27:44,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663056558363418 [2025-02-08 05:27:44,245 INFO L175 Difference]: Start difference. First operand has 524 places, 521 transitions, 1050 flow. Second operand 3 states and 1606 transitions. [2025-02-08 05:27:44,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 520 transitions, 1072 flow [2025-02-08 05:27:44,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 520 transitions, 1068 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:44,250 INFO L231 Difference]: Finished difference. Result has 523 places, 520 transitions, 1048 flow [2025-02-08 05:27:44,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=523, PETRI_TRANSITIONS=520} [2025-02-08 05:27:44,251 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -24 predicate places. [2025-02-08 05:27:44,251 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 520 transitions, 1048 flow [2025-02-08 05:27:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:44,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:27:44,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -962044234, now seen corresponding path program 1 times [2025-02-08 05:27:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873239302] [2025-02-08 05:27:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:44,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 05:27:44,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 05:27:44,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:44,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:44,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873239302] [2025-02-08 05:27:44,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873239302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:44,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:44,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68985029] [2025-02-08 05:27:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:44,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:44,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:44,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:44,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 554 [2025-02-08 05:27:44,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 520 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:44,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 554 [2025-02-08 05:27:44,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:44,438 INFO L124 PetriNetUnfolderBase]: 17/953 cut-off events. [2025-02-08 05:27:44,438 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 953 events. 17/953 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2368 event pairs, 8 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 784. Up to 25 conditions per place. [2025-02-08 05:27:44,441 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 9 selfloop transitions, 1 changer transitions 0/518 dead transitions. [2025-02-08 05:27:44,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 518 transitions, 1064 flow [2025-02-08 05:27:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2025-02-08 05:27:44,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693140794223827 [2025-02-08 05:27:44,444 INFO L175 Difference]: Start difference. First operand has 523 places, 520 transitions, 1048 flow. Second operand 3 states and 1611 transitions. [2025-02-08 05:27:44,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 518 transitions, 1064 flow [2025-02-08 05:27:44,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 518 transitions, 1060 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:44,449 INFO L231 Difference]: Finished difference. Result has 521 places, 518 transitions, 1042 flow [2025-02-08 05:27:44,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=521, PETRI_TRANSITIONS=518} [2025-02-08 05:27:44,450 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -26 predicate places. [2025-02-08 05:27:44,450 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 518 transitions, 1042 flow [2025-02-08 05:27:44,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:44,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:44,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:27:44,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:44,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 662197915, now seen corresponding path program 1 times [2025-02-08 05:27:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12035871] [2025-02-08 05:27:44,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:44,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:27:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:27:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12035871] [2025-02-08 05:27:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12035871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160756137] [2025-02-08 05:27:46,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:46,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:46,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 554 [2025-02-08 05:27:46,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 518 transitions, 1042 flow. Second operand has 10 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 554 [2025-02-08 05:27:46,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:46,813 INFO L124 PetriNetUnfolderBase]: 104/949 cut-off events. [2025-02-08 05:27:46,813 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:27:46,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 949 events. 104/949 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3922 event pairs, 98 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1058. Up to 239 conditions per place. [2025-02-08 05:27:46,821 INFO L140 encePairwiseOnDemand]: 544/554 looper letters, 42 selfloop transitions, 9 changer transitions 0/517 dead transitions. [2025-02-08 05:27:46,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 517 transitions, 1142 flow [2025-02-08 05:27:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4972 transitions. [2025-02-08 05:27:46,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974729241877256 [2025-02-08 05:27:46,835 INFO L175 Difference]: Start difference. First operand has 521 places, 518 transitions, 1042 flow. Second operand 10 states and 4972 transitions. [2025-02-08 05:27:46,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 517 transitions, 1142 flow [2025-02-08 05:27:46,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 517 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:46,846 INFO L231 Difference]: Finished difference. Result has 528 places, 517 transitions, 1057 flow [2025-02-08 05:27:46,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1057, PETRI_PLACES=528, PETRI_TRANSITIONS=517} [2025-02-08 05:27:46,850 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -19 predicate places. [2025-02-08 05:27:46,850 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 517 transitions, 1057 flow [2025-02-08 05:27:46,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:46,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:27:46,856 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1197481840, now seen corresponding path program 1 times [2025-02-08 05:27:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420315418] [2025-02-08 05:27:46,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:46,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:27:46,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:27:46,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:46,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420315418] [2025-02-08 05:27:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420315418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135617036] [2025-02-08 05:27:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:46,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:46,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 554 [2025-02-08 05:27:46,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 517 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 554 [2025-02-08 05:27:46,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,036 INFO L124 PetriNetUnfolderBase]: 12/642 cut-off events. [2025-02-08 05:27:47,037 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:27:47,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 642 events. 12/642 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 700 event pairs, 9 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 485. Up to 31 conditions per place. [2025-02-08 05:27:47,039 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 12 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2025-02-08 05:27:47,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 516 transitions, 1083 flow [2025-02-08 05:27:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1602 transitions. [2025-02-08 05:27:47,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638989169675091 [2025-02-08 05:27:47,042 INFO L175 Difference]: Start difference. First operand has 528 places, 517 transitions, 1057 flow. Second operand 3 states and 1602 transitions. [2025-02-08 05:27:47,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 516 transitions, 1083 flow [2025-02-08 05:27:47,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 516 transitions, 1065 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:27:47,048 INFO L231 Difference]: Finished difference. Result has 520 places, 516 transitions, 1041 flow [2025-02-08 05:27:47,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=520, PETRI_TRANSITIONS=516} [2025-02-08 05:27:47,049 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -27 predicate places. [2025-02-08 05:27:47,049 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 516 transitions, 1041 flow [2025-02-08 05:27:47,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:27:47,050 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:47,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1360690795, now seen corresponding path program 1 times [2025-02-08 05:27:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165686647] [2025-02-08 05:27:47,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:27:47,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:27:47,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:47,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165686647] [2025-02-08 05:27:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165686647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333255709] [2025-02-08 05:27:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:47,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 527 out of 554 [2025-02-08 05:27:47,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 516 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 528.0) internal successors, (1584), 3 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:47,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 527 of 554 [2025-02-08 05:27:47,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,251 INFO L124 PetriNetUnfolderBase]: 27/943 cut-off events. [2025-02-08 05:27:47,251 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:27:47,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 943 events. 27/943 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2385 event pairs, 20 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 804. Up to 53 conditions per place. [2025-02-08 05:27:47,254 INFO L140 encePairwiseOnDemand]: 549/554 looper letters, 13 selfloop transitions, 1 changer transitions 0/512 dead transitions. [2025-02-08 05:27:47,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 512 transitions, 1061 flow [2025-02-08 05:27:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2025-02-08 05:27:47,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9620938628158845 [2025-02-08 05:27:47,257 INFO L175 Difference]: Start difference. First operand has 520 places, 516 transitions, 1041 flow. Second operand 3 states and 1599 transitions. [2025-02-08 05:27:47,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 512 transitions, 1061 flow [2025-02-08 05:27:47,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 512 transitions, 1057 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:47,263 INFO L231 Difference]: Finished difference. Result has 516 places, 512 transitions, 1031 flow [2025-02-08 05:27:47,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=516, PETRI_TRANSITIONS=512} [2025-02-08 05:27:47,264 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -31 predicate places. [2025-02-08 05:27:47,264 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 512 transitions, 1031 flow [2025-02-08 05:27:47,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 528.0) internal successors, (1584), 3 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:27:47,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:47,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1167357105, now seen corresponding path program 1 times [2025-02-08 05:27:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822250499] [2025-02-08 05:27:47,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-08 05:27:47,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 05:27:47,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822250499] [2025-02-08 05:27:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822250499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127461335] [2025-02-08 05:27:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:47,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 554 [2025-02-08 05:27:47,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 512 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 537.6666666666666) internal successors, (1613), 3 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:47,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 554 [2025-02-08 05:27:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,424 INFO L124 PetriNetUnfolderBase]: 5/552 cut-off events. [2025-02-08 05:27:47,425 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:47,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 552 events. 5/552 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 273 event pairs, 2 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 365. Up to 11 conditions per place. [2025-02-08 05:27:47,426 INFO L140 encePairwiseOnDemand]: 552/554 looper letters, 6 selfloop transitions, 1 changer transitions 0/511 dead transitions. [2025-02-08 05:27:47,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 511 transitions, 1043 flow [2025-02-08 05:27:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2025-02-08 05:27:47,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9741275571600482 [2025-02-08 05:27:47,429 INFO L175 Difference]: Start difference. First operand has 516 places, 512 transitions, 1031 flow. Second operand 3 states and 1619 transitions. [2025-02-08 05:27:47,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 511 transitions, 1043 flow [2025-02-08 05:27:47,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 511 transitions, 1042 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:47,434 INFO L231 Difference]: Finished difference. Result has 516 places, 511 transitions, 1030 flow [2025-02-08 05:27:47,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1030, PETRI_PLACES=516, PETRI_TRANSITIONS=511} [2025-02-08 05:27:47,435 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -31 predicate places. [2025-02-08 05:27:47,435 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 511 transitions, 1030 flow [2025-02-08 05:27:47,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 537.6666666666666) internal successors, (1613), 3 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:27:47,436 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:47,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1981800715, now seen corresponding path program 1 times [2025-02-08 05:27:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153836391] [2025-02-08 05:27:47,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-08 05:27:47,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 05:27:47,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153836391] [2025-02-08 05:27:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153836391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570739362] [2025-02-08 05:27:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:47,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 554 [2025-02-08 05:27:47,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 511 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:47,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 554 [2025-02-08 05:27:47,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,609 INFO L124 PetriNetUnfolderBase]: 11/677 cut-off events. [2025-02-08 05:27:47,609 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:47,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 677 events. 11/677 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1036 event pairs, 8 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 515. Up to 30 conditions per place. [2025-02-08 05:27:47,612 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 13 selfloop transitions, 2 changer transitions 0/510 dead transitions. [2025-02-08 05:27:47,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 510 transitions, 1058 flow [2025-02-08 05:27:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1603 transitions. [2025-02-08 05:27:47,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9645006016847172 [2025-02-08 05:27:47,614 INFO L175 Difference]: Start difference. First operand has 516 places, 511 transitions, 1030 flow. Second operand 3 states and 1603 transitions. [2025-02-08 05:27:47,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 510 transitions, 1058 flow [2025-02-08 05:27:47,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 510 transitions, 1057 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:47,620 INFO L231 Difference]: Finished difference. Result has 516 places, 510 transitions, 1031 flow [2025-02-08 05:27:47,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=516, PETRI_TRANSITIONS=510} [2025-02-08 05:27:47,620 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -31 predicate places. [2025-02-08 05:27:47,621 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 510 transitions, 1031 flow [2025-02-08 05:27:47,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:27:47,621 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:47,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1284786441, now seen corresponding path program 1 times [2025-02-08 05:27:47,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646523674] [2025-02-08 05:27:47,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 05:27:47,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 05:27:47,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646523674] [2025-02-08 05:27:47,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646523674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530911087] [2025-02-08 05:27:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:47,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 554 [2025-02-08 05:27:47,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 510 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:47,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 554 [2025-02-08 05:27:47,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,876 INFO L124 PetriNetUnfolderBase]: 23/954 cut-off events. [2025-02-08 05:27:47,876 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:47,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 954 events. 23/954 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2590 event pairs, 14 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 819. Up to 43 conditions per place. [2025-02-08 05:27:47,879 INFO L140 encePairwiseOnDemand]: 548/554 looper letters, 15 selfloop transitions, 3 changer transitions 0/512 dead transitions. [2025-02-08 05:27:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 512 transitions, 1074 flow [2025-02-08 05:27:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1608 transitions. [2025-02-08 05:27:47,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675090252707581 [2025-02-08 05:27:47,881 INFO L175 Difference]: Start difference. First operand has 516 places, 510 transitions, 1031 flow. Second operand 3 states and 1608 transitions. [2025-02-08 05:27:47,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 512 transitions, 1074 flow [2025-02-08 05:27:47,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 512 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:47,889 INFO L231 Difference]: Finished difference. Result has 514 places, 508 transitions, 1034 flow [2025-02-08 05:27:47,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=514, PETRI_TRANSITIONS=508} [2025-02-08 05:27:47,889 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -33 predicate places. [2025-02-08 05:27:47,890 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 508 transitions, 1034 flow [2025-02-08 05:27:47,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:27:47,890 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 811788313, now seen corresponding path program 1 times [2025-02-08 05:27:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759189529] [2025-02-08 05:27:47,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-08 05:27:47,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-08 05:27:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759189529] [2025-02-08 05:27:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759189529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824334966] [2025-02-08 05:27:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:48,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 554 [2025-02-08 05:27:48,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 508 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:48,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 554 [2025-02-08 05:27:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:48,093 INFO L124 PetriNetUnfolderBase]: 14/810 cut-off events. [2025-02-08 05:27:48,093 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-02-08 05:27:48,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 810 events. 14/810 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1679 event pairs, 8 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 674. Up to 38 conditions per place. [2025-02-08 05:27:48,096 INFO L140 encePairwiseOnDemand]: 551/554 looper letters, 14 selfloop transitions, 2 changer transitions 0/508 dead transitions. [2025-02-08 05:27:48,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 508 transitions, 1066 flow [2025-02-08 05:27:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2025-02-08 05:27:48,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663056558363418 [2025-02-08 05:27:48,099 INFO L175 Difference]: Start difference. First operand has 514 places, 508 transitions, 1034 flow. Second operand 3 states and 1606 transitions. [2025-02-08 05:27:48,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 508 transitions, 1066 flow [2025-02-08 05:27:48,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 508 transitions, 1063 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:48,104 INFO L231 Difference]: Finished difference. Result has 515 places, 508 transitions, 1039 flow [2025-02-08 05:27:48,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=515, PETRI_TRANSITIONS=508} [2025-02-08 05:27:48,105 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -32 predicate places. [2025-02-08 05:27:48,105 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 508 transitions, 1039 flow [2025-02-08 05:27:48,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:48,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:48,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:27:48,106 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:48,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1265926751, now seen corresponding path program 1 times [2025-02-08 05:27:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529923535] [2025-02-08 05:27:48,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:48,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 05:27:48,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 05:27:48,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:48,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529923535] [2025-02-08 05:27:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529923535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:48,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649350357] [2025-02-08 05:27:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:48,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:48,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:48,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:48,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 554 [2025-02-08 05:27:48,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 508 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 537.3333333333334) internal successors, (1612), 3 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:48,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 554 [2025-02-08 05:27:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:48,330 INFO L124 PetriNetUnfolderBase]: 26/1296 cut-off events. [2025-02-08 05:27:48,330 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:27:48,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1296 events. 26/1296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4881 event pairs, 8 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 1165. Up to 33 conditions per place. [2025-02-08 05:27:48,336 INFO L140 encePairwiseOnDemand]: 552/554 looper letters, 10 selfloop transitions, 1 changer transitions 0/510 dead transitions. [2025-02-08 05:27:48,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 510 transitions, 1067 flow [2025-02-08 05:27:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2025-02-08 05:27:48,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9747292418772563 [2025-02-08 05:27:48,339 INFO L175 Difference]: Start difference. First operand has 515 places, 508 transitions, 1039 flow. Second operand 3 states and 1620 transitions. [2025-02-08 05:27:48,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 510 transitions, 1067 flow [2025-02-08 05:27:48,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 510 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:48,344 INFO L231 Difference]: Finished difference. Result has 515 places, 507 transitions, 1037 flow [2025-02-08 05:27:48,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=515, PETRI_TRANSITIONS=507} [2025-02-08 05:27:48,345 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -32 predicate places. [2025-02-08 05:27:48,345 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 507 transitions, 1037 flow [2025-02-08 05:27:48,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 537.3333333333334) internal successors, (1612), 3 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:48,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:27:48,346 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:48,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1079901344, now seen corresponding path program 1 times [2025-02-08 05:27:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:48,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213255700] [2025-02-08 05:27:48,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:48,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:48,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-08 05:27:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 05:27:48,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:48,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:48,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213255700] [2025-02-08 05:27:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213255700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246094852] [2025-02-08 05:27:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:48,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:48,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:48,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:48,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 554 [2025-02-08 05:27:48,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 507 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 537.3333333333334) internal successors, (1612), 3 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:48,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 554 [2025-02-08 05:27:48,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:48,642 INFO L124 PetriNetUnfolderBase]: 26/1162 cut-off events. [2025-02-08 05:27:48,642 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:48,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 1162 events. 26/1162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3855 event pairs, 0 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1032. Up to 33 conditions per place. [2025-02-08 05:27:48,648 INFO L140 encePairwiseOnDemand]: 552/554 looper letters, 10 selfloop transitions, 1 changer transitions 0/509 dead transitions. [2025-02-08 05:27:48,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 509 transitions, 1065 flow [2025-02-08 05:27:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2025-02-08 05:27:48,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9747292418772563 [2025-02-08 05:27:48,651 INFO L175 Difference]: Start difference. First operand has 515 places, 507 transitions, 1037 flow. Second operand 3 states and 1620 transitions. [2025-02-08 05:27:48,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 509 transitions, 1065 flow [2025-02-08 05:27:48,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 509 transitions, 1064 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:48,658 INFO L231 Difference]: Finished difference. Result has 515 places, 506 transitions, 1036 flow [2025-02-08 05:27:48,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=515, PETRI_TRANSITIONS=506} [2025-02-08 05:27:48,659 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -32 predicate places. [2025-02-08 05:27:48,659 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 506 transitions, 1036 flow [2025-02-08 05:27:48,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 537.3333333333334) internal successors, (1612), 3 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:48,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:27:48,661 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:48,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:48,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1494911327, now seen corresponding path program 1 times [2025-02-08 05:27:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080161097] [2025-02-08 05:27:48,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-08 05:27:48,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-08 05:27:48,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080161097] [2025-02-08 05:27:48,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080161097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:48,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:48,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142673283] [2025-02-08 05:27:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:48,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:48,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:48,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:48,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 554 [2025-02-08 05:27:48,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 506 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 537.6666666666666) internal successors, (1613), 3 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:48,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 554 [2025-02-08 05:27:48,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:48,840 INFO L124 PetriNetUnfolderBase]: 7/693 cut-off events. [2025-02-08 05:27:48,840 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:27:48,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 693 events. 7/693 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 915 event pairs, 3 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 531. Up to 16 conditions per place. [2025-02-08 05:27:48,842 INFO L140 encePairwiseOnDemand]: 552/554 looper letters, 6 selfloop transitions, 1 changer transitions 36/506 dead transitions. [2025-02-08 05:27:48,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 506 transitions, 1055 flow [2025-02-08 05:27:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1618 transitions. [2025-02-08 05:27:48,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.97352587244284 [2025-02-08 05:27:48,846 INFO L175 Difference]: Start difference. First operand has 515 places, 506 transitions, 1036 flow. Second operand 3 states and 1618 transitions. [2025-02-08 05:27:48,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 506 transitions, 1055 flow [2025-02-08 05:27:48,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 506 transitions, 1054 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:48,851 INFO L231 Difference]: Finished difference. Result has 515 places, 470 transitions, 964 flow [2025-02-08 05:27:48,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=515, PETRI_TRANSITIONS=470} [2025-02-08 05:27:48,855 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -32 predicate places. [2025-02-08 05:27:48,855 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 470 transitions, 964 flow [2025-02-08 05:27:48,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 537.6666666666666) internal successors, (1613), 3 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:48,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:48,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:27:48,856 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1683298761, now seen corresponding path program 1 times [2025-02-08 05:27:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932880188] [2025-02-08 05:27:48,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:48,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-08 05:27:48,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-08 05:27:48,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:48,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:50,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932880188] [2025-02-08 05:27:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932880188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546181638] [2025-02-08 05:27:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:50,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:50,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:50,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:50,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 554 [2025-02-08 05:27:50,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 470 transitions, 964 flow. Second operand has 10 states, 10 states have (on average 492.0) internal successors, (4920), 10 states have internal predecessors, (4920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:50,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:50,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 554 [2025-02-08 05:27:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:51,177 INFO L124 PetriNetUnfolderBase]: 194/2403 cut-off events. [2025-02-08 05:27:51,177 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:27:51,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 2403 events. 194/2403 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 18065 event pairs, 39 based on Foata normal form. 4/2295 useless extension candidates. Maximal degree in co-relation 2815. Up to 290 conditions per place. [2025-02-08 05:27:51,186 INFO L140 encePairwiseOnDemand]: 522/554 looper letters, 65 selfloop transitions, 43 changer transitions 0/526 dead transitions. [2025-02-08 05:27:51,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 526 transitions, 1308 flow [2025-02-08 05:27:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5011 transitions. [2025-02-08 05:27:51,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9045126353790613 [2025-02-08 05:27:51,196 INFO L175 Difference]: Start difference. First operand has 515 places, 470 transitions, 964 flow. Second operand 10 states and 5011 transitions. [2025-02-08 05:27:51,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 526 transitions, 1308 flow [2025-02-08 05:27:51,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 526 transitions, 1307 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:51,204 INFO L231 Difference]: Finished difference. Result has 498 places, 511 transitions, 1277 flow [2025-02-08 05:27:51,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1277, PETRI_PLACES=498, PETRI_TRANSITIONS=511} [2025-02-08 05:27:51,205 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -49 predicate places. [2025-02-08 05:27:51,205 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 511 transitions, 1277 flow [2025-02-08 05:27:51,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 492.0) internal successors, (4920), 10 states have internal predecessors, (4920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:51,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:51,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:51,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:27:51,207 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:27:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2139713677, now seen corresponding path program 1 times [2025-02-08 05:27:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356386627] [2025-02-08 05:27:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:51,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-08 05:27:51,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-08 05:27:51,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:51,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:27:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356386627] [2025-02-08 05:27:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356386627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-02-08 05:27:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406704206] [2025-02-08 05:27:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:56,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 05:27:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:56,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 05:27:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2025-02-08 05:28:00,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 554 [2025-02-08 05:28:00,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 511 transitions, 1277 flow. Second operand has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:00,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:00,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 554 [2025-02-08 05:28:00,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:03,526 INFO L124 PetriNetUnfolderBase]: 663/3920 cut-off events. [2025-02-08 05:28:03,526 INFO L125 PetriNetUnfolderBase]: For 616/680 co-relation queries the response was YES. [2025-02-08 05:28:03,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3920 events. 663/3920 cut-off events. For 616/680 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 32508 event pairs, 43 based on Foata normal form. 72/3855 useless extension candidates. Maximal degree in co-relation 6490. Up to 542 conditions per place. [2025-02-08 05:28:03,540 INFO L140 encePairwiseOnDemand]: 489/554 looper letters, 180 selfloop transitions, 89 changer transitions 0/650 dead transitions. [2025-02-08 05:28:03,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 650 transitions, 2343 flow [2025-02-08 05:28:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 05:28:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-08 05:28:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 13316 transitions. [2025-02-08 05:28:03,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8288310718287066 [2025-02-08 05:28:03,554 INFO L175 Difference]: Start difference. First operand has 498 places, 511 transitions, 1277 flow. Second operand 29 states and 13316 transitions. [2025-02-08 05:28:03,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 650 transitions, 2343 flow [2025-02-08 05:28:03,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 650 transitions, 2343 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:28:03,569 INFO L231 Difference]: Finished difference. Result has 537 places, 539 transitions, 1772 flow [2025-02-08 05:28:03,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1772, PETRI_PLACES=537, PETRI_TRANSITIONS=539} [2025-02-08 05:28:03,571 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, -10 predicate places. [2025-02-08 05:28:03,571 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 539 transitions, 1772 flow [2025-02-08 05:28:03,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:03,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:03,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:28:03,575 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 951072065, now seen corresponding path program 2 times [2025-02-08 05:28:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668001930] [2025-02-08 05:28:03,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:28:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:03,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 374 statements into 2 equivalence classes. [2025-02-08 05:28:03,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 369 of 374 statements. [2025-02-08 05:28:03,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:28:03,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:28:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668001930] [2025-02-08 05:28:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668001930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-02-08 05:28:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208194484] [2025-02-08 05:28:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:07,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 05:28:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:07,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 05:28:07,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-02-08 05:28:11,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 554 [2025-02-08 05:28:11,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 539 transitions, 1772 flow. Second operand has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:11,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 554 [2025-02-08 05:28:11,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:15,086 INFO L124 PetriNetUnfolderBase]: 1185/5730 cut-off events. [2025-02-08 05:28:15,086 INFO L125 PetriNetUnfolderBase]: For 4698/4916 co-relation queries the response was YES. [2025-02-08 05:28:15,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12949 conditions, 5730 events. 1185/5730 cut-off events. For 4698/4916 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 50694 event pairs, 48 based on Foata normal form. 79/5615 useless extension candidates. Maximal degree in co-relation 12663. Up to 1121 conditions per place. [2025-02-08 05:28:15,152 INFO L140 encePairwiseOnDemand]: 497/554 looper letters, 358 selfloop transitions, 122 changer transitions 0/861 dead transitions. [2025-02-08 05:28:15,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 861 transitions, 4866 flow [2025-02-08 05:28:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 05:28:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-08 05:28:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 14721 transitions. [2025-02-08 05:28:15,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8303813176895307 [2025-02-08 05:28:15,160 INFO L175 Difference]: Start difference. First operand has 537 places, 539 transitions, 1772 flow. Second operand 32 states and 14721 transitions. [2025-02-08 05:28:15,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 861 transitions, 4866 flow [2025-02-08 05:28:15,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 861 transitions, 4807 flow, removed 0 selfloop flow, removed 17 redundant places. [2025-02-08 05:28:15,197 INFO L231 Difference]: Finished difference. Result has 566 places, 626 transitions, 2892 flow [2025-02-08 05:28:15,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2892, PETRI_PLACES=566, PETRI_TRANSITIONS=626} [2025-02-08 05:28:15,205 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, 19 predicate places. [2025-02-08 05:28:15,205 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 626 transitions, 2892 flow [2025-02-08 05:28:15,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:15,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:15,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:15,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:28:15,207 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 887051833, now seen corresponding path program 3 times [2025-02-08 05:28:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145300743] [2025-02-08 05:28:15,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:28:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:15,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 374 statements into 4 equivalence classes. [2025-02-08 05:28:15,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 369 of 374 statements. [2025-02-08 05:28:15,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:28:15,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:28:19,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145300743] [2025-02-08 05:28:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145300743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-02-08 05:28:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562157105] [2025-02-08 05:28:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:19,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 05:28:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:19,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 05:28:19,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-02-08 05:28:23,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 554 [2025-02-08 05:28:23,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 626 transitions, 2892 flow. Second operand has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:23,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:23,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 554 [2025-02-08 05:28:23,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:26,760 INFO L124 PetriNetUnfolderBase]: 1373/7328 cut-off events. [2025-02-08 05:28:26,761 INFO L125 PetriNetUnfolderBase]: For 12988/13209 co-relation queries the response was YES. [2025-02-08 05:28:26,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18728 conditions, 7328 events. 1373/7328 cut-off events. For 12988/13209 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 70765 event pairs, 114 based on Foata normal form. 137/7183 useless extension candidates. Maximal degree in co-relation 18427. Up to 801 conditions per place. [2025-02-08 05:28:26,864 INFO L140 encePairwiseOnDemand]: 497/554 looper letters, 385 selfloop transitions, 168 changer transitions 0/934 dead transitions. [2025-02-08 05:28:26,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 934 transitions, 6520 flow [2025-02-08 05:28:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 05:28:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-08 05:28:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 14709 transitions. [2025-02-08 05:28:26,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8297044223826715 [2025-02-08 05:28:26,874 INFO L175 Difference]: Start difference. First operand has 566 places, 626 transitions, 2892 flow. Second operand 32 states and 14709 transitions. [2025-02-08 05:28:26,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 934 transitions, 6520 flow [2025-02-08 05:28:26,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 934 transitions, 6465 flow, removed 13 selfloop flow, removed 15 redundant places. [2025-02-08 05:28:26,948 INFO L231 Difference]: Finished difference. Result has 598 places, 712 transitions, 4477 flow [2025-02-08 05:28:26,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4477, PETRI_PLACES=598, PETRI_TRANSITIONS=712} [2025-02-08 05:28:26,949 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, 51 predicate places. [2025-02-08 05:28:26,949 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 712 transitions, 4477 flow [2025-02-08 05:28:26,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:26,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:26,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:26,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:28:26,952 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2040041543, now seen corresponding path program 4 times [2025-02-08 05:28:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238247513] [2025-02-08 05:28:26,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:28:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:26,998 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 374 statements into 2 equivalence classes. [2025-02-08 05:28:27,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 374 of 374 statements. [2025-02-08 05:28:27,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:28:27,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:28:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238247513] [2025-02-08 05:28:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238247513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-02-08 05:28:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760783041] [2025-02-08 05:28:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 05:28:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:32,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 05:28:32,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-02-08 05:28:35,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 554 [2025-02-08 05:28:35,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 712 transitions, 4477 flow. Second operand has 27 states, 27 states have (on average 461.037037037037) internal successors, (12448), 27 states have internal predecessors, (12448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:35,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:35,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 554 [2025-02-08 05:28:35,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:39,416 INFO L124 PetriNetUnfolderBase]: 1634/7743 cut-off events. [2025-02-08 05:28:39,417 INFO L125 PetriNetUnfolderBase]: For 27536/27895 co-relation queries the response was YES. [2025-02-08 05:28:39,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24631 conditions, 7743 events. 1634/7743 cut-off events. For 27536/27895 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 73294 event pairs, 93 based on Foata normal form. 300/7764 useless extension candidates. Maximal degree in co-relation 24299. Up to 1232 conditions per place. [2025-02-08 05:28:39,497 INFO L140 encePairwiseOnDemand]: 498/554 looper letters, 392 selfloop transitions, 251 changer transitions 0/1032 dead transitions. [2025-02-08 05:28:39,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 1032 transitions, 8979 flow [2025-02-08 05:28:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 05:28:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-08 05:28:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 15886 transitions. [2025-02-08 05:28:39,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433850074325759 [2025-02-08 05:28:39,512 INFO L175 Difference]: Start difference. First operand has 598 places, 712 transitions, 4477 flow. Second operand 34 states and 15886 transitions. [2025-02-08 05:28:39,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 1032 transitions, 8979 flow [2025-02-08 05:28:39,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 1032 transitions, 8770 flow, removed 90 selfloop flow, removed 15 redundant places. [2025-02-08 05:28:39,767 INFO L231 Difference]: Finished difference. Result has 636 places, 826 transitions, 6801 flow [2025-02-08 05:28:39,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=4322, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=6801, PETRI_PLACES=636, PETRI_TRANSITIONS=826} [2025-02-08 05:28:39,772 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, 89 predicate places. [2025-02-08 05:28:39,772 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 826 transitions, 6801 flow [2025-02-08 05:28:39,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 461.037037037037) internal successors, (12448), 27 states have internal predecessors, (12448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:39,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:39,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:28:39,778 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash -382787845, now seen corresponding path program 5 times [2025-02-08 05:28:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176518596] [2025-02-08 05:28:39,780 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:28:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:39,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 374 statements into 4 equivalence classes. [2025-02-08 05:28:39,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 374 of 374 statements. [2025-02-08 05:28:39,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 05:28:39,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:28:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176518596] [2025-02-08 05:28:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176518596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-02-08 05:28:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716367291] [2025-02-08 05:28:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 05:28:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:43,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 05:28:43,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-02-08 05:28:46,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 554 [2025-02-08 05:28:46,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 826 transitions, 6801 flow. Second operand has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:46,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:46,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 554 [2025-02-08 05:28:46,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:50,885 INFO L124 PetriNetUnfolderBase]: 1816/8873 cut-off events. [2025-02-08 05:28:50,886 INFO L125 PetriNetUnfolderBase]: For 65015/65926 co-relation queries the response was YES. [2025-02-08 05:28:50,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32727 conditions, 8873 events. 1816/8873 cut-off events. For 65015/65926 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 87296 event pairs, 165 based on Foata normal form. 133/8671 useless extension candidates. Maximal degree in co-relation 32362. Up to 998 conditions per place. [2025-02-08 05:28:50,958 INFO L140 encePairwiseOnDemand]: 497/554 looper letters, 632 selfloop transitions, 205 changer transitions 0/1221 dead transitions. [2025-02-08 05:28:50,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 1221 transitions, 13193 flow [2025-02-08 05:28:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-08 05:28:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-02-08 05:28:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 15219 transitions. [2025-02-08 05:28:50,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8324581555628487 [2025-02-08 05:28:50,968 INFO L175 Difference]: Start difference. First operand has 636 places, 826 transitions, 6801 flow. Second operand 33 states and 15219 transitions. [2025-02-08 05:28:50,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 1221 transitions, 13193 flow [2025-02-08 05:28:51,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 1221 transitions, 13055 flow, removed 46 selfloop flow, removed 12 redundant places. [2025-02-08 05:28:51,199 INFO L231 Difference]: Finished difference. Result has 672 places, 914 transitions, 9001 flow [2025-02-08 05:28:51,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=6684, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=9001, PETRI_PLACES=672, PETRI_TRANSITIONS=914} [2025-02-08 05:28:51,200 INFO L279 CegarLoopForPetriNet]: 547 programPoint places, 125 predicate places. [2025-02-08 05:28:51,200 INFO L471 AbstractCegarLoop]: Abstraction has has 672 places, 914 transitions, 9001 flow [2025-02-08 05:28:51,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 453.15625) internal successors, (14501), 32 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:51,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:51,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:51,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:28:51,202 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:28:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 372367333, now seen corresponding path program 6 times [2025-02-08 05:28:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868936235] [2025-02-08 05:28:51,204 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:28:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:51,226 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 374 statements into 4 equivalence classes. [2025-02-08 05:28:51,241 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 369 of 374 statements. [2025-02-08 05:28:51,242 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:28:51,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 05:28:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:55,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868936235] [2025-02-08 05:28:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868936235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:55,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-02-08 05:28:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944149963] [2025-02-08 05:28:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 05:28:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:55,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 05:28:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992